/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_8.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-20 17:17:21,838 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-20 17:17:21,840 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-20 17:17:21,897 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-20 17:17:21,897 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-20 17:17:21,898 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-20 17:17:21,902 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-20 17:17:21,908 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-20 17:17:21,910 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-20 17:17:21,916 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-20 17:17:21,917 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-20 17:17:21,918 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-20 17:17:21,919 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-20 17:17:21,925 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-20 17:17:21,926 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-20 17:17:21,928 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-20 17:17:21,928 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-20 17:17:21,929 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-20 17:17:21,932 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-20 17:17:21,937 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-20 17:17:21,938 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-20 17:17:21,940 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-20 17:17:21,941 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-20 17:17:21,942 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-20 17:17:21,943 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-20 17:17:21,949 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-20 17:17:21,949 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-20 17:17:21,949 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-20 17:17:21,950 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-20 17:17:21,950 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-20 17:17:21,951 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-20 17:17:21,951 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-20 17:17:21,952 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-20 17:17:21,952 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-20 17:17:21,953 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-20 17:17:21,953 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-20 17:17:21,954 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-20 17:17:21,954 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-20 17:17:21,954 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-20 17:17:21,955 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-20 17:17:21,955 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-20 17:17:21,958 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-20 17:17:21,959 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-03-20 17:17:21,970 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-20 17:17:21,970 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-20 17:17:21,972 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-20 17:17:21,972 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-20 17:17:21,972 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-20 17:17:21,973 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-20 17:17:21,973 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-20 17:17:21,973 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-20 17:17:21,973 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-20 17:17:21,974 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-20 17:17:21,974 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-20 17:17:21,974 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-20 17:17:21,974 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-20 17:17:21,974 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-20 17:17:21,974 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-20 17:17:21,975 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-20 17:17:21,975 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-20 17:17:21,975 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-20 17:17:21,975 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 17:17:21,975 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-20 17:17:21,975 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-20 17:17:21,975 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-03-20 17:17:21,975 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-03-20 17:17:21,976 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-20 17:17:21,976 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-03-20 17:17:21,976 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-03-20 17:17:22,223 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-20 17:17:22,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-20 17:17:22,252 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-20 17:17:22,253 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-20 17:17:22,254 INFO L275 PluginConnector]: CDTParser initialized [2022-03-20 17:17:22,254 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_8.c [2022-03-20 17:17:22,311 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/467bd45c8/4fbc77b0cba544b3bec3c5bda84b546b/FLAGff07aec54 [2022-03-20 17:17:22,750 INFO L306 CDTParser]: Found 1 translation units. [2022-03-20 17:17:22,751 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c [2022-03-20 17:17:22,761 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/467bd45c8/4fbc77b0cba544b3bec3c5bda84b546b/FLAGff07aec54 [2022-03-20 17:17:22,781 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/467bd45c8/4fbc77b0cba544b3bec3c5bda84b546b [2022-03-20 17:17:22,783 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-20 17:17:22,787 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-20 17:17:22,788 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-20 17:17:22,788 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-20 17:17:22,791 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-20 17:17:22,792 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 05:17:22" (1/1) ... [2022-03-20 17:17:22,793 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16c5dde8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:17:22, skipping insertion in model container [2022-03-20 17:17:22,793 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 05:17:22" (1/1) ... [2022-03-20 17:17:22,798 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-20 17:17:22,816 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-20 17:17:22,993 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c[3218,3231] [2022-03-20 17:17:22,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 17:17:23,001 INFO L203 MainTranslator]: Completed pre-run [2022-03-20 17:17:23,018 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c[3218,3231] [2022-03-20 17:17:23,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 17:17:23,029 INFO L208 MainTranslator]: Completed translation [2022-03-20 17:17:23,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:17:23 WrapperNode [2022-03-20 17:17:23,029 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-20 17:17:23,030 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-20 17:17:23,030 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-20 17:17:23,030 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-20 17:17:23,038 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:17:23" (1/1) ... [2022-03-20 17:17:23,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:17:23" (1/1) ... [2022-03-20 17:17:23,044 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:17:23" (1/1) ... [2022-03-20 17:17:23,045 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:17:23" (1/1) ... [2022-03-20 17:17:23,058 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:17:23" (1/1) ... [2022-03-20 17:17:23,067 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:17:23" (1/1) ... [2022-03-20 17:17:23,068 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:17:23" (1/1) ... [2022-03-20 17:17:23,069 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-20 17:17:23,070 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-20 17:17:23,070 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-20 17:17:23,070 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-20 17:17:23,073 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:17:23" (1/1) ... [2022-03-20 17:17:23,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 17:17:23,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 17:17:23,104 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-20 17:17:23,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-20 17:17:23,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-20 17:17:23,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-20 17:17:23,140 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-20 17:17:23,141 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-20 17:17:23,141 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-20 17:17:23,141 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-20 17:17:23,141 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-20 17:17:23,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-20 17:17:23,141 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-20 17:17:23,141 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-20 17:17:23,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-20 17:17:23,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-20 17:17:23,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-20 17:17:23,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-20 17:17:23,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-20 17:17:23,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-20 17:17:23,222 INFO L234 CfgBuilder]: Building ICFG [2022-03-20 17:17:23,223 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-20 17:17:23,426 INFO L275 CfgBuilder]: Performing block encoding [2022-03-20 17:17:23,431 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-20 17:17:23,431 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-20 17:17:23,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 05:17:23 BoogieIcfgContainer [2022-03-20 17:17:23,432 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-20 17:17:23,434 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-20 17:17:23,434 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-20 17:17:23,437 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-20 17:17:23,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 05:17:22" (1/3) ... [2022-03-20 17:17:23,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb978e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 05:17:23, skipping insertion in model container [2022-03-20 17:17:23,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 05:17:23" (2/3) ... [2022-03-20 17:17:23,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb978e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 05:17:23, skipping insertion in model container [2022-03-20 17:17:23,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 05:17:23" (3/3) ... [2022-03-20 17:17:23,439 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2022-03-20 17:17:23,442 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-20 17:17:23,442 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-20 17:17:23,498 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-20 17:17:23,503 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-03-20 17:17:23,503 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-20 17:17:23,519 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-20 17:17:23,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-20 17:17:23,535 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:17:23,535 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:17:23,536 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:17:23,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:17:23,544 INFO L85 PathProgramCache]: Analyzing trace with hash 957163615, now seen corresponding path program 1 times [2022-03-20 17:17:23,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:23,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [127345845] [2022-03-20 17:17:23,565 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:17:23,566 INFO L85 PathProgramCache]: Analyzing trace with hash 957163615, now seen corresponding path program 2 times [2022-03-20 17:17:23,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:17:23,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287237147] [2022-03-20 17:17:23,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:17:23,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:17:23,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:23,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:17:23,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:23,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 17:17:23,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:17:23,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287237147] [2022-03-20 17:17:23,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287237147] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:23,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:23,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:23,811 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:17:23,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [127345845] [2022-03-20 17:17:23,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [127345845] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:23,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:23,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:23,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850695051] [2022-03-20 17:17:23,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:17:23,816 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:17:23,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:23,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:17:23,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:17:23,847 INFO L87 Difference]: Start difference. First operand has 39 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:24,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:17:24,020 INFO L93 Difference]: Finished difference Result 76 states and 127 transitions. [2022-03-20 17:17:24,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:17:24,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-20 17:17:24,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:17:24,033 INFO L225 Difference]: With dead ends: 76 [2022-03-20 17:17:24,033 INFO L226 Difference]: Without dead ends: 61 [2022-03-20 17:17:24,035 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:17:24,039 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 140 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 17:17:24,040 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 77 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 17:17:24,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-03-20 17:17:24,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 43. [2022-03-20 17:17:24,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:24,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 74 transitions. [2022-03-20 17:17:24,092 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 74 transitions. Word has length 19 [2022-03-20 17:17:24,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:17:24,092 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 74 transitions. [2022-03-20 17:17:24,092 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:24,094 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 74 transitions. [2022-03-20 17:17:24,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-20 17:17:24,094 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:17:24,095 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:17:24,095 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-20 17:17:24,095 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:17:24,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:17:24,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1658228193, now seen corresponding path program 1 times [2022-03-20 17:17:24,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:24,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [673531245] [2022-03-20 17:17:24,099 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:17:24,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1658228193, now seen corresponding path program 2 times [2022-03-20 17:17:24,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:17:24,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891761287] [2022-03-20 17:17:24,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:17:24,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:17:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:24,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:17:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:24,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 17:17:24,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:17:24,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891761287] [2022-03-20 17:17:24,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891761287] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:24,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:24,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:24,152 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:17:24,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [673531245] [2022-03-20 17:17:24,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [673531245] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:24,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:24,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:24,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580717422] [2022-03-20 17:17:24,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:17:24,153 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:17:24,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:24,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:17:24,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:17:24,154 INFO L87 Difference]: Start difference. First operand 43 states and 74 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:24,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:17:24,295 INFO L93 Difference]: Finished difference Result 98 states and 173 transitions. [2022-03-20 17:17:24,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:17:24,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-20 17:17:24,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:17:24,296 INFO L225 Difference]: With dead ends: 98 [2022-03-20 17:17:24,297 INFO L226 Difference]: Without dead ends: 61 [2022-03-20 17:17:24,297 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:17:24,298 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 118 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 17:17:24,299 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 79 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 17:17:24,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-03-20 17:17:24,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2022-03-20 17:17:24,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:24,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 102 transitions. [2022-03-20 17:17:24,325 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 102 transitions. Word has length 19 [2022-03-20 17:17:24,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:17:24,325 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 102 transitions. [2022-03-20 17:17:24,325 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:24,325 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 102 transitions. [2022-03-20 17:17:24,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-20 17:17:24,326 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:17:24,326 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:17:24,327 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-20 17:17:24,327 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:17:24,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:17:24,327 INFO L85 PathProgramCache]: Analyzing trace with hash -392484976, now seen corresponding path program 1 times [2022-03-20 17:17:24,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:24,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1701298004] [2022-03-20 17:17:24,328 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:17:24,328 INFO L85 PathProgramCache]: Analyzing trace with hash -392484976, now seen corresponding path program 2 times [2022-03-20 17:17:24,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:17:24,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508470198] [2022-03-20 17:17:24,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:17:24,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:17:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:24,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:17:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:24,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 17:17:24,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:17:24,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508470198] [2022-03-20 17:17:24,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508470198] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:24,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:24,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:24,397 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:17:24,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1701298004] [2022-03-20 17:17:24,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1701298004] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:24,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:24,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:24,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828061471] [2022-03-20 17:17:24,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:17:24,399 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:17:24,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:24,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:17:24,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:17:24,400 INFO L87 Difference]: Start difference. First operand 59 states and 102 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:24,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:17:24,485 INFO L93 Difference]: Finished difference Result 91 states and 154 transitions. [2022-03-20 17:17:24,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:17:24,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-03-20 17:17:24,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:17:24,486 INFO L225 Difference]: With dead ends: 91 [2022-03-20 17:17:24,487 INFO L226 Difference]: Without dead ends: 64 [2022-03-20 17:17:24,487 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:17:24,488 INFO L913 BasicCegarLoop]: 86 mSDtfsCounter, 105 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 17:17:24,489 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 93 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 17:17:24,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-03-20 17:17:24,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2022-03-20 17:17:24,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:24,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 104 transitions. [2022-03-20 17:17:24,512 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 104 transitions. Word has length 20 [2022-03-20 17:17:24,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:17:24,513 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 104 transitions. [2022-03-20 17:17:24,513 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:24,513 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 104 transitions. [2022-03-20 17:17:24,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-20 17:17:24,514 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:17:24,514 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:17:24,514 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-20 17:17:24,514 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:17:24,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:17:24,515 INFO L85 PathProgramCache]: Analyzing trace with hash -134319538, now seen corresponding path program 1 times [2022-03-20 17:17:24,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:24,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1567654785] [2022-03-20 17:17:24,516 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:17:24,516 INFO L85 PathProgramCache]: Analyzing trace with hash -134319538, now seen corresponding path program 2 times [2022-03-20 17:17:24,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:17:24,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648754995] [2022-03-20 17:17:24,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:17:24,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:17:24,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:24,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:17:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:24,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 17:17:24,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:17:24,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648754995] [2022-03-20 17:17:24,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648754995] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:24,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:24,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:24,595 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:17:24,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1567654785] [2022-03-20 17:17:24,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1567654785] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:24,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:24,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:24,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920352456] [2022-03-20 17:17:24,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:17:24,596 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:17:24,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:24,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:17:24,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:17:24,597 INFO L87 Difference]: Start difference. First operand 62 states and 104 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:24,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:17:24,715 INFO L93 Difference]: Finished difference Result 166 states and 288 transitions. [2022-03-20 17:17:24,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:17:24,716 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-03-20 17:17:24,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:17:24,719 INFO L225 Difference]: With dead ends: 166 [2022-03-20 17:17:24,720 INFO L226 Difference]: Without dead ends: 113 [2022-03-20 17:17:24,721 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:17:24,729 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 129 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 17:17:24,730 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 67 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 17:17:24,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-03-20 17:17:24,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2022-03-20 17:17:24,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 107 states have (on average 1.7383177570093458) internal successors, (186), 107 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:24,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 189 transitions. [2022-03-20 17:17:24,749 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 189 transitions. Word has length 20 [2022-03-20 17:17:24,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:17:24,749 INFO L478 AbstractCegarLoop]: Abstraction has 111 states and 189 transitions. [2022-03-20 17:17:24,750 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:24,750 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 189 transitions. [2022-03-20 17:17:24,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-20 17:17:24,751 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:17:24,751 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:17:24,751 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-20 17:17:24,751 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:17:24,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:17:24,752 INFO L85 PathProgramCache]: Analyzing trace with hash -835384116, now seen corresponding path program 1 times [2022-03-20 17:17:24,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:24,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [759457050] [2022-03-20 17:17:24,753 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:17:24,753 INFO L85 PathProgramCache]: Analyzing trace with hash -835384116, now seen corresponding path program 2 times [2022-03-20 17:17:24,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:17:24,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258306409] [2022-03-20 17:17:24,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:17:24,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:17:24,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:24,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:17:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:24,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 17:17:24,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:17:24,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258306409] [2022-03-20 17:17:24,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258306409] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:24,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:24,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:24,795 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:17:24,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [759457050] [2022-03-20 17:17:24,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [759457050] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:24,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:24,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:24,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994667084] [2022-03-20 17:17:24,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:17:24,796 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:17:24,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:24,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:17:24,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:17:24,797 INFO L87 Difference]: Start difference. First operand 111 states and 189 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:24,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:17:24,867 INFO L93 Difference]: Finished difference Result 143 states and 243 transitions. [2022-03-20 17:17:24,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:17:24,868 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-03-20 17:17:24,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:17:24,869 INFO L225 Difference]: With dead ends: 143 [2022-03-20 17:17:24,869 INFO L226 Difference]: Without dead ends: 141 [2022-03-20 17:17:24,870 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:17:24,870 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 84 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 17:17:24,871 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 104 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 17:17:24,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-03-20 17:17:24,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 111. [2022-03-20 17:17:24,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:24,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 187 transitions. [2022-03-20 17:17:24,886 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 187 transitions. Word has length 20 [2022-03-20 17:17:24,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:17:24,886 INFO L478 AbstractCegarLoop]: Abstraction has 111 states and 187 transitions. [2022-03-20 17:17:24,886 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:24,887 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 187 transitions. [2022-03-20 17:17:24,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-20 17:17:24,887 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:17:24,888 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:17:24,888 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-20 17:17:24,888 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:17:24,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:17:24,888 INFO L85 PathProgramCache]: Analyzing trace with hash 131275990, now seen corresponding path program 1 times [2022-03-20 17:17:24,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:24,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1053761041] [2022-03-20 17:17:24,889 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:17:24,889 INFO L85 PathProgramCache]: Analyzing trace with hash 131275990, now seen corresponding path program 2 times [2022-03-20 17:17:24,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:17:24,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27270628] [2022-03-20 17:17:24,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:17:24,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:17:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:24,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:17:24,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:24,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 17:17:24,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:17:24,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27270628] [2022-03-20 17:17:24,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27270628] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:24,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:24,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:24,929 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:17:24,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1053761041] [2022-03-20 17:17:24,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1053761041] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:24,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:24,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:24,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84385590] [2022-03-20 17:17:24,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:17:24,930 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:17:24,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:24,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:17:24,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:17:24,931 INFO L87 Difference]: Start difference. First operand 111 states and 187 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:25,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:17:25,007 INFO L93 Difference]: Finished difference Result 203 states and 347 transitions. [2022-03-20 17:17:25,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:17:25,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-03-20 17:17:25,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:17:25,009 INFO L225 Difference]: With dead ends: 203 [2022-03-20 17:17:25,009 INFO L226 Difference]: Without dead ends: 201 [2022-03-20 17:17:25,009 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:17:25,010 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 120 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 17:17:25,010 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 64 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 17:17:25,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-03-20 17:17:25,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 151. [2022-03-20 17:17:25,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 147 states have internal predecessors, (250), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:25,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 253 transitions. [2022-03-20 17:17:25,031 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 253 transitions. Word has length 21 [2022-03-20 17:17:25,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:17:25,031 INFO L478 AbstractCegarLoop]: Abstraction has 151 states and 253 transitions. [2022-03-20 17:17:25,031 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:25,032 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 253 transitions. [2022-03-20 17:17:25,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-20 17:17:25,033 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:17:25,033 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:17:25,033 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-20 17:17:25,033 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:17:25,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:17:25,034 INFO L85 PathProgramCache]: Analyzing trace with hash 832340568, now seen corresponding path program 1 times [2022-03-20 17:17:25,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:25,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [507017097] [2022-03-20 17:17:25,034 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:17:25,034 INFO L85 PathProgramCache]: Analyzing trace with hash 832340568, now seen corresponding path program 2 times [2022-03-20 17:17:25,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:17:25,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656803966] [2022-03-20 17:17:25,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:17:25,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:17:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:25,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:17:25,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:25,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 17:17:25,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:17:25,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656803966] [2022-03-20 17:17:25,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656803966] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:25,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:25,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:25,071 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:17:25,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [507017097] [2022-03-20 17:17:25,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [507017097] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:25,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:25,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:25,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397799124] [2022-03-20 17:17:25,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:17:25,072 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:17:25,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:25,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:17:25,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:17:25,073 INFO L87 Difference]: Start difference. First operand 151 states and 253 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:25,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:17:25,171 INFO L93 Difference]: Finished difference Result 351 states and 595 transitions. [2022-03-20 17:17:25,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:17:25,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-03-20 17:17:25,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:17:25,173 INFO L225 Difference]: With dead ends: 351 [2022-03-20 17:17:25,173 INFO L226 Difference]: Without dead ends: 209 [2022-03-20 17:17:25,174 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:17:25,175 INFO L913 BasicCegarLoop]: 76 mSDtfsCounter, 106 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 17:17:25,175 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 83 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 17:17:25,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-03-20 17:17:25,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2022-03-20 17:17:25,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 203 states have (on average 1.6748768472906403) internal successors, (340), 203 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:25,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 343 transitions. [2022-03-20 17:17:25,201 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 343 transitions. Word has length 21 [2022-03-20 17:17:25,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:17:25,201 INFO L478 AbstractCegarLoop]: Abstraction has 207 states and 343 transitions. [2022-03-20 17:17:25,201 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:25,201 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 343 transitions. [2022-03-20 17:17:25,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-20 17:17:25,202 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:17:25,202 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:17:25,203 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-20 17:17:25,203 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:17:25,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:17:25,203 INFO L85 PathProgramCache]: Analyzing trace with hash -225196893, now seen corresponding path program 1 times [2022-03-20 17:17:25,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:25,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [562706998] [2022-03-20 17:17:25,204 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:17:25,204 INFO L85 PathProgramCache]: Analyzing trace with hash -225196893, now seen corresponding path program 2 times [2022-03-20 17:17:25,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:17:25,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142730949] [2022-03-20 17:17:25,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:17:25,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:17:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:25,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:17:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:25,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 17:17:25,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:17:25,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142730949] [2022-03-20 17:17:25,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142730949] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:25,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:25,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:25,237 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:17:25,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [562706998] [2022-03-20 17:17:25,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [562706998] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:25,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:25,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:25,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191513519] [2022-03-20 17:17:25,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:17:25,238 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:17:25,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:25,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:17:25,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:17:25,239 INFO L87 Difference]: Start difference. First operand 207 states and 343 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:25,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:17:25,334 INFO L93 Difference]: Finished difference Result 313 states and 517 transitions. [2022-03-20 17:17:25,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:17:25,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-03-20 17:17:25,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:17:25,336 INFO L225 Difference]: With dead ends: 313 [2022-03-20 17:17:25,336 INFO L226 Difference]: Without dead ends: 215 [2022-03-20 17:17:25,337 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:17:25,338 INFO L913 BasicCegarLoop]: 80 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 17:17:25,338 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 87 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 17:17:25,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-03-20 17:17:25,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2022-03-20 17:17:25,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 209 states have (on average 1.645933014354067) internal successors, (344), 209 states have internal predecessors, (344), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:25,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 347 transitions. [2022-03-20 17:17:25,365 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 347 transitions. Word has length 22 [2022-03-20 17:17:25,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:17:25,365 INFO L478 AbstractCegarLoop]: Abstraction has 213 states and 347 transitions. [2022-03-20 17:17:25,365 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:25,365 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 347 transitions. [2022-03-20 17:17:25,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-20 17:17:25,369 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:17:25,369 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:17:25,369 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-20 17:17:25,369 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:17:25,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:17:25,370 INFO L85 PathProgramCache]: Analyzing trace with hash 32968545, now seen corresponding path program 1 times [2022-03-20 17:17:25,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:25,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1819862543] [2022-03-20 17:17:25,370 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:17:25,370 INFO L85 PathProgramCache]: Analyzing trace with hash 32968545, now seen corresponding path program 2 times [2022-03-20 17:17:25,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:17:25,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089254588] [2022-03-20 17:17:25,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:17:25,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:17:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:25,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:17:25,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:25,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 17:17:25,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:17:25,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089254588] [2022-03-20 17:17:25,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089254588] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:25,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:25,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:25,424 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:17:25,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1819862543] [2022-03-20 17:17:25,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1819862543] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:25,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:25,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:25,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561859127] [2022-03-20 17:17:25,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:17:25,425 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:17:25,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:25,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:17:25,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:17:25,426 INFO L87 Difference]: Start difference. First operand 213 states and 347 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:25,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:17:25,522 INFO L93 Difference]: Finished difference Result 381 states and 629 transitions. [2022-03-20 17:17:25,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:17:25,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-03-20 17:17:25,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:17:25,524 INFO L225 Difference]: With dead ends: 381 [2022-03-20 17:17:25,524 INFO L226 Difference]: Without dead ends: 379 [2022-03-20 17:17:25,525 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:17:25,525 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 113 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 17:17:25,526 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 63 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 17:17:25,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-03-20 17:17:25,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 297. [2022-03-20 17:17:25,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 293 states have (on average 1.6109215017064846) internal successors, (472), 293 states have internal predecessors, (472), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:25,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 475 transitions. [2022-03-20 17:17:25,560 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 475 transitions. Word has length 22 [2022-03-20 17:17:25,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:17:25,560 INFO L478 AbstractCegarLoop]: Abstraction has 297 states and 475 transitions. [2022-03-20 17:17:25,560 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:25,560 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 475 transitions. [2022-03-20 17:17:25,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-20 17:17:25,561 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:17:25,561 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:17:25,562 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-20 17:17:25,562 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:17:25,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:17:25,562 INFO L85 PathProgramCache]: Analyzing trace with hash 734033123, now seen corresponding path program 1 times [2022-03-20 17:17:25,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:25,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [935425616] [2022-03-20 17:17:25,563 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:17:25,563 INFO L85 PathProgramCache]: Analyzing trace with hash 734033123, now seen corresponding path program 2 times [2022-03-20 17:17:25,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:17:25,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150878654] [2022-03-20 17:17:25,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:17:25,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:17:25,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:25,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:17:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:25,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 17:17:25,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:17:25,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150878654] [2022-03-20 17:17:25,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150878654] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:25,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:25,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:25,594 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:17:25,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [935425616] [2022-03-20 17:17:25,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [935425616] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:25,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:25,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:25,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98096557] [2022-03-20 17:17:25,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:17:25,595 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:17:25,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:25,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:17:25,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:17:25,596 INFO L87 Difference]: Start difference. First operand 297 states and 475 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:25,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:17:25,701 INFO L93 Difference]: Finished difference Result 685 states and 1101 transitions. [2022-03-20 17:17:25,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:17:25,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-03-20 17:17:25,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:17:25,704 INFO L225 Difference]: With dead ends: 685 [2022-03-20 17:17:25,704 INFO L226 Difference]: Without dead ends: 403 [2022-03-20 17:17:25,705 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:17:25,706 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 100 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 17:17:25,706 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 85 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 17:17:25,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2022-03-20 17:17:25,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 401. [2022-03-20 17:17:25,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 397 states have (on average 1.5818639798488665) internal successors, (628), 397 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:25,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 631 transitions. [2022-03-20 17:17:25,752 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 631 transitions. Word has length 22 [2022-03-20 17:17:25,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:17:25,752 INFO L478 AbstractCegarLoop]: Abstraction has 401 states and 631 transitions. [2022-03-20 17:17:25,752 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:25,752 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 631 transitions. [2022-03-20 17:17:25,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-20 17:17:25,753 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:17:25,753 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:17:25,753 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-20 17:17:25,753 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:17:25,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:17:25,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1022239949, now seen corresponding path program 1 times [2022-03-20 17:17:25,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:25,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [877102461] [2022-03-20 17:17:25,754 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:17:25,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1022239949, now seen corresponding path program 2 times [2022-03-20 17:17:25,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:17:25,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157584500] [2022-03-20 17:17:25,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:17:25,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:17:25,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:25,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:17:25,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:25,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 17:17:25,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:17:25,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157584500] [2022-03-20 17:17:25,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157584500] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:25,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:25,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:25,784 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:17:25,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [877102461] [2022-03-20 17:17:25,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [877102461] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:25,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:25,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:25,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084347732] [2022-03-20 17:17:25,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:17:25,784 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:17:25,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:25,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:17:25,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:17:25,785 INFO L87 Difference]: Start difference. First operand 401 states and 631 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:25,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:17:25,909 INFO L93 Difference]: Finished difference Result 601 states and 941 transitions. [2022-03-20 17:17:25,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:17:25,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-03-20 17:17:25,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:17:25,912 INFO L225 Difference]: With dead ends: 601 [2022-03-20 17:17:25,912 INFO L226 Difference]: Without dead ends: 411 [2022-03-20 17:17:25,912 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:17:25,913 INFO L913 BasicCegarLoop]: 77 mSDtfsCounter, 102 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 17:17:25,913 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 84 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 17:17:25,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2022-03-20 17:17:25,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 409. [2022-03-20 17:17:25,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 405 states have (on average 1.5506172839506174) internal successors, (628), 405 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:25,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 631 transitions. [2022-03-20 17:17:25,958 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 631 transitions. Word has length 23 [2022-03-20 17:17:25,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:17:25,958 INFO L478 AbstractCegarLoop]: Abstraction has 409 states and 631 transitions. [2022-03-20 17:17:25,958 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:25,959 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 631 transitions. [2022-03-20 17:17:25,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-20 17:17:25,959 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:17:25,959 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:17:25,960 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-20 17:17:25,960 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:17:25,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:17:25,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1280405387, now seen corresponding path program 1 times [2022-03-20 17:17:25,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:25,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [280117643] [2022-03-20 17:17:25,961 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:17:25,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1280405387, now seen corresponding path program 2 times [2022-03-20 17:17:25,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:17:25,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483219352] [2022-03-20 17:17:25,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:17:25,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:17:25,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:25,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:17:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:25,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 17:17:25,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:17:25,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483219352] [2022-03-20 17:17:25,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483219352] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:25,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:25,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:25,990 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:17:25,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [280117643] [2022-03-20 17:17:25,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [280117643] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:25,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:25,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:25,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895446616] [2022-03-20 17:17:25,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:17:25,991 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:17:25,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:25,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:17:25,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:17:25,992 INFO L87 Difference]: Start difference. First operand 409 states and 631 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:26,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:17:26,111 INFO L93 Difference]: Finished difference Result 717 states and 1121 transitions. [2022-03-20 17:17:26,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:17:26,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-03-20 17:17:26,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:17:26,114 INFO L225 Difference]: With dead ends: 717 [2022-03-20 17:17:26,114 INFO L226 Difference]: Without dead ends: 715 [2022-03-20 17:17:26,115 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:17:26,116 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 106 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 17:17:26,116 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 62 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 17:17:26,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2022-03-20 17:17:26,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 585. [2022-03-20 17:17:26,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 581 states have (on average 1.5077452667814113) internal successors, (876), 581 states have internal predecessors, (876), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:26,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 879 transitions. [2022-03-20 17:17:26,173 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 879 transitions. Word has length 23 [2022-03-20 17:17:26,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:17:26,174 INFO L478 AbstractCegarLoop]: Abstraction has 585 states and 879 transitions. [2022-03-20 17:17:26,174 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:26,174 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 879 transitions. [2022-03-20 17:17:26,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-20 17:17:26,175 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:17:26,175 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:17:26,175 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-20 17:17:26,175 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:17:26,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:17:26,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1981469965, now seen corresponding path program 1 times [2022-03-20 17:17:26,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:26,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1328218991] [2022-03-20 17:17:26,177 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:17:26,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1981469965, now seen corresponding path program 2 times [2022-03-20 17:17:26,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:17:26,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589473853] [2022-03-20 17:17:26,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:17:26,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:17:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:26,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:17:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:26,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 17:17:26,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:17:26,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589473853] [2022-03-20 17:17:26,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589473853] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:26,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:26,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:26,206 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:17:26,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1328218991] [2022-03-20 17:17:26,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1328218991] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:26,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:26,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:26,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750481895] [2022-03-20 17:17:26,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:17:26,207 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:17:26,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:26,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:17:26,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:17:26,208 INFO L87 Difference]: Start difference. First operand 585 states and 879 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:26,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:17:26,360 INFO L93 Difference]: Finished difference Result 1341 states and 2017 transitions. [2022-03-20 17:17:26,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:17:26,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-03-20 17:17:26,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:17:26,364 INFO L225 Difference]: With dead ends: 1341 [2022-03-20 17:17:26,364 INFO L226 Difference]: Without dead ends: 779 [2022-03-20 17:17:26,365 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:17:26,366 INFO L913 BasicCegarLoop]: 80 mSDtfsCounter, 94 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 17:17:26,366 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 87 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 17:17:26,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2022-03-20 17:17:26,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 777. [2022-03-20 17:17:26,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 773 states have (on average 1.4747736093143597) internal successors, (1140), 773 states have internal predecessors, (1140), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:26,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1143 transitions. [2022-03-20 17:17:26,445 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1143 transitions. Word has length 23 [2022-03-20 17:17:26,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:17:26,445 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 1143 transitions. [2022-03-20 17:17:26,445 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:26,445 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1143 transitions. [2022-03-20 17:17:26,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-20 17:17:26,446 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:17:26,447 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:17:26,447 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-20 17:17:26,447 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:17:26,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:17:26,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1038076728, now seen corresponding path program 1 times [2022-03-20 17:17:26,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:26,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [193767454] [2022-03-20 17:17:26,448 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:17:26,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1038076728, now seen corresponding path program 2 times [2022-03-20 17:17:26,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:17:26,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940621434] [2022-03-20 17:17:26,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:17:26,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:17:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:26,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:17:26,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:26,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 17:17:26,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:17:26,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940621434] [2022-03-20 17:17:26,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940621434] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:26,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:26,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:26,474 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:17:26,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [193767454] [2022-03-20 17:17:26,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [193767454] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:26,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:26,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:26,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327807344] [2022-03-20 17:17:26,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:17:26,475 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:17:26,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:26,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:17:26,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:17:26,475 INFO L87 Difference]: Start difference. First operand 777 states and 1143 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:26,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:17:26,625 INFO L93 Difference]: Finished difference Result 1165 states and 1705 transitions. [2022-03-20 17:17:26,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:17:26,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-03-20 17:17:26,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:17:26,629 INFO L225 Difference]: With dead ends: 1165 [2022-03-20 17:17:26,629 INFO L226 Difference]: Without dead ends: 795 [2022-03-20 17:17:26,630 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:17:26,631 INFO L913 BasicCegarLoop]: 74 mSDtfsCounter, 101 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 17:17:26,631 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 81 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 17:17:26,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2022-03-20 17:17:26,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 793. [2022-03-20 17:17:26,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 789 states have (on average 1.4448669201520912) internal successors, (1140), 789 states have internal predecessors, (1140), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:26,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1143 transitions. [2022-03-20 17:17:26,725 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1143 transitions. Word has length 24 [2022-03-20 17:17:26,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:17:26,725 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 1143 transitions. [2022-03-20 17:17:26,725 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:26,725 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1143 transitions. [2022-03-20 17:17:26,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-20 17:17:26,726 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:17:26,726 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:17:26,727 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-20 17:17:26,727 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:17:26,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:17:26,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1296242166, now seen corresponding path program 1 times [2022-03-20 17:17:26,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:26,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1050486983] [2022-03-20 17:17:26,728 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:17:26,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1296242166, now seen corresponding path program 2 times [2022-03-20 17:17:26,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:17:26,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216147793] [2022-03-20 17:17:26,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:17:26,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:17:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:26,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:17:26,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:26,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 17:17:26,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:17:26,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216147793] [2022-03-20 17:17:26,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216147793] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:26,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:26,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:26,756 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:17:26,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1050486983] [2022-03-20 17:17:26,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1050486983] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:26,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:26,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:26,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597107941] [2022-03-20 17:17:26,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:17:26,757 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:17:26,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:26,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:17:26,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:17:26,758 INFO L87 Difference]: Start difference. First operand 793 states and 1143 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:26,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:17:26,955 INFO L93 Difference]: Finished difference Result 1357 states and 1977 transitions. [2022-03-20 17:17:26,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:17:26,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-03-20 17:17:26,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:17:26,961 INFO L225 Difference]: With dead ends: 1357 [2022-03-20 17:17:26,961 INFO L226 Difference]: Without dead ends: 1355 [2022-03-20 17:17:26,962 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:17:26,962 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 99 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 17:17:26,963 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 61 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 17:17:26,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2022-03-20 17:17:27,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1161. [2022-03-20 17:17:27,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 1157 states have (on average 1.400172860847018) internal successors, (1620), 1157 states have internal predecessors, (1620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:27,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1623 transitions. [2022-03-20 17:17:27,100 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1623 transitions. Word has length 24 [2022-03-20 17:17:27,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:17:27,101 INFO L478 AbstractCegarLoop]: Abstraction has 1161 states and 1623 transitions. [2022-03-20 17:17:27,101 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:27,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1623 transitions. [2022-03-20 17:17:27,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-20 17:17:27,103 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:17:27,103 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:17:27,103 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-20 17:17:27,103 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:17:27,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:17:27,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1997306744, now seen corresponding path program 1 times [2022-03-20 17:17:27,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:27,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1613337409] [2022-03-20 17:17:27,104 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:17:27,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1997306744, now seen corresponding path program 2 times [2022-03-20 17:17:27,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:17:27,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390113523] [2022-03-20 17:17:27,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:17:27,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:17:27,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:27,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:17:27,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:27,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 17:17:27,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:17:27,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390113523] [2022-03-20 17:17:27,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390113523] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:27,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:27,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:27,148 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:17:27,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1613337409] [2022-03-20 17:17:27,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1613337409] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:27,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:27,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:27,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230922418] [2022-03-20 17:17:27,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:17:27,149 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:17:27,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:27,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:17:27,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:17:27,150 INFO L87 Difference]: Start difference. First operand 1161 states and 1623 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:27,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:17:27,396 INFO L93 Difference]: Finished difference Result 2637 states and 3673 transitions. [2022-03-20 17:17:27,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:17:27,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-03-20 17:17:27,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:17:27,402 INFO L225 Difference]: With dead ends: 2637 [2022-03-20 17:17:27,402 INFO L226 Difference]: Without dead ends: 1515 [2022-03-20 17:17:27,404 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:17:27,405 INFO L913 BasicCegarLoop]: 82 mSDtfsCounter, 88 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 17:17:27,405 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 89 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 17:17:27,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2022-03-20 17:17:27,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1513. [2022-03-20 17:17:27,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1509 states have (on average 1.359840954274354) internal successors, (2052), 1509 states have internal predecessors, (2052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:27,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2055 transitions. [2022-03-20 17:17:27,547 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2055 transitions. Word has length 24 [2022-03-20 17:17:27,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:17:27,547 INFO L478 AbstractCegarLoop]: Abstraction has 1513 states and 2055 transitions. [2022-03-20 17:17:27,547 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:27,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2055 transitions. [2022-03-20 17:17:27,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-20 17:17:27,549 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:17:27,549 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:17:27,549 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-20 17:17:27,550 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:17:27,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:17:27,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1529017218, now seen corresponding path program 1 times [2022-03-20 17:17:27,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:27,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1300694556] [2022-03-20 17:17:27,551 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:17:27,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1529017218, now seen corresponding path program 2 times [2022-03-20 17:17:27,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:17:27,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698726996] [2022-03-20 17:17:27,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:17:27,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:17:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:27,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:17:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:27,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 17:17:27,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:17:27,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698726996] [2022-03-20 17:17:27,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698726996] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:27,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:27,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:27,575 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:17:27,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1300694556] [2022-03-20 17:17:27,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1300694556] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:27,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:27,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:27,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710055654] [2022-03-20 17:17:27,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:17:27,576 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:17:27,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:27,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:17:27,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:17:27,577 INFO L87 Difference]: Start difference. First operand 1513 states and 2055 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:27,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:17:27,781 INFO L93 Difference]: Finished difference Result 2269 states and 3065 transitions. [2022-03-20 17:17:27,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:17:27,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-03-20 17:17:27,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:17:27,787 INFO L225 Difference]: With dead ends: 2269 [2022-03-20 17:17:27,787 INFO L226 Difference]: Without dead ends: 1547 [2022-03-20 17:17:27,788 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:17:27,789 INFO L913 BasicCegarLoop]: 71 mSDtfsCounter, 100 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 17:17:27,789 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 78 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 17:17:27,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2022-03-20 17:17:27,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1545. [2022-03-20 17:17:27,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1541 states have (on average 1.3316028552887735) internal successors, (2052), 1541 states have internal predecessors, (2052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:27,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2055 transitions. [2022-03-20 17:17:27,919 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2055 transitions. Word has length 25 [2022-03-20 17:17:27,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:17:27,919 INFO L478 AbstractCegarLoop]: Abstraction has 1545 states and 2055 transitions. [2022-03-20 17:17:27,919 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:27,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2055 transitions. [2022-03-20 17:17:27,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-20 17:17:27,921 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:17:27,921 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:17:27,922 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-20 17:17:27,922 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:17:27,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:17:27,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1787182656, now seen corresponding path program 1 times [2022-03-20 17:17:27,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:27,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1409607133] [2022-03-20 17:17:27,923 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:17:27,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1787182656, now seen corresponding path program 2 times [2022-03-20 17:17:27,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:17:27,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852737349] [2022-03-20 17:17:27,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:17:27,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:17:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:27,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:17:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:27,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 17:17:27,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:17:27,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852737349] [2022-03-20 17:17:27,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852737349] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:27,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:27,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:27,947 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:17:27,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1409607133] [2022-03-20 17:17:27,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1409607133] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:27,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:27,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:27,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733720] [2022-03-20 17:17:27,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:17:27,948 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:17:27,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:27,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:17:27,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:17:27,949 INFO L87 Difference]: Start difference. First operand 1545 states and 2055 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:28,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:17:28,274 INFO L93 Difference]: Finished difference Result 2573 states and 3433 transitions. [2022-03-20 17:17:28,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:17:28,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-03-20 17:17:28,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:17:28,283 INFO L225 Difference]: With dead ends: 2573 [2022-03-20 17:17:28,283 INFO L226 Difference]: Without dead ends: 2571 [2022-03-20 17:17:28,284 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:17:28,285 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 92 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 17:17:28,285 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 60 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 17:17:28,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2022-03-20 17:17:28,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2313. [2022-03-20 17:17:28,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2313 states, 2309 states have (on average 1.2906019922044174) internal successors, (2980), 2309 states have internal predecessors, (2980), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:28,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 2983 transitions. [2022-03-20 17:17:28,523 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 2983 transitions. Word has length 25 [2022-03-20 17:17:28,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:17:28,523 INFO L478 AbstractCegarLoop]: Abstraction has 2313 states and 2983 transitions. [2022-03-20 17:17:28,523 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:28,523 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 2983 transitions. [2022-03-20 17:17:28,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-20 17:17:28,526 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:17:28,526 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:17:28,527 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-20 17:17:28,527 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:17:28,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:17:28,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1806720062, now seen corresponding path program 1 times [2022-03-20 17:17:28,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:28,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [832109312] [2022-03-20 17:17:28,528 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:17:28,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1806720062, now seen corresponding path program 2 times [2022-03-20 17:17:28,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:17:28,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481967434] [2022-03-20 17:17:28,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:17:28,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:17:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:28,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:17:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:28,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 17:17:28,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:17:28,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481967434] [2022-03-20 17:17:28,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481967434] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:28,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:28,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:28,550 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:17:28,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [832109312] [2022-03-20 17:17:28,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [832109312] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:28,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:28,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:28,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366963423] [2022-03-20 17:17:28,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:17:28,551 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:17:28,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:28,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:17:28,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:17:28,552 INFO L87 Difference]: Start difference. First operand 2313 states and 2983 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:28,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:17:28,897 INFO L93 Difference]: Finished difference Result 5197 states and 6633 transitions. [2022-03-20 17:17:28,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:17:28,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-03-20 17:17:28,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:17:28,908 INFO L225 Difference]: With dead ends: 5197 [2022-03-20 17:17:28,908 INFO L226 Difference]: Without dead ends: 2955 [2022-03-20 17:17:28,913 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:17:28,914 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 82 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 17:17:28,914 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 91 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 17:17:28,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2022-03-20 17:17:29,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2953. [2022-03-20 17:17:29,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2953 states, 2949 states have (on average 1.2383858935232281) internal successors, (3652), 2949 states have internal predecessors, (3652), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:29,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2953 states and 3655 transitions. [2022-03-20 17:17:29,212 INFO L78 Accepts]: Start accepts. Automaton has 2953 states and 3655 transitions. Word has length 25 [2022-03-20 17:17:29,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:17:29,212 INFO L478 AbstractCegarLoop]: Abstraction has 2953 states and 3655 transitions. [2022-03-20 17:17:29,213 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:29,213 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 3655 transitions. [2022-03-20 17:17:29,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-20 17:17:29,217 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:17:29,217 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:17:29,218 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-03-20 17:17:29,218 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:17:29,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:17:29,218 INFO L85 PathProgramCache]: Analyzing trace with hash -431696435, now seen corresponding path program 1 times [2022-03-20 17:17:29,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:29,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1499924002] [2022-03-20 17:17:29,219 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:17:29,219 INFO L85 PathProgramCache]: Analyzing trace with hash -431696435, now seen corresponding path program 2 times [2022-03-20 17:17:29,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:17:29,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337030346] [2022-03-20 17:17:29,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:17:29,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:17:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:29,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:17:29,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:29,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 17:17:29,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:17:29,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337030346] [2022-03-20 17:17:29,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337030346] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:29,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:29,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:29,245 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:17:29,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1499924002] [2022-03-20 17:17:29,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1499924002] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:29,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:29,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:29,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53206959] [2022-03-20 17:17:29,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:17:29,245 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:17:29,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:29,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:17:29,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:17:29,246 INFO L87 Difference]: Start difference. First operand 2953 states and 3655 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:29,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:17:29,600 INFO L93 Difference]: Finished difference Result 4429 states and 5449 transitions. [2022-03-20 17:17:29,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:17:29,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-03-20 17:17:29,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:17:29,611 INFO L225 Difference]: With dead ends: 4429 [2022-03-20 17:17:29,611 INFO L226 Difference]: Without dead ends: 3019 [2022-03-20 17:17:29,615 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:17:29,615 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 99 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 17:17:29,616 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 75 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 17:17:29,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3019 states. [2022-03-20 17:17:29,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3019 to 3017. [2022-03-20 17:17:29,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3017 states, 3013 states have (on average 1.2120809824095586) internal successors, (3652), 3013 states have internal predecessors, (3652), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:29,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3017 states to 3017 states and 3655 transitions. [2022-03-20 17:17:29,941 INFO L78 Accepts]: Start accepts. Automaton has 3017 states and 3655 transitions. Word has length 26 [2022-03-20 17:17:29,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:17:29,942 INFO L478 AbstractCegarLoop]: Abstraction has 3017 states and 3655 transitions. [2022-03-20 17:17:29,942 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:29,942 INFO L276 IsEmpty]: Start isEmpty. Operand 3017 states and 3655 transitions. [2022-03-20 17:17:29,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-20 17:17:29,946 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:17:29,946 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:17:29,946 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-03-20 17:17:29,947 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:17:29,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:17:29,947 INFO L85 PathProgramCache]: Analyzing trace with hash -173530997, now seen corresponding path program 1 times [2022-03-20 17:17:29,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:29,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [965295448] [2022-03-20 17:17:29,948 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:17:29,948 INFO L85 PathProgramCache]: Analyzing trace with hash -173530997, now seen corresponding path program 2 times [2022-03-20 17:17:29,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:17:29,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559487159] [2022-03-20 17:17:29,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:17:29,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:17:29,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:29,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:17:29,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:29,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 17:17:29,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:17:29,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559487159] [2022-03-20 17:17:29,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559487159] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:29,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:29,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:29,970 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:17:29,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [965295448] [2022-03-20 17:17:29,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [965295448] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:29,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:29,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:29,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395548640] [2022-03-20 17:17:29,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:17:29,971 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:17:29,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:29,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:17:29,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:17:29,972 INFO L87 Difference]: Start difference. First operand 3017 states and 3655 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:30,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:17:30,461 INFO L93 Difference]: Finished difference Result 4875 states and 5832 transitions. [2022-03-20 17:17:30,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:17:30,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-03-20 17:17:30,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:17:30,480 INFO L225 Difference]: With dead ends: 4875 [2022-03-20 17:17:30,480 INFO L226 Difference]: Without dead ends: 4873 [2022-03-20 17:17:30,482 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:17:30,483 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 84 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 17:17:30,483 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 58 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 17:17:30,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4873 states. [2022-03-20 17:17:30,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4873 to 4617. [2022-03-20 17:17:30,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4617 states, 4613 states have (on average 1.1801430739215262) internal successors, (5444), 4613 states have internal predecessors, (5444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:30,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4617 states to 4617 states and 5447 transitions. [2022-03-20 17:17:30,939 INFO L78 Accepts]: Start accepts. Automaton has 4617 states and 5447 transitions. Word has length 26 [2022-03-20 17:17:30,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:17:30,940 INFO L478 AbstractCegarLoop]: Abstraction has 4617 states and 5447 transitions. [2022-03-20 17:17:30,940 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:30,940 INFO L276 IsEmpty]: Start isEmpty. Operand 4617 states and 5447 transitions. [2022-03-20 17:17:30,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-20 17:17:30,946 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 17:17:30,947 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 17:17:30,947 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-03-20 17:17:30,947 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 17:17:30,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 17:17:30,947 INFO L85 PathProgramCache]: Analyzing trace with hash 527533581, now seen corresponding path program 1 times [2022-03-20 17:17:30,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:30,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1626567850] [2022-03-20 17:17:30,948 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 17:17:30,948 INFO L85 PathProgramCache]: Analyzing trace with hash 527533581, now seen corresponding path program 2 times [2022-03-20 17:17:30,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 17:17:30,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954606098] [2022-03-20 17:17:30,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 17:17:30,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 17:17:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:30,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 17:17:30,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 17:17:30,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 17:17:30,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 17:17:30,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954606098] [2022-03-20 17:17:30,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954606098] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:30,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:30,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:30,981 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 17:17:30,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1626567850] [2022-03-20 17:17:30,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1626567850] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 17:17:30,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 17:17:30,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 17:17:30,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814402922] [2022-03-20 17:17:30,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 17:17:30,982 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 17:17:30,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 17:17:30,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 17:17:30,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 17:17:30,983 INFO L87 Difference]: Start difference. First operand 4617 states and 5447 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:31,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 17:17:31,515 INFO L93 Difference]: Finished difference Result 10249 states and 11847 transitions. [2022-03-20 17:17:31,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 17:17:31,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-03-20 17:17:31,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 17:17:31,516 INFO L225 Difference]: With dead ends: 10249 [2022-03-20 17:17:31,516 INFO L226 Difference]: Without dead ends: 0 [2022-03-20 17:17:31,538 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 17:17:31,539 INFO L913 BasicCegarLoop]: 85 mSDtfsCounter, 73 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 17:17:31,539 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 92 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 17:17:31,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-20 17:17:31,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-20 17:17:31,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-20 17:17:31,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-20 17:17:31,540 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2022-03-20 17:17:31,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 17:17:31,540 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-20 17:17:31,541 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 17:17:31,541 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-20 17:17:31,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-20 17:17:31,543 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-20 17:17:31,544 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-03-20 17:17:31,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-03-20 17:17:41,694 WARN L232 SmtUtils]: Spent 5.69s on a formula simplification that was a NOOP. DAG size: 684 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-03-20 17:17:48,986 WARN L232 SmtUtils]: Spent 7.29s on a formula simplification that was a NOOP. DAG size: 1069 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-03-20 17:18:03,054 WARN L232 SmtUtils]: Spent 7.21s on a formula simplification that was a NOOP. DAG size: 1069 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-03-20 17:18:49,687 WARN L232 SmtUtils]: Spent 9.51s on a formula simplification. DAG size of input: 297 DAG size of output: 291 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-03-20 17:19:17,275 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-03-20 17:19:17,275 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-03-20 17:19:17,275 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-03-20 17:19:17,276 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-03-20 17:19:17,276 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-03-20 17:19:17,276 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-03-20 17:19:17,276 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-03-20 17:19:17,276 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-03-20 17:19:17,276 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-03-20 17:19:17,276 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-03-20 17:19:17,277 INFO L878 garLoopResultBuilder]: At program point L93(line 93) the Hoare annotation is: (let ((.cse3 (= main_~lk8~0 1)) (.cse4 (= main_~lk4~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse14 (= main_~lk3~0 1)) (.cse5 (= main_~p5~0 0)) (.cse6 (= main_~p2~0 0)) (.cse7 (= main_~p6~0 0)) (.cse13 (= main_~p4~0 0)) (.cse9 (= main_~lk5~0 1)) (.cse1 (not (= main_~p1~0 0))) (.cse2 (= main_~lk1~0 1)) (.cse10 (= main_~p8~0 0)) (.cse11 (= main_~p7~0 0)) (.cse15 (= main_~lk6~0 1)) (.cse8 (= main_~p3~0 0)) (.cse12 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse6 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse7 .cse8 .cse12) (and .cse13 .cse1 .cse2 .cse10 .cse11 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse3 .cse7 .cse8 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse14 .cse5 .cse15 .cse12) (and .cse13 .cse9 .cse1 .cse2 .cse3 .cse11 .cse6 .cse7 .cse8) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse3 .cse14 .cse6 .cse15) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse14 .cse6 .cse15) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse3 .cse6 .cse15 .cse8) (and .cse1 .cse2 .cse10 .cse4 .cse14 .cse11 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse10 .cse4 .cse11 .cse5 .cse15 .cse8 .cse12) (and .cse13 .cse9 .cse1 .cse2 .cse3 .cse14 .cse11 .cse6 .cse7) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse10 .cse7 .cse8 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse14 .cse11 .cse5 .cse6 .cse15) (and .cse13 .cse1 .cse2 .cse3 .cse14 .cse11 .cse5 .cse15 .cse12) (and .cse13 .cse9 .cse1 .cse2 .cse10 .cse11 .cse7 .cse8 .cse12) (and .cse13 .cse9 .cse1 .cse2 .cse10 .cse11 .cse6 .cse15 .cse8) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse3 .cse14 .cse7 .cse12) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse10 .cse6 .cse15 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse14 .cse11 .cse5 .cse15 .cse12) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse5 .cse15 .cse8 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse10 .cse14 .cse5 .cse15 .cse12) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse10 .cse14 .cse6 .cse15) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse14 .cse11 .cse6 .cse7) (and .cse1 .cse2 .cse10 .cse4 .cse14 .cse11 .cse5 .cse7 .cse12) (and .cse13 .cse1 .cse2 .cse10 .cse14 .cse11 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse14 .cse5 .cse6 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse15 .cse8 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse15 .cse8) (and .cse13 .cse1 .cse2 .cse3 .cse11 .cse5 .cse6 .cse15 .cse8) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse10 .cse14 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse15 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse14 .cse11 .cse5 .cse7 .cse12) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse14 .cse15 .cse12) (and .cse1 .cse2 .cse10 .cse4 .cse11 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse15) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse10 .cse6 .cse7 .cse8) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse5 .cse7 .cse8 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse7 .cse12) (and .cse13 .cse1 .cse2 .cse10 .cse14 .cse11 .cse5 .cse7 .cse12) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse14 .cse7 .cse12) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse14 .cse5 .cse15 .cse12) (and .cse13 .cse9 .cse1 .cse2 .cse3 .cse11 .cse7 .cse8 .cse12) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse7 .cse8 .cse12) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse14 .cse11 .cse6 .cse15) (and .cse0 .cse13 .cse1 .cse2 .cse10 .cse5 .cse7 .cse8 .cse12) (and .cse13 .cse1 .cse2 .cse10 .cse11 .cse5 .cse6 .cse15 .cse8) (and .cse13 .cse9 .cse1 .cse2 .cse3 .cse11 .cse6 .cse15 .cse8) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse14 .cse6 .cse7) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6 .cse15 .cse8) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse14 .cse11 .cse15 .cse12) (and .cse13 .cse1 .cse2 .cse3 .cse11 .cse5 .cse7 .cse8 .cse12) (and .cse1 .cse2 .cse10 .cse4 .cse14 .cse11 .cse5 .cse6 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8) (and .cse13 .cse9 .cse1 .cse2 .cse3 .cse11 .cse15 .cse8 .cse12) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse5 .cse7 .cse8 .cse12) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse14 .cse11 .cse15 .cse12) (and .cse1 .cse2 .cse10 .cse4 .cse11 .cse5 .cse6 .cse15 .cse8) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse14 .cse5 .cse7 .cse12) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse14 .cse11 .cse7 .cse12) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse11 .cse7 .cse8 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse15 .cse12) (and .cse13 .cse1 .cse2 .cse10 .cse11 .cse5 .cse7 .cse8 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse14 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse10 .cse15 .cse8 .cse12) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse12) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse11 .cse6 .cse7 .cse8) (and .cse13 .cse1 .cse2 .cse10 .cse14 .cse11 .cse5 .cse6 .cse15) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse14 .cse15 .cse12) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse14 .cse11 .cse6 .cse7) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse11 .cse15 .cse8 .cse12) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse14 .cse6 .cse7) (and .cse13 .cse9 .cse1 .cse2 .cse3 .cse14 .cse11 .cse15 .cse12) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse14 .cse11 .cse6 .cse15) (and .cse13 .cse9 .cse1 .cse2 .cse10 .cse14 .cse11 .cse6 .cse15) (and .cse13 .cse1 .cse2 .cse10 .cse11 .cse5 .cse15 .cse8 .cse12) (and .cse13 .cse9 .cse1 .cse2 .cse10 .cse11 .cse6 .cse7 .cse8) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse11 .cse7 .cse8 .cse12) (and .cse13 .cse1 .cse2 .cse10 .cse14 .cse11 .cse5 .cse15 .cse12) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse11 .cse6 .cse15 .cse8) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse5 .cse6 .cse15 .cse8) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse14 .cse7 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse5 .cse15 .cse8 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse10 .cse5 .cse6 .cse15 .cse8) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse10 .cse14 .cse15 .cse12) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse14 .cse6 .cse15) (and .cse13 .cse9 .cse1 .cse2 .cse10 .cse14 .cse11 .cse7 .cse12) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse3 .cse15 .cse8 .cse12) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse14 .cse5 .cse6 .cse7) (and .cse13 .cse1 .cse2 .cse3 .cse14 .cse11 .cse5 .cse7 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse10 .cse14 .cse5 .cse7 .cse12) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse11 .cse6 .cse7 .cse8) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse3 .cse14 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse11 .cse15 .cse8 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse5 .cse6 .cse15 .cse8) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse6 .cse15 .cse8) (and .cse0 .cse13 .cse1 .cse2 .cse10 .cse14 .cse5 .cse6 .cse15) (and .cse13 .cse1 .cse2 .cse3 .cse14 .cse11 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse12) (and .cse13 .cse1 .cse2 .cse3 .cse11 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse14 .cse11 .cse7 .cse12) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse10 .cse14 .cse7 .cse12) (and .cse13 .cse9 .cse1 .cse2 .cse10 .cse14 .cse11 .cse6 .cse7) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse15 .cse8 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse10 .cse5 .cse15 .cse8 .cse12) (and .cse13 .cse9 .cse1 .cse2 .cse3 .cse14 .cse11 .cse6 .cse15) (and .cse13 .cse9 .cse1 .cse2 .cse10 .cse14 .cse11 .cse15 .cse12) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse11 .cse6 .cse15 .cse8) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse14 .cse5 .cse6 .cse15) (and .cse13 .cse1 .cse2 .cse3 .cse14 .cse11 .cse5 .cse6 .cse15) (and .cse1 .cse2 .cse10 .cse4 .cse14 .cse11 .cse5 .cse15 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse10 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse14 .cse5 .cse7 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse14 .cse11 .cse5 .cse6 .cse7) (and .cse13 .cse9 .cse1 .cse2 .cse3 .cse14 .cse11 .cse7 .cse12) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse15 .cse8 .cse12) (and .cse13 .cse1 .cse2 .cse3 .cse11 .cse5 .cse15 .cse8 .cse12) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse3 .cse14 .cse15 .cse12) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse2 .cse10 .cse4 .cse11 .cse5 .cse7 .cse8 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse10 .cse14 .cse5 .cse6 .cse7) (and .cse13 .cse9 .cse1 .cse2 .cse10 .cse11 .cse15 .cse8 .cse12))) [2022-03-20 17:19:17,277 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 6 137) the Hoare annotation is: true [2022-03-20 17:19:17,277 INFO L878 garLoopResultBuilder]: At program point L118(line 118) the Hoare annotation is: (let ((.cse0 (= main_~lk7~0 1)) (.cse1 (= main_~p8~0 0)) (.cse4 (= main_~lk8~0 1)) (.cse5 (= main_~p7~0 0)) (.cse2 (= main_~lk6~0 1)) (.cse3 (not (= main_~p6~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2 .cse3) (and .cse1 .cse5 .cse2 .cse3) (and .cse4 .cse5 .cse2 .cse3))) [2022-03-20 17:19:17,277 INFO L878 garLoopResultBuilder]: At program point L102-1(lines 35 132) the Hoare annotation is: (let ((.cse1 (= main_~lk8~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse3 (= main_~p7~0 0)) (.cse9 (= main_~p5~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse5 (= main_~lk7~0 1)) (.cse8 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse6 (= main_~p8~0 0)) (.cse7 (= main_~p6~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse6 .cse2 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse7) (and .cse5 .cse8 .cse0 .cse6 .cse4) (and .cse5 .cse0 .cse1 .cse2 .cse4) (and .cse5 .cse8 .cse6 .cse9 .cse7) (and .cse5 .cse0 .cse6 .cse2 .cse7) (and .cse5 .cse6 .cse2 .cse9 .cse4) (and .cse8 .cse1 .cse3 .cse9 .cse7) (and .cse5 .cse8 .cse1 .cse9 .cse4) (and .cse5 .cse8 .cse1 .cse9 .cse7) (and .cse1 .cse2 .cse3 .cse9 .cse7) (and .cse5 .cse0 .cse1 .cse2 .cse7) (and .cse8 .cse0 .cse1 .cse3 .cse4) (and .cse8 .cse1 .cse3 .cse9 .cse4) (and .cse5 .cse8 .cse6 .cse9 .cse4) (and .cse5 .cse1 .cse2 .cse9 .cse7) (and .cse8 .cse0 .cse6 .cse3 .cse7) (and .cse5 .cse6 .cse2 .cse9 .cse7) (and .cse8 .cse6 .cse3 .cse9 .cse4) (and .cse0 .cse6 .cse2 .cse3 .cse7) (and .cse5 .cse1 .cse2 .cse9 .cse4) (and .cse5 .cse8 .cse0 .cse1 .cse4) (and .cse5 .cse8 .cse0 .cse1 .cse7) (and .cse8 .cse0 .cse6 .cse3 .cse4) (and .cse8 .cse6 .cse3 .cse9 .cse7) (and .cse6 .cse2 .cse3 .cse9 .cse7) (and .cse0 .cse6 .cse2 .cse3 .cse4) (and .cse8 .cse0 .cse1 .cse3 .cse7) (and .cse6 .cse2 .cse3 .cse9 .cse4) (and .cse1 .cse2 .cse3 .cse9 .cse4) (and .cse5 .cse8 .cse0 .cse6 .cse7))) [2022-03-20 17:19:17,277 INFO L885 garLoopResultBuilder]: At program point L127-1(lines 35 132) the Hoare annotation is: true [2022-03-20 17:19:17,278 INFO L878 garLoopResultBuilder]: At program point L86-1(lines 35 132) the Hoare annotation is: (let ((.cse3 (= main_~lk3~0 1)) (.cse1 (= main_~lk5~0 1)) (.cse4 (= main_~p1~0 0)) (.cse6 (= main_~p2~0 0)) (.cse8 (= main_~lk7~0 1)) (.cse13 (= main_~p8~0 0)) (.cse14 (= main_~lk4~0 1)) (.cse7 (= main_~lk6~0 1)) (.cse0 (= main_~p4~0 0)) (.cse12 (= main_~lk1~0 1)) (.cse2 (= main_~lk8~0 1)) (.cse5 (= main_~p7~0 0)) (.cse9 (= main_~p5~0 0)) (.cse10 (= main_~p6~0 0)) (.cse15 (= main_~p3~0 0)) (.cse11 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse2 .cse3 .cse4 .cse9 .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse9 .cse7 .cse11) (and .cse8 .cse0 .cse12 .cse13 .cse3 .cse9 .cse7 .cse11) (and .cse8 .cse1 .cse2 .cse14 .cse3 .cse4 .cse10 .cse11) (and .cse8 .cse2 .cse14 .cse4 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse3 .cse10 .cse11) (and .cse0 .cse13 .cse4 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse1 .cse2 .cse14 .cse4 .cse6 .cse7 .cse15) (and .cse0 .cse2 .cse4 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse12 .cse2 .cse14 .cse3 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse12 .cse2 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse7 .cse15 .cse11) (and .cse0 .cse12 .cse13 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse0 .cse1 .cse12 .cse13 .cse3 .cse5 .cse7 .cse11) (and .cse8 .cse2 .cse14 .cse3 .cse4 .cse9 .cse10 .cse11) (and .cse2 .cse14 .cse3 .cse4 .cse5 .cse9 .cse7 .cse11) (and .cse0 .cse2 .cse4 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse12 .cse13 .cse14 .cse3 .cse9 .cse6 .cse7) (and .cse0 .cse13 .cse3 .cse4 .cse5 .cse9 .cse6 .cse10) (and .cse1 .cse13 .cse14 .cse4 .cse5 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse2 .cse4 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse12 .cse2 .cse14 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse12 .cse13 .cse3 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse12 .cse13 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse2 .cse3 .cse4 .cse9 .cse6 .cse10) (and .cse2 .cse14 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse1 .cse12 .cse2 .cse14 .cse3 .cse5 .cse7 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse12 .cse13 .cse3 .cse9 .cse6 .cse10) (and .cse0 .cse1 .cse13 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse0 .cse12 .cse13 .cse3 .cse5 .cse9 .cse10 .cse11) (and .cse8 .cse12 .cse2 .cse14 .cse3 .cse9 .cse6 .cse10) (and .cse8 .cse13 .cse14 .cse3 .cse4 .cse9 .cse10 .cse11) (and .cse8 .cse0 .cse13 .cse3 .cse4 .cse9 .cse6 .cse10) (and .cse8 .cse12 .cse13 .cse14 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse13 .cse3 .cse4 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse3 .cse10 .cse11) (and .cse8 .cse0 .cse13 .cse3 .cse4 .cse9 .cse10 .cse11) (and .cse8 .cse2 .cse14 .cse4 .cse9 .cse6 .cse10 .cse15) (and .cse0 .cse1 .cse13 .cse4 .cse5 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse6 .cse10 .cse15) (and .cse0 .cse1 .cse12 .cse2 .cse5 .cse10 .cse15 .cse11) (and .cse0 .cse1 .cse12 .cse13 .cse5 .cse6 .cse10 .cse15) (and .cse8 .cse12 .cse13 .cse14 .cse3 .cse9 .cse10 .cse11) (and .cse13 .cse14 .cse4 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10 .cse15 .cse11) (and .cse0 .cse1 .cse13 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse13 .cse4 .cse5 .cse10 .cse15 .cse11) (and .cse1 .cse13 .cse14 .cse3 .cse4 .cse5 .cse7 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse3 .cse7 .cse11) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse10 .cse15 .cse11) (and .cse1 .cse2 .cse14 .cse4 .cse5 .cse6 .cse7 .cse15) (and .cse8 .cse13 .cse14 .cse3 .cse4 .cse9 .cse6 .cse10) (and .cse8 .cse0 .cse2 .cse4 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse1 .cse13 .cse14 .cse3 .cse4 .cse6 .cse10) (and .cse8 .cse0 .cse12 .cse2 .cse3 .cse9 .cse6 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse15 .cse11) (and .cse0 .cse2 .cse4 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse13 .cse3 .cse4 .cse6 .cse10) (and .cse8 .cse2 .cse14 .cse4 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse13 .cse4 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse2 .cse14 .cse3 .cse4 .cse9 .cse7 .cse11) (and .cse1 .cse2 .cse14 .cse4 .cse5 .cse10 .cse15 .cse11) (and .cse8 .cse2 .cse14 .cse3 .cse4 .cse9 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse3 .cse5 .cse9 .cse7 .cse11) (and .cse13 .cse14 .cse3 .cse4 .cse5 .cse9 .cse7 .cse11) (and .cse0 .cse12 .cse13 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse9 .cse6 .cse10) (and .cse1 .cse13 .cse14 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse0 .cse12 .cse2 .cse3 .cse5 .cse9 .cse10 .cse11) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse1 .cse13 .cse14 .cse3 .cse4 .cse5 .cse10 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse7 .cse15 .cse11) (and .cse0 .cse1 .cse12 .cse13 .cse5 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse3 .cse7 .cse11) (and .cse1 .cse2 .cse14 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse7 .cse11) (and .cse8 .cse0 .cse12 .cse2 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse15) (and .cse0 .cse12 .cse13 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse12 .cse13 .cse14 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse0 .cse1 .cse13 .cse4 .cse5 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse7 .cse15 .cse11) (and .cse12 .cse2 .cse14 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse12 .cse13 .cse9 .cse10 .cse15 .cse11) (and .cse1 .cse12 .cse13 .cse14 .cse3 .cse5 .cse7 .cse11) (and .cse1 .cse12 .cse13 .cse14 .cse5 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse12 .cse13 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse2 .cse3 .cse4 .cse9 .cse7 .cse11) (and .cse1 .cse2 .cse14 .cse4 .cse5 .cse6 .cse10 .cse15) (and .cse0 .cse1 .cse13 .cse3 .cse4 .cse5 .cse7 .cse11) (and .cse12 .cse13 .cse14 .cse3 .cse5 .cse9 .cse7 .cse11) (and .cse8 .cse1 .cse13 .cse14 .cse3 .cse4 .cse10 .cse11) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse13 .cse4 .cse9 .cse10 .cse15 .cse11) (and .cse0 .cse12 .cse13 .cse3 .cse5 .cse9 .cse7 .cse11) (and .cse8 .cse0 .cse13 .cse3 .cse4 .cse9 .cse7 .cse11) (and .cse8 .cse1 .cse13 .cse14 .cse4 .cse10 .cse15 .cse11) (and .cse12 .cse13 .cse14 .cse3 .cse5 .cse9 .cse6 .cse10) (and .cse8 .cse2 .cse14 .cse4 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse3 .cse10 .cse11) (and .cse0 .cse12 .cse13 .cse3 .cse5 .cse9 .cse6 .cse7) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse3 .cse6 .cse10) (and .cse8 .cse13 .cse14 .cse4 .cse9 .cse7 .cse15 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse11) (and .cse0 .cse12 .cse2 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse12 .cse13 .cse14 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse9 .cse10 .cse11) (and .cse2 .cse14 .cse4 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse1 .cse13 .cse14 .cse4 .cse5 .cse7 .cse15 .cse11) (and .cse1 .cse2 .cse14 .cse4 .cse5 .cse7 .cse15 .cse11) (and .cse12 .cse13 .cse14 .cse3 .cse5 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse10 .cse11) (and .cse2 .cse14 .cse4 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse3 .cse6 .cse10) (and .cse0 .cse1 .cse12 .cse2 .cse5 .cse6 .cse10 .cse15) (and .cse13 .cse14 .cse4 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse12 .cse2 .cse14 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse12 .cse13 .cse3 .cse9 .cse10 .cse11) (and .cse12 .cse2 .cse14 .cse3 .cse5 .cse9 .cse10 .cse11) (and .cse8 .cse0 .cse13 .cse4 .cse9 .cse6 .cse7 .cse15) (and .cse0 .cse1 .cse12 .cse13 .cse3 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse3 .cse6 .cse10) (and .cse8 .cse0 .cse1 .cse13 .cse4 .cse10 .cse15 .cse11) (and .cse8 .cse12 .cse2 .cse14 .cse3 .cse9 .cse7 .cse11) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse7 .cse15 .cse11) (and .cse8 .cse12 .cse13 .cse14 .cse9 .cse6 .cse7 .cse15) (and .cse0 .cse13 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse13 .cse4 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse3 .cse6 .cse7) (and .cse1 .cse12 .cse2 .cse14 .cse5 .cse6 .cse7 .cse15) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse2 .cse14 .cse4 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse10) (and .cse1 .cse12 .cse2 .cse14 .cse5 .cse6 .cse10 .cse15) (and .cse8 .cse1 .cse13 .cse14 .cse4 .cse6 .cse10 .cse15) (and .cse8 .cse2 .cse14 .cse3 .cse4 .cse9 .cse6 .cse10) (and .cse12 .cse13 .cse14 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse0 .cse1 .cse12 .cse13 .cse3 .cse5 .cse10 .cse11) (and .cse0 .cse13 .cse3 .cse4 .cse5 .cse9 .cse10 .cse11) (and .cse0 .cse2 .cse4 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse10 .cse11) (and .cse12 .cse2 .cse14 .cse3 .cse5 .cse9 .cse6 .cse10) (and .cse8 .cse0 .cse1 .cse13 .cse3 .cse4 .cse10 .cse11) (and .cse0 .cse13 .cse3 .cse4 .cse5 .cse9 .cse7 .cse11) (and .cse8 .cse12 .cse13 .cse14 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse12 .cse2 .cse3 .cse9 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse14 .cse3 .cse4 .cse6 .cse7) (and .cse1 .cse13 .cse14 .cse4 .cse5 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse13 .cse4 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse12 .cse2 .cse14 .cse9 .cse6 .cse7 .cse15) (and .cse0 .cse12 .cse13 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse13 .cse14 .cse4 .cse9 .cse10 .cse15 .cse11) (and .cse13 .cse14 .cse3 .cse4 .cse5 .cse9 .cse10 .cse11) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse3 .cse7 .cse11) (and .cse0 .cse12 .cse2 .cse3 .cse5 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse13 .cse3 .cse4 .cse7 .cse11) (and .cse1 .cse12 .cse13 .cse14 .cse5 .cse6 .cse7 .cse15) (and .cse2 .cse14 .cse4 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse1 .cse12 .cse13 .cse14 .cse5 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse12 .cse2 .cse3 .cse9 .cse7 .cse11) (and .cse8 .cse1 .cse2 .cse14 .cse4 .cse10 .cse15 .cse11) (and .cse0 .cse1 .cse12 .cse13 .cse3 .cse5 .cse6 .cse10) (and .cse0 .cse13 .cse4 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse12 .cse2 .cse14 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse13 .cse14 .cse3 .cse4 .cse9 .cse7 .cse11) (and .cse8 .cse1 .cse13 .cse14 .cse3 .cse4 .cse7 .cse11) (and .cse8 .cse0 .cse12 .cse13 .cse9 .cse6 .cse7 .cse15) (and .cse13 .cse14 .cse3 .cse4 .cse5 .cse9 .cse6 .cse10) (and .cse0 .cse13 .cse4 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse3 .cse6 .cse10) (and .cse1 .cse12 .cse13 .cse14 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse12 .cse13 .cse5 .cse6 .cse7 .cse15) (and .cse2 .cse14 .cse3 .cse4 .cse5 .cse9 .cse10 .cse11) (and .cse8 .cse1 .cse13 .cse14 .cse4 .cse7 .cse15 .cse11) (and .cse8 .cse12 .cse13 .cse14 .cse3 .cse9 .cse6 .cse10) (and .cse1 .cse2 .cse14 .cse3 .cse4 .cse5 .cse7 .cse11) (and .cse12 .cse2 .cse14 .cse3 .cse5 .cse9 .cse6 .cse7) (and .cse1 .cse12 .cse13 .cse14 .cse3 .cse5 .cse6 .cse10) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse6 .cse10) (and .cse8 .cse0 .cse2 .cse4 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse2 .cse3 .cse4 .cse9 .cse6 .cse7) (and .cse1 .cse2 .cse14 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse8 .cse13 .cse14 .cse4 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse10 .cse15 .cse11) (and .cse8 .cse1 .cse2 .cse14 .cse3 .cse4 .cse6 .cse10) (and .cse0 .cse1 .cse12 .cse2 .cse5 .cse6 .cse7 .cse15) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse3 .cse10 .cse11) (and .cse8 .cse0 .cse1 .cse13 .cse4 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse12 .cse2 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse1 .cse2 .cse14 .cse4 .cse7 .cse15 .cse11) (and .cse8 .cse13 .cse14 .cse3 .cse4 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse12 .cse2 .cse3 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse5 .cse7 .cse15 .cse11) (and .cse12 .cse13 .cse14 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse3 .cse7 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse6 .cse7) (and .cse8 .cse12 .cse2 .cse14 .cse9 .cse6 .cse10 .cse15) (and .cse1 .cse13 .cse14 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse13 .cse3 .cse4 .cse5 .cse10 .cse11) (and .cse13 .cse14 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse13 .cse3 .cse4 .cse6 .cse7) (and .cse1 .cse12 .cse2 .cse14 .cse5 .cse7 .cse15 .cse11) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse3 .cse6 .cse7) (and .cse12 .cse2 .cse14 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse6 .cse10 .cse15) (and .cse8 .cse1 .cse13 .cse14 .cse3 .cse4 .cse6 .cse7) (and .cse13 .cse14 .cse4 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse1 .cse2 .cse14 .cse3 .cse4 .cse5 .cse10 .cse11) (and .cse0 .cse1 .cse12 .cse13 .cse5 .cse10 .cse15 .cse11) (and .cse0 .cse1 .cse13 .cse4 .cse5 .cse7 .cse15 .cse11) (and .cse8 .cse12 .cse2 .cse14 .cse3 .cse9 .cse10 .cse11) (and .cse8 .cse12 .cse13 .cse14 .cse3 .cse9 .cse7 .cse11) (and .cse0 .cse12 .cse13 .cse3 .cse5 .cse9 .cse6 .cse10) (and .cse13 .cse14 .cse4 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse2 .cse14 .cse3 .cse4 .cse5 .cse9 .cse6 .cse10) (and .cse12 .cse13 .cse14 .cse3 .cse5 .cse9 .cse10 .cse11) (and .cse1 .cse13 .cse14 .cse4 .cse5 .cse6 .cse7 .cse15) (and .cse1 .cse12 .cse2 .cse14 .cse3 .cse5 .cse10 .cse11) (and .cse1 .cse12 .cse13 .cse14 .cse3 .cse5 .cse10 .cse11) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse6 .cse10 .cse15) (and .cse1 .cse12 .cse2 .cse14 .cse3 .cse5 .cse6 .cse10) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse3 .cse6 .cse7) (and .cse1 .cse12 .cse2 .cse14 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse4 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse1 .cse2 .cse14 .cse4 .cse6 .cse10 .cse15) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse7 .cse15 .cse11) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse10 .cse15) (and .cse8 .cse12 .cse2 .cse14 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse3 .cse6 .cse7) (and .cse12 .cse2 .cse14 .cse3 .cse5 .cse9 .cse7 .cse11) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse6 .cse10 .cse15) (and .cse0 .cse12 .cse2 .cse3 .cse5 .cse9 .cse6 .cse10) (and .cse8 .cse13 .cse14 .cse4 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse2 .cse4 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse13 .cse4 .cse6 .cse10 .cse15) (and .cse1 .cse12 .cse2 .cse14 .cse5 .cse10 .cse15 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse11) (and .cse8 .cse0 .cse12 .cse2 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse1 .cse2 .cse14 .cse3 .cse4 .cse7 .cse11) (and .cse8 .cse1 .cse13 .cse14 .cse4 .cse6 .cse7 .cse15) (and .cse0 .cse12 .cse2 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse11) (and .cse0 .cse12 .cse2 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse1 .cse12 .cse13 .cse14 .cse5 .cse6 .cse10 .cse15) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse15) (and .cse8 .cse12 .cse13 .cse14 .cse9 .cse7 .cse15 .cse11) (and .cse0 .cse12 .cse2 .cse5 .cse9 .cse10 .cse15 .cse11))) [2022-03-20 17:19:17,279 INFO L878 garLoopResultBuilder]: At program point L78-1(lines 35 132) the Hoare annotation is: (let ((.cse3 (= main_~p2~0 0)) (.cse7 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse9 (= main_~p1~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse8 (= main_~lk3~0 1)) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse11 (= main_~p5~0 0)) (.cse6 (= main_~p6~0 0)) (.cse5 (= main_~p3~0 0)) (.cse10 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse6 .cse10) (and .cse7 .cse8 .cse9 .cse11 .cse3 .cse4) (and .cse7 .cse1 .cse8 .cse11 .cse6 .cse10) (and .cse0 .cse2 .cse9 .cse4 .cse5 .cse10) (and .cse7 .cse1 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse9 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse9 .cse6 .cse5 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse6 .cse10) (and .cse7 .cse1 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse4 .cse5 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse8 .cse4 .cse10) (and .cse7 .cse0 .cse8 .cse9 .cse3 .cse6) (and .cse0 .cse2 .cse8 .cse9 .cse4 .cse10) (and .cse7 .cse9 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse3 .cse4) (and .cse7 .cse8 .cse9 .cse11 .cse6 .cse10) (and .cse2 .cse9 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse4 .cse10) (and .cse7 .cse1 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse4 .cse10) (and .cse1 .cse2 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse9 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse8 .cse9 .cse11 .cse4 .cse10) (and .cse7 .cse1 .cse8 .cse11 .cse3 .cse6) (and .cse0 .cse2 .cse9 .cse6 .cse5 .cse10) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse9 .cse3 .cse6 .cse5) (and .cse0 .cse2 .cse9 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse8 .cse11 .cse3 .cse4) (and .cse0 .cse2 .cse8 .cse9 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse8 .cse6 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse4) (and .cse7 .cse9 .cse11 .cse6 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse6 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse6) (and .cse7 .cse0 .cse9 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse6) (and .cse0 .cse2 .cse8 .cse9 .cse6 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse3 .cse6) (and .cse7 .cse0 .cse1 .cse8 .cse6 .cse10) (and .cse2 .cse9 .cse11 .cse6 .cse5 .cse10) (and .cse7 .cse1 .cse11 .cse6 .cse5 .cse10) (and .cse2 .cse9 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse9 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse8 .cse9 .cse11 .cse3 .cse6) (and .cse2 .cse8 .cse9 .cse11 .cse3 .cse4) (and .cse7 .cse1 .cse8 .cse11 .cse4 .cse10) (and .cse0 .cse1 .cse2 .cse6 .cse5 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse4 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse4 .cse10) (and .cse1 .cse2 .cse11 .cse3 .cse6 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse4) (and .cse2 .cse9 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse1 .cse8 .cse11 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10) (and .cse0 .cse2 .cse8 .cse9 .cse3 .cse4) (and .cse7 .cse0 .cse9 .cse4 .cse5 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse6 .cse10) (and .cse1 .cse2 .cse11 .cse6 .cse5 .cse10))) [2022-03-20 17:19:17,279 INFO L878 garLoopResultBuilder]: At program point L103(line 103) the Hoare annotation is: (let ((.cse2 (= main_~lk5~0 1)) (.cse6 (= main_~lk6~0 1)) (.cse7 (= main_~p4~0 0)) (.cse3 (= main_~lk8~0 1)) (.cse11 (= main_~p7~0 0)) (.cse0 (not (= main_~p3~0 0))) (.cse1 (= main_~lk7~0 1)) (.cse10 (= main_~p8~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~lk3~0 1)) (.cse8 (= main_~p5~0 0)) (.cse9 (= main_~p6~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse3 .cse5 .cse8 .cse9) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse8 .cse9) (and .cse0 .cse10 .cse4 .cse5 .cse11 .cse8 .cse9) (and .cse0 .cse1 .cse10 .cse4 .cse5 .cse8 .cse6) (and .cse0 .cse7 .cse3 .cse5 .cse11 .cse8 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse11 .cse9) (and .cse0 .cse7 .cse2 .cse3 .cse5 .cse11 .cse6) (and .cse0 .cse2 .cse10 .cse4 .cse5 .cse11 .cse9) (and .cse0 .cse7 .cse10 .cse5 .cse11 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse5 .cse9) (and .cse0 .cse1 .cse7 .cse2 .cse10 .cse5 .cse9) (and .cse0 .cse3 .cse4 .cse5 .cse11 .cse8 .cse9) (and .cse0 .cse7 .cse2 .cse3 .cse5 .cse11 .cse9) (and .cse0 .cse2 .cse10 .cse4 .cse5 .cse11 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse11 .cse6) (and .cse0 .cse10 .cse4 .cse5 .cse11 .cse8 .cse6) (and .cse0 .cse3 .cse4 .cse5 .cse11 .cse8 .cse6) (and .cse0 .cse1 .cse7 .cse10 .cse5 .cse8 .cse9) (and .cse0 .cse1 .cse7 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse7 .cse2 .cse10 .cse5 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse9) (and .cse0 .cse1 .cse7 .cse10 .cse5 .cse8 .cse6) (and .cse0 .cse7 .cse2 .cse10 .cse5 .cse11 .cse9) (and .cse0 .cse1 .cse7 .cse2 .cse3 .cse5 .cse9) (and .cse0 .cse7 .cse10 .cse5 .cse11 .cse8 .cse6) (and .cse0 .cse1 .cse7 .cse2 .cse10 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse3 .cse5 .cse8 .cse6) (and .cse0 .cse7 .cse3 .cse5 .cse11 .cse8 .cse9) (and .cse0 .cse1 .cse10 .cse4 .cse5 .cse8 .cse9))) [2022-03-20 17:19:17,279 INFO L885 garLoopResultBuilder]: At program point L37(lines 37 39) the Hoare annotation is: true [2022-03-20 17:19:17,279 INFO L878 garLoopResultBuilder]: At program point L70-1(lines 35 132) the Hoare annotation is: (let ((.cse5 (= main_~lk1~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse3 (= main_~p2~0 0)) (.cse4 (= main_~p4~0 0)) (.cse2 (= main_~p1~0 0)) (.cse6 (= main_~p3~0 0)) (.cse7 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse3) (and .cse5 .cse0 .cse6 .cse7) (and .cse4 .cse2 .cse3 .cse6) (and .cse4 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse5 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse6 .cse7) (and .cse5 .cse0 .cse1 .cse7) (and .cse4 .cse1 .cse2 .cse7) (and .cse0 .cse1 .cse2 .cse7) (and .cse4 .cse5 .cse3 .cse6) (and .cse0 .cse2 .cse6 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse0 .cse1 .cse3) (and .cse4 .cse2 .cse6 .cse7))) [2022-03-20 17:19:17,279 INFO L878 garLoopResultBuilder]: At program point L128(line 128) the Hoare annotation is: (= main_~lk8~0 1) [2022-03-20 17:19:17,279 INFO L878 garLoopResultBuilder]: At program point L128-1(lines 7 137) the Hoare annotation is: false [2022-03-20 17:19:17,279 INFO L878 garLoopResultBuilder]: At program point L62-1(lines 35 132) the Hoare annotation is: (let ((.cse0 (= main_~lk1~0 1)) (.cse3 (= main_~p2~0 0)) (.cse2 (= main_~p1~0 0)) (.cse1 (= main_~lk2~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse3) (and .cse2 .cse1))) [2022-03-20 17:19:17,279 INFO L878 garLoopResultBuilder]: At program point L112-1(lines 35 132) the Hoare annotation is: (let ((.cse3 (= main_~lk8~0 1)) (.cse4 (= main_~p7~0 0)) (.cse2 (= main_~p6~0 0)) (.cse0 (= main_~lk7~0 1)) (.cse1 (= main_~p8~0 0)) (.cse5 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2) (and .cse1 .cse4 .cse2) (and .cse3 .cse4 .cse5) (and .cse0 .cse3 .cse5) (and .cse1 .cse4 .cse5) (and .cse3 .cse4 .cse2) (and .cse0 .cse1 .cse5))) [2022-03-20 17:19:17,280 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 6 137) the Hoare annotation is: true [2022-03-20 17:19:17,280 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 135) the Hoare annotation is: false [2022-03-20 17:19:17,280 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 6 137) the Hoare annotation is: true [2022-03-20 17:19:17,280 INFO L878 garLoopResultBuilder]: At program point L113(line 113) the Hoare annotation is: (let ((.cse4 (= main_~lk6~0 1)) (.cse5 (= main_~lk8~0 1)) (.cse6 (= main_~p7~0 0)) (.cse0 (not (= main_~p5~0 0))) (.cse1 (= main_~lk7~0 1)) (.cse2 (= main_~lk5~0 1)) (.cse3 (= main_~p8~0 0)) (.cse7 (= main_~p6~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse5 .cse6 .cse4) (and .cse0 .cse2 .cse3 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse5 .cse7) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse0 .cse1 .cse2 .cse5 .cse4) (and .cse0 .cse2 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse7))) [2022-03-20 17:19:17,280 INFO L878 garLoopResultBuilder]: At program point L97-1(lines 35 132) the Hoare annotation is: (let ((.cse11 (= main_~p4~0 0)) (.cse7 (= main_~p6~0 0)) (.cse10 (= main_~p5~0 0)) (.cse6 (= main_~p8~0 0)) (.cse4 (= main_~p7~0 0)) (.cse9 (= main_~p3~0 0)) (.cse8 (= main_~lk7~0 1)) (.cse0 (= main_~lk5~0 1)) (.cse1 (= main_~lk8~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse5 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse7) (and .cse8 .cse0 .cse6 .cse2 .cse5 .cse9) (and .cse8 .cse1 .cse2 .cse10 .cse7 .cse9) (and .cse8 .cse1 .cse2 .cse3 .cse10 .cse7) (and .cse8 .cse11 .cse0 .cse1 .cse3 .cse7) (and .cse8 .cse6 .cse2 .cse10 .cse7 .cse9) (and .cse11 .cse0 .cse6 .cse3 .cse4 .cse5) (and .cse8 .cse6 .cse2 .cse3 .cse10 .cse7) (and .cse8 .cse11 .cse6 .cse10 .cse7 .cse9) (and .cse8 .cse11 .cse0 .cse6 .cse7 .cse9) (and .cse6 .cse2 .cse3 .cse4 .cse10 .cse7) (and .cse11 .cse1 .cse3 .cse4 .cse10 .cse7) (and .cse11 .cse6 .cse3 .cse4 .cse10 .cse5) (and .cse8 .cse11 .cse0 .cse1 .cse5 .cse9) (and .cse8 .cse11 .cse6 .cse10 .cse5 .cse9) (and .cse8 .cse1 .cse2 .cse10 .cse5 .cse9) (and .cse11 .cse1 .cse4 .cse10 .cse7 .cse9) (and .cse8 .cse1 .cse2 .cse3 .cse10 .cse5) (and .cse8 .cse11 .cse1 .cse10 .cse5 .cse9) (and .cse8 .cse0 .cse6 .cse2 .cse7 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse5) (and .cse8 .cse0 .cse1 .cse2 .cse7 .cse9) (and .cse1 .cse2 .cse4 .cse10 .cse7 .cse9) (and .cse6 .cse2 .cse4 .cse10 .cse5 .cse9) (and .cse6 .cse2 .cse4 .cse10 .cse7 .cse9) (and .cse8 .cse11 .cse0 .cse6 .cse5 .cse9) (and .cse6 .cse2 .cse3 .cse4 .cse10 .cse5) (and .cse11 .cse0 .cse1 .cse4 .cse5 .cse9) (and .cse11 .cse0 .cse6 .cse4 .cse7 .cse9) (and .cse8 .cse11 .cse1 .cse3 .cse10 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse7) (and .cse11 .cse0 .cse6 .cse4 .cse5 .cse9) (and .cse11 .cse1 .cse3 .cse4 .cse10 .cse5) (and .cse11 .cse6 .cse3 .cse4 .cse10 .cse7) (and .cse8 .cse11 .cse0 .cse1 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse9) (and .cse8 .cse11 .cse0 .cse1 .cse7 .cse9) (and .cse8 .cse0 .cse1 .cse2 .cse5 .cse9) (and .cse11 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse11 .cse0 .cse1 .cse3 .cse4 .cse7) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse7) (and .cse8 .cse11 .cse6 .cse3 .cse10 .cse7) (and .cse0 .cse1 .cse2 .cse4 .cse7 .cse9) (and .cse11 .cse0 .cse1 .cse4 .cse7 .cse9) (and .cse8 .cse6 .cse2 .cse10 .cse5 .cse9) (and .cse8 .cse11 .cse6 .cse3 .cse10 .cse5) (and .cse8 .cse0 .cse6 .cse2 .cse3 .cse5) (and .cse11 .cse0 .cse6 .cse3 .cse4 .cse7) (and .cse8 .cse11 .cse1 .cse3 .cse10 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7) (and .cse0 .cse6 .cse2 .cse4 .cse7 .cse9) (and .cse8 .cse6 .cse2 .cse3 .cse10 .cse5) (and .cse8 .cse11 .cse1 .cse10 .cse7 .cse9) (and .cse8 .cse11 .cse0 .cse6 .cse3 .cse5) (and .cse8 .cse0 .cse6 .cse2 .cse3 .cse7) (and .cse11 .cse1 .cse4 .cse10 .cse5 .cse9) (and .cse11 .cse6 .cse4 .cse10 .cse5 .cse9) (and .cse8 .cse11 .cse0 .cse6 .cse3 .cse7) (and .cse11 .cse6 .cse4 .cse10 .cse7 .cse9) (and .cse1 .cse2 .cse4 .cse10 .cse5 .cse9) (and .cse0 .cse6 .cse2 .cse4 .cse5 .cse9) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse5))) [2022-03-20 17:19:17,280 INFO L878 garLoopResultBuilder]: At program point L122-1(lines 35 132) the Hoare annotation is: (or (= main_~p8~0 0) (= main_~lk8~0 1)) [2022-03-20 17:19:17,281 INFO L878 garLoopResultBuilder]: At program point L98(line 98) the Hoare annotation is: (let ((.cse11 (= main_~lk7~0 1)) (.cse5 (= main_~p6~0 0)) (.cse8 (= main_~lk4~0 1)) (.cse1 (= main_~lk5~0 1)) (.cse2 (= main_~lk8~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse0 (= main_~p4~0 0)) (.cse7 (= main_~p8~0 0)) (.cse4 (= main_~p7~0 0)) (.cse10 (= main_~p5~0 0)) (.cse12 (= main_~lk6~0 1)) (.cse9 (= main_~p3~0 0)) (.cse6 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse7 .cse8 .cse4 .cse5 .cse9 .cse6) (and .cse7 .cse8 .cse4 .cse10 .cse5 .cse9 .cse6) (and .cse11 .cse0 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse2 .cse8 .cse3 .cse4 .cse10 .cse5 .cse6) (and .cse11 .cse0 .cse2 .cse3 .cse10 .cse12 .cse6) (and .cse11 .cse0 .cse1 .cse2 .cse5 .cse9 .cse6) (and .cse11 .cse0 .cse7 .cse3 .cse10 .cse5 .cse6) (and .cse11 .cse1 .cse2 .cse8 .cse3 .cse12 .cse6) (and .cse11 .cse7 .cse8 .cse10 .cse5 .cse9 .cse6) (and .cse2 .cse8 .cse4 .cse10 .cse12 .cse9 .cse6) (and .cse0 .cse1 .cse7 .cse4 .cse5 .cse9 .cse6) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse12 .cse6) (and .cse11 .cse1 .cse7 .cse8 .cse3 .cse5 .cse6) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse5 .cse6) (and .cse11 .cse2 .cse8 .cse3 .cse10 .cse5 .cse6) (and .cse11 .cse0 .cse7 .cse10 .cse12 .cse9 .cse6) (and .cse0 .cse1 .cse7 .cse4 .cse12 .cse9 .cse6) (and .cse1 .cse7 .cse8 .cse3 .cse4 .cse12 .cse6) (and .cse0 .cse2 .cse4 .cse10 .cse12 .cse9 .cse6) (and .cse0 .cse7 .cse4 .cse10 .cse5 .cse9 .cse6) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse9 .cse6) (and .cse1 .cse7 .cse8 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse8 .cse3 .cse4 .cse10 .cse12 .cse6) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse9 .cse6) (and .cse11 .cse7 .cse8 .cse3 .cse10 .cse12 .cse6) (and .cse11 .cse0 .cse1 .cse7 .cse5 .cse9 .cse6) (and .cse11 .cse1 .cse2 .cse8 .cse3 .cse5 .cse6) (and .cse11 .cse0 .cse1 .cse7 .cse3 .cse12 .cse6) (and .cse0 .cse7 .cse3 .cse4 .cse10 .cse12 .cse6) (and .cse11 .cse0 .cse2 .cse10 .cse12 .cse9 .cse6) (and .cse1 .cse2 .cse8 .cse4 .cse12 .cse9 .cse6) (and .cse11 .cse0 .cse1 .cse7 .cse12 .cse9 .cse6) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse9 .cse6) (and .cse1 .cse2 .cse8 .cse4 .cse5 .cse9 .cse6) (and .cse11 .cse0 .cse7 .cse10 .cse5 .cse9 .cse6) (and .cse11 .cse1 .cse2 .cse8 .cse5 .cse9 .cse6) (and .cse11 .cse1 .cse2 .cse8 .cse12 .cse9 .cse6) (and .cse11 .cse7 .cse8 .cse10 .cse12 .cse9 .cse6) (and .cse11 .cse0 .cse1 .cse7 .cse3 .cse5 .cse6) (and .cse7 .cse8 .cse3 .cse4 .cse10 .cse5 .cse6) (and .cse11 .cse1 .cse7 .cse8 .cse5 .cse9 .cse6) (and .cse1 .cse7 .cse8 .cse4 .cse12 .cse9 .cse6) (and .cse11 .cse2 .cse8 .cse3 .cse10 .cse12 .cse6) (and .cse11 .cse2 .cse8 .cse10 .cse12 .cse9 .cse6) (and .cse11 .cse0 .cse7 .cse3 .cse10 .cse12 .cse6) (and .cse0 .cse7 .cse3 .cse4 .cse10 .cse5 .cse6) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse10 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse5 .cse6) (and .cse11 .cse2 .cse8 .cse10 .cse5 .cse9 .cse6) (and .cse11 .cse0 .cse2 .cse10 .cse5 .cse9 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse10 .cse12 .cse6) (and .cse0 .cse2 .cse4 .cse10 .cse5 .cse9 .cse6) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse12 .cse6) (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse12 .cse6) (and .cse7 .cse8 .cse4 .cse10 .cse12 .cse9 .cse6) (and .cse11 .cse1 .cse7 .cse8 .cse12 .cse9 .cse6) (and .cse2 .cse8 .cse4 .cse10 .cse5 .cse9 .cse6) (and .cse11 .cse1 .cse7 .cse8 .cse3 .cse12 .cse6) (and .cse11 .cse7 .cse8 .cse3 .cse10 .cse5 .cse6) (and .cse7 .cse8 .cse3 .cse4 .cse10 .cse12 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse6) (and .cse0 .cse7 .cse4 .cse10 .cse12 .cse9 .cse6))) [2022-03-20 17:19:17,281 INFO L878 garLoopResultBuilder]: At program point L123(line 123) the Hoare annotation is: (let ((.cse0 (= main_~lk7~0 1)) (.cse1 (not (= main_~p7~0 0)))) (or (and .cse0 (= main_~p8~0 0) .cse1) (and .cse0 (= main_~lk8~0 1) .cse1))) [2022-03-20 17:19:17,281 INFO L878 garLoopResultBuilder]: At program point L82-1(lines 35 132) the Hoare annotation is: (let ((.cse9 (= main_~lk3~0 1)) (.cse7 (= main_~lk5~0 1)) (.cse8 (= main_~lk1~0 1)) (.cse11 (= main_~lk4~0 1)) (.cse2 (= main_~p7~0 0)) (.cse13 (= main_~p2~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse12 (= main_~lk7~0 1)) (.cse0 (= main_~p4~0 0)) (.cse1 (= main_~p1~0 0)) (.cse3 (= main_~p5~0 0)) (.cse10 (= main_~p6~0 0)) (.cse5 (= main_~p3~0 0)) (.cse6 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse10 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse2 .cse4 .cse5 .cse6) (and .cse12 .cse11 .cse1 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse8 .cse11 .cse3 .cse13 .cse4 .cse5) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse13 .cse4) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse13 .cse10) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse10 .cse6) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse13 .cse4) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse10 .cse6) (and .cse7 .cse8 .cse11 .cse2 .cse13 .cse4 .cse5) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse13 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse1 .cse13 .cse4 .cse5) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse8 .cse2 .cse4 .cse5 .cse6) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse13 .cse10) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse13 .cse4) (and .cse0 .cse7 .cse1 .cse2 .cse13 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse8 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse0 .cse7 .cse1 .cse4 .cse5 .cse6) (and .cse11 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse13 .cse4) (and .cse12 .cse7 .cse11 .cse1 .cse13 .cse10 .cse5) (and .cse12 .cse7 .cse11 .cse1 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse4 .cse6) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse10 .cse6) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse4 .cse6) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse4 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse4 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse8 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse13 .cse4) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse8 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse11 .cse1 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse1 .cse2 .cse10 .cse5 .cse6) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse10 .cse6) (and .cse11 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse10 .cse6) (and .cse11 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse4 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse13 .cse4) (and .cse12 .cse0 .cse7 .cse8 .cse13 .cse4 .cse5) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse13 .cse10) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse13 .cse4) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse4 .cse6) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse1 .cse2 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse13 .cse10) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse4 .cse6) (and .cse8 .cse11 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse10 .cse6) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse13 .cse4) (and .cse12 .cse0 .cse7 .cse8 .cse10 .cse5 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse13 .cse10 .cse5) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse3 .cse10 .cse5 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse13 .cse10) (and .cse11 .cse1 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse13 .cse4) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse13 .cse10) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse10 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse10 .cse6) (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse10 .cse6) (and .cse12 .cse0 .cse1 .cse3 .cse13 .cse4 .cse5) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse10 .cse6) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse10 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse10 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse13 .cse4 .cse5) (and .cse12 .cse11 .cse1 .cse3 .cse10 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse4 .cse6) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse4 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse13 .cse4 .cse5) (and .cse0 .cse7 .cse8 .cse2 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse10 .cse6) (and .cse12 .cse0 .cse8 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse13 .cse4) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse10 .cse6) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse13 .cse10) (and .cse7 .cse8 .cse11 .cse2 .cse13 .cse10 .cse5) (and .cse12 .cse8 .cse11 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse0 .cse1 .cse3 .cse13 .cse10 .cse5) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse13 .cse4) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse13 .cse10) (and .cse0 .cse7 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse12 .cse7 .cse11 .cse1 .cse4 .cse5 .cse6) (and .cse12 .cse11 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse13 .cse10) (and .cse12 .cse7 .cse8 .cse11 .cse10 .cse5 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse13 .cse10) (and .cse12 .cse0 .cse7 .cse8 .cse4 .cse5 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse7 .cse1 .cse13 .cse10 .cse5) (and .cse8 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse2 .cse13 .cse4 .cse5) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse13 .cse10) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse4 .cse6) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse10 .cse6) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse13 .cse10) (and .cse12 .cse0 .cse7 .cse1 .cse10 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse13 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse13 .cse10) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse13 .cse4) (and .cse12 .cse7 .cse11 .cse1 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse7 .cse8 .cse13 .cse10 .cse5) (and .cse0 .cse7 .cse8 .cse2 .cse13 .cse10 .cse5) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse13 .cse10) (and .cse7 .cse8 .cse11 .cse2 .cse10 .cse5 .cse6) (and .cse8 .cse11 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse8 .cse11 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse1 .cse3 .cse10 .cse5 .cse6))) [2022-03-20 17:19:17,282 INFO L878 garLoopResultBuilder]: At program point L107-1(lines 35 132) the Hoare annotation is: (let ((.cse0 (= main_~lk7~0 1)) (.cse2 (= main_~lk8~0 1)) (.cse1 (= main_~lk5~0 1)) (.cse3 (= main_~lk6~0 1)) (.cse4 (= main_~p8~0 0)) (.cse5 (= main_~p7~0 0)) (.cse6 (= main_~p5~0 0)) (.cse7 (= main_~p6~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse3) (and .cse1 .cse2 .cse5 .cse7) (and .cse0 .cse2 .cse6 .cse3) (and .cse1 .cse4 .cse5 .cse7) (and .cse0 .cse4 .cse6 .cse7) (and .cse0 .cse1 .cse4 .cse7) (and .cse2 .cse5 .cse6 .cse3) (and .cse0 .cse1 .cse4 .cse3) (and .cse2 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse5 .cse3) (and .cse0 .cse2 .cse6 .cse7) (and .cse0 .cse4 .cse6 .cse3) (and .cse0 .cse1 .cse2 .cse7) (and .cse1 .cse4 .cse5 .cse3) (and .cse4 .cse5 .cse6 .cse7))) [2022-03-20 17:19:17,282 INFO L878 garLoopResultBuilder]: At program point L74-1(lines 35 132) the Hoare annotation is: (let ((.cse9 (= main_~lk2~0 1)) (.cse4 (= main_~p3~0 0)) (.cse5 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse6 (= main_~lk3~0 1)) (.cse8 (= main_~p1~0 0)) (.cse7 (= main_~p5~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse3) (and .cse1 .cse2 .cse7 .cse3 .cse4) (and .cse2 .cse8 .cse7 .cse4 .cse9) (and .cse0 .cse2 .cse8 .cse3 .cse4) (and .cse5 .cse0 .cse8 .cse4 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse9) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse5 .cse6 .cse8 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse6 .cse3) (and .cse5 .cse0 .cse6 .cse8 .cse3) (and .cse0 .cse1 .cse2 .cse4 .cse9) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse1 .cse2 .cse6 .cse7 .cse9) (and .cse1 .cse2 .cse7 .cse4 .cse9) (and .cse5 .cse0 .cse6 .cse8 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse3) (and .cse5 .cse0 .cse8 .cse3 .cse4) (and .cse5 .cse1 .cse7 .cse4 .cse9) (and .cse5 .cse8 .cse7 .cse3 .cse4) (and .cse2 .cse6 .cse8 .cse7 .cse9) (and .cse5 .cse0 .cse1 .cse4 .cse9) (and .cse2 .cse8 .cse7 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse9) (and .cse1 .cse2 .cse6 .cse7 .cse3) (and .cse0 .cse2 .cse8 .cse4 .cse9) (and .cse5 .cse8 .cse7 .cse4 .cse9) (and .cse5 .cse6 .cse8 .cse7 .cse3) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse3) (and .cse2 .cse6 .cse8 .cse7 .cse3))) [2022-03-20 17:19:17,282 INFO L878 garLoopResultBuilder]: At program point L66-1(lines 35 132) the Hoare annotation is: (let ((.cse4 (= main_~p1~0 0)) (.cse2 (= main_~p3~0 0)) (.cse5 (= main_~lk2~0 1)) (.cse0 (= main_~lk1~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse1 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse4 .cse1 .cse2) (and .cse0 .cse3 .cse5) (and .cse3 .cse4 .cse1) (and .cse0 .cse2 .cse5) (and .cse4 .cse2 .cse5) (and .cse0 .cse3 .cse1))) [2022-03-20 17:19:17,282 INFO L885 garLoopResultBuilder]: At program point L58(lines 58 60) the Hoare annotation is: true [2022-03-20 17:19:17,282 INFO L878 garLoopResultBuilder]: At program point L58-2(lines 35 132) the Hoare annotation is: (or (= main_~lk1~0 1) (= main_~p1~0 0)) [2022-03-20 17:19:17,282 INFO L878 garLoopResultBuilder]: At program point L108(line 108) the Hoare annotation is: (let ((.cse0 (= main_~lk7~0 1)) (.cse9 (= main_~p6~0 0)) (.cse2 (= main_~p8~0 0)) (.cse7 (= main_~p5~0 0)) (.cse1 (= main_~lk5~0 1)) (.cse6 (= main_~lk8~0 1)) (.cse3 (not (= main_~p4~0 0))) (.cse4 (= main_~lk4~0 1)) (.cse8 (= main_~p7~0 0)) (.cse5 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse3 .cse4 .cse7 .cse5) (and .cse0 .cse1 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 .cse7 .cse5) (and .cse2 .cse3 .cse4 .cse8 .cse7 .cse9) (and .cse1 .cse6 .cse3 .cse4 .cse8 .cse9) (and .cse0 .cse1 .cse6 .cse3 .cse4 .cse9) (and .cse2 .cse3 .cse4 .cse8 .cse7 .cse5) (and .cse0 .cse2 .cse3 .cse4 .cse7 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse8 .cse9) (and .cse6 .cse3 .cse4 .cse8 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse9) (and .cse0 .cse6 .cse3 .cse4 .cse7 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse8 .cse5) (and .cse6 .cse3 .cse4 .cse8 .cse7 .cse5) (and .cse1 .cse6 .cse3 .cse4 .cse8 .cse5))) [2022-03-20 17:19:17,282 INFO L885 garLoopResultBuilder]: At program point L133(lines 7 137) the Hoare annotation is: true [2022-03-20 17:19:17,283 INFO L878 garLoopResultBuilder]: At program point L92-1(lines 35 132) the Hoare annotation is: (let ((.cse6 (= main_~p6~0 0)) (.cse0 (= main_~lk7~0 1)) (.cse7 (= main_~p4~0 0)) (.cse11 (= main_~p8~0 0)) (.cse4 (= main_~p5~0 0)) (.cse12 (= main_~p3~0 0)) (.cse10 (= main_~lk2~0 1)) (.cse8 (= main_~lk5~0 1)) (.cse1 (= main_~lk8~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse9 (= main_~p7~0 0)) (.cse5 (= main_~p2~0 0)) (.cse13 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse1 .cse3 .cse9 .cse6 .cse10) (and .cse8 .cse11 .cse2 .cse9 .cse6 .cse12 .cse10) (and .cse7 .cse11 .cse9 .cse4 .cse5 .cse6 .cse12) (and .cse11 .cse2 .cse9 .cse4 .cse6 .cse12 .cse10) (and .cse0 .cse7 .cse1 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse7 .cse1 .cse3 .cse4 .cse6 .cse10) (and .cse1 .cse2 .cse3 .cse9 .cse4 .cse6 .cse10) (and .cse0 .cse8 .cse1 .cse2 .cse5 .cse13 .cse12) (and .cse11 .cse2 .cse3 .cse9 .cse4 .cse5 .cse13) (and .cse7 .cse8 .cse1 .cse3 .cse9 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse1 .cse5 .cse6 .cse12) (and .cse0 .cse7 .cse1 .cse3 .cse4 .cse13 .cse10) (and .cse8 .cse11 .cse2 .cse9 .cse5 .cse13 .cse12) (and .cse11 .cse2 .cse9 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse1 .cse6 .cse12 .cse10) (and .cse0 .cse7 .cse8 .cse1 .cse5 .cse13 .cse12) (and .cse0 .cse7 .cse11 .cse3 .cse4 .cse6 .cse10) (and .cse0 .cse8 .cse11 .cse2 .cse5 .cse13 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse13 .cse10) (and .cse0 .cse11 .cse2 .cse4 .cse6 .cse12 .cse10) (and .cse1 .cse2 .cse3 .cse9 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse9 .cse4 .cse5 .cse13) (and .cse1 .cse2 .cse9 .cse4 .cse13 .cse12 .cse10) (and .cse8 .cse1 .cse2 .cse9 .cse5 .cse13 .cse12) (and .cse7 .cse8 .cse11 .cse9 .cse6 .cse12 .cse10) (and .cse0 .cse7 .cse8 .cse1 .cse3 .cse13 .cse10) (and .cse0 .cse8 .cse11 .cse2 .cse3 .cse6 .cse10) (and .cse8 .cse1 .cse2 .cse3 .cse9 .cse6 .cse10) (and .cse0 .cse7 .cse8 .cse11 .cse3 .cse5 .cse13) (and .cse7 .cse11 .cse9 .cse4 .cse5 .cse13 .cse12) (and .cse0 .cse8 .cse11 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse10) (and .cse7 .cse1 .cse9 .cse4 .cse5 .cse6 .cse12) (and .cse11 .cse2 .cse3 .cse9 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse11 .cse4 .cse13 .cse12 .cse10) (and .cse0 .cse7 .cse1 .cse3 .cse4 .cse5 .cse13) (and .cse7 .cse8 .cse1 .cse9 .cse5 .cse6 .cse12) (and .cse7 .cse8 .cse11 .cse9 .cse13 .cse12 .cse10) (and .cse8 .cse11 .cse2 .cse3 .cse9 .cse13 .cse10) (and .cse0 .cse7 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse11 .cse4 .cse5 .cse13 .cse12) (and .cse7 .cse1 .cse9 .cse4 .cse13 .cse12 .cse10) (and .cse7 .cse8 .cse11 .cse3 .cse9 .cse5 .cse13) (and .cse7 .cse11 .cse9 .cse4 .cse6 .cse12 .cse10) (and .cse7 .cse8 .cse1 .cse9 .cse6 .cse12 .cse10) (and .cse8 .cse11 .cse2 .cse3 .cse9 .cse6 .cse10) (and .cse1 .cse2 .cse3 .cse9 .cse4 .cse13 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse8 .cse1 .cse9 .cse13 .cse12 .cse10) (and .cse0 .cse7 .cse8 .cse11 .cse5 .cse6 .cse12) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse13 .cse10) (and .cse0 .cse7 .cse8 .cse11 .cse6 .cse12 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse13 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse6 .cse10) (and .cse0 .cse7 .cse8 .cse11 .cse3 .cse13 .cse10) (and .cse7 .cse8 .cse11 .cse9 .cse5 .cse13 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse5 .cse6 .cse12) (and .cse7 .cse11 .cse3 .cse9 .cse4 .cse13 .cse10) (and .cse0 .cse7 .cse1 .cse4 .cse13 .cse12 .cse10) (and .cse8 .cse11 .cse2 .cse3 .cse9 .cse5 .cse13) (and .cse0 .cse7 .cse8 .cse1 .cse3 .cse5 .cse13) (and .cse8 .cse1 .cse2 .cse9 .cse13 .cse12 .cse10) (and .cse0 .cse8 .cse11 .cse2 .cse3 .cse5 .cse13) (and .cse0 .cse7 .cse8 .cse11 .cse13 .cse12 .cse10) (and .cse0 .cse7 .cse8 .cse1 .cse13 .cse12 .cse10) (and .cse7 .cse1 .cse3 .cse9 .cse4 .cse5 .cse6) (and .cse8 .cse1 .cse2 .cse9 .cse6 .cse12 .cse10) (and .cse7 .cse11 .cse3 .cse9 .cse4 .cse5 .cse13) (and .cse0 .cse7 .cse11 .cse4 .cse6 .cse12 .cse10) (and .cse0 .cse8 .cse1 .cse2 .cse6 .cse12 .cse10) (and .cse0 .cse8 .cse1 .cse2 .cse13 .cse12 .cse10) (and .cse0 .cse11 .cse2 .cse4 .cse13 .cse12 .cse10) (and .cse8 .cse11 .cse2 .cse3 .cse9 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse5 .cse6 .cse12) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse11 .cse3 .cse6 .cse10) (and .cse11 .cse2 .cse3 .cse9 .cse4 .cse6 .cse10) (and .cse0 .cse8 .cse11 .cse2 .cse6 .cse12 .cse10) (and .cse8 .cse11 .cse2 .cse9 .cse13 .cse12 .cse10) (and .cse0 .cse7 .cse11 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse13 .cse12 .cse10) (and .cse7 .cse1 .cse9 .cse4 .cse5 .cse13 .cse12) (and .cse0 .cse7 .cse11 .cse3 .cse4 .cse13 .cse10) (and .cse0 .cse7 .cse11 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse11 .cse3 .cse5 .cse6) (and .cse8 .cse1 .cse2 .cse9 .cse5 .cse6 .cse12) (and .cse7 .cse11 .cse3 .cse9 .cse4 .cse6 .cse10) (and .cse0 .cse7 .cse8 .cse1 .cse3 .cse6 .cse10) (and .cse0 .cse7 .cse8 .cse1 .cse3 .cse5 .cse6) (and .cse7 .cse1 .cse3 .cse9 .cse4 .cse6 .cse10) (and .cse7 .cse8 .cse11 .cse3 .cse9 .cse6 .cse10) (and .cse0 .cse7 .cse1 .cse4 .cse5 .cse13 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse13) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse5 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse6 .cse12 .cse10) (and .cse0 .cse7 .cse1 .cse4 .cse6 .cse12 .cse10) (and .cse7 .cse1 .cse3 .cse9 .cse4 .cse13 .cse10) (and .cse0 .cse7 .cse8 .cse11 .cse5 .cse13 .cse12) (and .cse1 .cse2 .cse9 .cse4 .cse5 .cse13 .cse12) (and .cse7 .cse1 .cse9 .cse4 .cse6 .cse12 .cse10) (and .cse8 .cse1 .cse2 .cse3 .cse9 .cse13 .cse10) (and .cse7 .cse8 .cse11 .cse3 .cse9 .cse13 .cse10) (and .cse11 .cse2 .cse9 .cse4 .cse13 .cse12 .cse10) (and .cse0 .cse8 .cse11 .cse2 .cse13 .cse12 .cse10) (and .cse1 .cse2 .cse9 .cse4 .cse6 .cse12 .cse10) (and .cse0 .cse8 .cse11 .cse2 .cse5 .cse6 .cse12) (and .cse0 .cse8 .cse11 .cse2 .cse3 .cse13 .cse10) (and .cse7 .cse8 .cse1 .cse9 .cse5 .cse13 .cse12) (and .cse0 .cse11 .cse2 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse6 .cse10) (and .cse0 .cse11 .cse2 .cse4 .cse5 .cse13 .cse12) (and .cse7 .cse8 .cse11 .cse3 .cse9 .cse5 .cse6) (and .cse7 .cse1 .cse3 .cse9 .cse4 .cse5 .cse13) (and .cse11 .cse2 .cse3 .cse9 .cse4 .cse13 .cse10) (and .cse8 .cse11 .cse2 .cse9 .cse5 .cse6 .cse12) (and .cse8 .cse1 .cse2 .cse3 .cse9 .cse5 .cse6) (and .cse7 .cse8 .cse1 .cse3 .cse9 .cse5 .cse13) (and .cse7 .cse8 .cse1 .cse3 .cse9 .cse13 .cse10) (and .cse7 .cse11 .cse3 .cse9 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse9 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse5 .cse13) (and .cse11 .cse2 .cse9 .cse4 .cse5 .cse13 .cse12) (and .cse0 .cse7 .cse11 .cse3 .cse4 .cse5 .cse13) (and .cse7 .cse11 .cse9 .cse4 .cse13 .cse12 .cse10) (and .cse8 .cse1 .cse2 .cse3 .cse9 .cse5 .cse13))) [2022-03-20 17:19:17,283 INFO L878 garLoopResultBuilder]: At program point L117-1(lines 35 132) the Hoare annotation is: (let ((.cse1 (= main_~p8~0 0)) (.cse3 (= main_~p7~0 0)) (.cse0 (= main_~lk7~0 1)) (.cse2 (= main_~lk8~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse1 .cse3) (and .cse0 .cse2))) [2022-03-20 17:19:17,285 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-03-20 17:19:17,287 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-20 17:19:17,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 05:19:17 BoogieIcfgContainer [2022-03-20 17:19:17,303 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-20 17:19:17,305 INFO L158 Benchmark]: Toolchain (without parser) took 114517.07ms. Allocated memory was 179.3MB in the beginning and 1.1GB in the end (delta: 919.6MB). Free memory was 129.3MB in the beginning and 680.2MB in the end (delta: -550.8MB). Peak memory consumption was 660.5MB. Max. memory is 8.0GB. [2022-03-20 17:19:17,305 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 179.3MB. Free memory is still 146.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-20 17:19:17,306 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.80ms. Allocated memory is still 179.3MB. Free memory was 129.2MB in the beginning and 154.7MB in the end (delta: -25.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-03-20 17:19:17,306 INFO L158 Benchmark]: Boogie Preprocessor took 38.91ms. Allocated memory is still 179.3MB. Free memory was 154.7MB in the beginning and 153.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-20 17:19:17,307 INFO L158 Benchmark]: RCFGBuilder took 362.62ms. Allocated memory is still 179.3MB. Free memory was 153.2MB in the beginning and 141.4MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-03-20 17:19:17,307 INFO L158 Benchmark]: TraceAbstraction took 113869.41ms. Allocated memory was 179.3MB in the beginning and 1.1GB in the end (delta: 919.6MB). Free memory was 141.1MB in the beginning and 680.2MB in the end (delta: -539.1MB). Peak memory consumption was 672.4MB. Max. memory is 8.0GB. [2022-03-20 17:19:17,310 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 179.3MB. Free memory is still 146.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 241.80ms. Allocated memory is still 179.3MB. Free memory was 129.2MB in the beginning and 154.7MB in the end (delta: -25.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.91ms. Allocated memory is still 179.3MB. Free memory was 154.7MB in the beginning and 153.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 362.62ms. Allocated memory is still 179.3MB. Free memory was 153.2MB in the beginning and 141.4MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 113869.41ms. Allocated memory was 179.3MB in the beginning and 1.1GB in the end (delta: 919.6MB). Free memory was 141.1MB in the beginning and 680.2MB in the end (delta: -539.1MB). Peak memory consumption was 672.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 135]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 113.8s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 105.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2238 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2238 mSDsluCounter, 1720 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 156 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1083 IncrementalHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 1564 mSDtfsCounter, 1083 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4617occurred in iteration=21, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 1044 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 39 PreInvPairs, 5808 NumberOfFragments, 22569 HoareAnnotationTreeSize, 39 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 49.8s HoareSimplificationTime, 39 FomulaSimplificationsInter, 565747 FormulaSimplificationTreeSizeReductionInter, 55.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-03-20 17:19:17,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...