/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/locks/test_locks_8.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-20 23:53:42,497 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-20 23:53:42,499 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-20 23:53:42,544 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-20 23:53:42,545 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-20 23:53:42,546 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-20 23:53:42,548 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-20 23:53:42,550 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-20 23:53:42,552 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-20 23:53:42,556 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-20 23:53:42,557 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-20 23:53:42,558 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-20 23:53:42,558 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-20 23:53:42,560 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-20 23:53:42,561 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-20 23:53:42,563 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-20 23:53:42,564 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-20 23:53:42,565 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-20 23:53:42,567 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-20 23:53:42,571 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-20 23:53:42,573 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-20 23:53:42,574 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-20 23:53:42,575 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-20 23:53:42,576 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-20 23:53:42,577 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-20 23:53:42,582 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-20 23:53:42,583 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-20 23:53:42,583 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-20 23:53:42,583 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-20 23:53:42,584 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-20 23:53:42,585 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-20 23:53:42,585 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-20 23:53:42,587 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-20 23:53:42,587 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-20 23:53:42,588 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-20 23:53:42,588 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-20 23:53:42,588 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-20 23:53:42,589 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-20 23:53:42,589 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-20 23:53:42,589 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-20 23:53:42,590 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-20 23:53:42,591 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-20 23:53:42,592 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-03-20 23:53:42,600 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-20 23:53:42,600 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-20 23:53:42,601 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-20 23:53:42,601 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-20 23:53:42,601 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-20 23:53:42,601 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-20 23:53:42,601 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-20 23:53:42,601 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-20 23:53:42,601 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-20 23:53:42,602 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-20 23:53:42,602 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-20 23:53:42,602 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-20 23:53:42,603 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-20 23:53:42,603 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-20 23:53:42,603 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-20 23:53:42,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 23:53:42,603 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-20 23:53:42,603 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-20 23:53:42,603 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-03-20 23:53:42,603 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-03-20 23:53:42,603 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-20 23:53:42,604 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-03-20 23:53:42,604 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 23:53:42,793 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-20 23:53:42,815 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-20 23:53:42,817 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-20 23:53:42,818 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-20 23:53:42,819 INFO L275 PluginConnector]: CDTParser initialized [2022-03-20 23:53:42,819 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 23:53:42,865 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07ba66130/d7c81a3130a14288ba91ea817137a743/FLAGfe6933047 [2022-03-20 23:53:43,268 INFO L306 CDTParser]: Found 1 translation units. [2022-03-20 23:53:43,269 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c [2022-03-20 23:53:43,285 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07ba66130/d7c81a3130a14288ba91ea817137a743/FLAGfe6933047 [2022-03-20 23:53:43,299 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07ba66130/d7c81a3130a14288ba91ea817137a743 [2022-03-20 23:53:43,302 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-20 23:53:43,303 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-20 23:53:43,306 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-20 23:53:43,306 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-20 23:53:43,309 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-20 23:53:43,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 11:53:43" (1/1) ... [2022-03-20 23:53:43,311 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b3e9a06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 11:53:43, skipping insertion in model container [2022-03-20 23:53:43,311 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 11:53:43" (1/1) ... [2022-03-20 23:53:43,316 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-20 23:53:43,334 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-20 23:53:43,529 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 23:53:43,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 23:53:43,542 INFO L203 MainTranslator]: Completed pre-run [2022-03-20 23:53:43,574 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 23:53:43,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 23:53:43,586 INFO L208 MainTranslator]: Completed translation [2022-03-20 23:53:43,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 11:53:43 WrapperNode [2022-03-20 23:53:43,587 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-20 23:53:43,588 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-20 23:53:43,588 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-20 23:53:43,588 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-20 23:53:43,596 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 11:53:43" (1/1) ... [2022-03-20 23:53:43,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 11:53:43" (1/1) ... [2022-03-20 23:53:43,602 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 11:53:43" (1/1) ... [2022-03-20 23:53:43,603 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 11:53:43" (1/1) ... [2022-03-20 23:53:43,614 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 11:53:43" (1/1) ... [2022-03-20 23:53:43,618 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 11:53:43" (1/1) ... [2022-03-20 23:53:43,619 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 11:53:43" (1/1) ... [2022-03-20 23:53:43,621 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-20 23:53:43,621 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-20 23:53:43,621 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-20 23:53:43,621 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-20 23:53:43,625 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 11:53:43" (1/1) ... [2022-03-20 23:53:43,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 23:53:43,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 23:53:43,652 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 23:53:43,678 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 23:53:43,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-20 23:53:43,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-20 23:53:43,690 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-20 23:53:43,690 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-20 23:53:43,691 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-20 23:53:43,691 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-20 23:53:43,691 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-20 23:53:43,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-20 23:53:43,692 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-20 23:53:43,692 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-20 23:53:43,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-20 23:53:43,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-20 23:53:43,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-20 23:53:43,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-20 23:53:43,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-20 23:53:43,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-20 23:53:43,749 INFO L234 CfgBuilder]: Building ICFG [2022-03-20 23:53:43,750 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-20 23:53:43,890 INFO L275 CfgBuilder]: Performing block encoding [2022-03-20 23:53:43,895 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-20 23:53:43,895 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-20 23:53:43,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 11:53:43 BoogieIcfgContainer [2022-03-20 23:53:43,897 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-20 23:53:43,898 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-20 23:53:43,898 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-20 23:53:43,901 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-20 23:53:43,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 11:53:43" (1/3) ... [2022-03-20 23:53:43,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ba351c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 11:53:43, skipping insertion in model container [2022-03-20 23:53:43,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 11:53:43" (2/3) ... [2022-03-20 23:53:43,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ba351c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 11:53:43, skipping insertion in model container [2022-03-20 23:53:43,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 11:53:43" (3/3) ... [2022-03-20 23:53:43,903 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2022-03-20 23:53:43,907 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-20 23:53:43,907 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-20 23:53:43,939 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-20 23:53:43,944 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 23:53:43,944 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-20 23:53:43,954 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 23:53:43,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-20 23:53:43,975 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 23:53:43,975 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 23:53:43,976 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 23:53:43,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 23:53:43,979 INFO L85 PathProgramCache]: Analyzing trace with hash 957163615, now seen corresponding path program 1 times [2022-03-20 23:53:43,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:43,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [850925298] [2022-03-20 23:53:44,017 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 23:53:44,018 INFO L85 PathProgramCache]: Analyzing trace with hash 957163615, now seen corresponding path program 2 times [2022-03-20 23:53:44,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 23:53:44,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742317835] [2022-03-20 23:53:44,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 23:53:44,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 23:53:44,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:44,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 23:53:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:44,285 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 23:53:44,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 23:53:44,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742317835] [2022-03-20 23:53:44,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742317835] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:44,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:44,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:44,288 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 23:53:44,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [850925298] [2022-03-20 23:53:44,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [850925298] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:44,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:44,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:44,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734253785] [2022-03-20 23:53:44,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 23:53:44,293 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 23:53:44,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:44,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 23:53:44,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 23:53:44,323 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 23:53:44,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 23:53:44,493 INFO L93 Difference]: Finished difference Result 76 states and 127 transitions. [2022-03-20 23:53:44,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 23:53:44,496 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 23:53:44,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 23:53:44,505 INFO L225 Difference]: With dead ends: 76 [2022-03-20 23:53:44,506 INFO L226 Difference]: Without dead ends: 61 [2022-03-20 23:53:44,509 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 23:53:44,513 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 23:53:44,515 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 23:53:44,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-03-20 23:53:44,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 43. [2022-03-20 23:53:44,559 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 23:53:44,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 74 transitions. [2022-03-20 23:53:44,562 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 74 transitions. Word has length 19 [2022-03-20 23:53:44,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 23:53:44,563 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 74 transitions. [2022-03-20 23:53:44,563 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 23:53:44,564 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 74 transitions. [2022-03-20 23:53:44,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-20 23:53:44,565 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 23:53:44,565 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 23:53:44,565 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-20 23:53:44,566 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 23:53:44,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 23:53:44,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1658228193, now seen corresponding path program 1 times [2022-03-20 23:53:44,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:44,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [749685797] [2022-03-20 23:53:44,570 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 23:53:44,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1658228193, now seen corresponding path program 2 times [2022-03-20 23:53:44,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 23:53:44,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867909675] [2022-03-20 23:53:44,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 23:53:44,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 23:53:44,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:44,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 23:53:44,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:44,678 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 23:53:44,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 23:53:44,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867909675] [2022-03-20 23:53:44,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867909675] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:44,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:44,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:44,679 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 23:53:44,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [749685797] [2022-03-20 23:53:44,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [749685797] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:44,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:44,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:44,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306227511] [2022-03-20 23:53:44,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 23:53:44,681 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 23:53:44,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:44,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 23:53:44,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 23:53:44,682 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 23:53:44,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 23:53:44,838 INFO L93 Difference]: Finished difference Result 98 states and 173 transitions. [2022-03-20 23:53:44,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 23:53:44,839 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 23:53:44,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 23:53:44,842 INFO L225 Difference]: With dead ends: 98 [2022-03-20 23:53:44,842 INFO L226 Difference]: Without dead ends: 61 [2022-03-20 23:53:44,844 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-03-20 23:53:44,846 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 23:53:44,847 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 23:53:44,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-03-20 23:53:44,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2022-03-20 23:53:44,869 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 23:53:44,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 102 transitions. [2022-03-20 23:53:44,877 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 102 transitions. Word has length 19 [2022-03-20 23:53:44,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 23:53:44,880 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 102 transitions. [2022-03-20 23:53:44,880 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 23:53:44,880 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 102 transitions. [2022-03-20 23:53:44,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-20 23:53:44,881 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 23:53:44,881 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 23:53:44,881 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-20 23:53:44,882 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 23:53:44,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 23:53:44,882 INFO L85 PathProgramCache]: Analyzing trace with hash -392484976, now seen corresponding path program 1 times [2022-03-20 23:53:44,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:44,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [165096434] [2022-03-20 23:53:44,883 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 23:53:44,883 INFO L85 PathProgramCache]: Analyzing trace with hash -392484976, now seen corresponding path program 2 times [2022-03-20 23:53:44,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 23:53:44,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242863770] [2022-03-20 23:53:44,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 23:53:44,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 23:53:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:44,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 23:53:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:44,948 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 23:53:44,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 23:53:44,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242863770] [2022-03-20 23:53:44,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242863770] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:44,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:44,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:44,949 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 23:53:44,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [165096434] [2022-03-20 23:53:44,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [165096434] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:44,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:44,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:44,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142186828] [2022-03-20 23:53:44,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 23:53:44,951 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 23:53:44,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:44,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 23:53:44,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 23:53:44,952 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 23:53:45,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 23:53:45,053 INFO L93 Difference]: Finished difference Result 91 states and 154 transitions. [2022-03-20 23:53:45,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 23:53:45,053 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 23:53:45,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 23:53:45,055 INFO L225 Difference]: With dead ends: 91 [2022-03-20 23:53:45,055 INFO L226 Difference]: Without dead ends: 64 [2022-03-20 23:53:45,056 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 23:53:45,058 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 23:53:45,063 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 23:53:45,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-03-20 23:53:45,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2022-03-20 23:53:45,072 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 23:53:45,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 104 transitions. [2022-03-20 23:53:45,073 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 104 transitions. Word has length 20 [2022-03-20 23:53:45,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 23:53:45,073 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 104 transitions. [2022-03-20 23:53:45,074 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 23:53:45,074 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 104 transitions. [2022-03-20 23:53:45,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-20 23:53:45,074 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 23:53:45,075 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 23:53:45,075 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-20 23:53:45,075 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 23:53:45,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 23:53:45,075 INFO L85 PathProgramCache]: Analyzing trace with hash -134319538, now seen corresponding path program 1 times [2022-03-20 23:53:45,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:45,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1544585070] [2022-03-20 23:53:45,076 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 23:53:45,076 INFO L85 PathProgramCache]: Analyzing trace with hash -134319538, now seen corresponding path program 2 times [2022-03-20 23:53:45,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 23:53:45,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920166720] [2022-03-20 23:53:45,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 23:53:45,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 23:53:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:45,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 23:53:45,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:45,119 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 23:53:45,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 23:53:45,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920166720] [2022-03-20 23:53:45,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920166720] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:45,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:45,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:45,120 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 23:53:45,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1544585070] [2022-03-20 23:53:45,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1544585070] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:45,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:45,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:45,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331546830] [2022-03-20 23:53:45,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 23:53:45,121 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 23:53:45,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:45,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 23:53:45,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 23:53:45,123 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 23:53:45,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 23:53:45,208 INFO L93 Difference]: Finished difference Result 166 states and 288 transitions. [2022-03-20 23:53:45,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 23:53:45,208 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 23:53:45,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 23:53:45,210 INFO L225 Difference]: With dead ends: 166 [2022-03-20 23:53:45,210 INFO L226 Difference]: Without dead ends: 113 [2022-03-20 23:53:45,212 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 23:53:45,215 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 129 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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 23:53:45,218 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 23:53:45,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-03-20 23:53:45,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2022-03-20 23:53:45,249 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 23:53:45,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 189 transitions. [2022-03-20 23:53:45,252 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 189 transitions. Word has length 20 [2022-03-20 23:53:45,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 23:53:45,252 INFO L478 AbstractCegarLoop]: Abstraction has 111 states and 189 transitions. [2022-03-20 23:53:45,252 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 23:53:45,252 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 189 transitions. [2022-03-20 23:53:45,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-20 23:53:45,254 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 23:53:45,254 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 23:53:45,254 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-20 23:53:45,254 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 23:53:45,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 23:53:45,255 INFO L85 PathProgramCache]: Analyzing trace with hash -835384116, now seen corresponding path program 1 times [2022-03-20 23:53:45,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:45,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1818457581] [2022-03-20 23:53:45,255 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 23:53:45,256 INFO L85 PathProgramCache]: Analyzing trace with hash -835384116, now seen corresponding path program 2 times [2022-03-20 23:53:45,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 23:53:45,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087074525] [2022-03-20 23:53:45,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 23:53:45,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 23:53:45,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:45,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 23:53:45,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:45,298 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 23:53:45,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 23:53:45,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087074525] [2022-03-20 23:53:45,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087074525] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:45,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:45,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:45,299 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 23:53:45,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1818457581] [2022-03-20 23:53:45,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1818457581] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:45,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:45,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:45,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360846376] [2022-03-20 23:53:45,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 23:53:45,300 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 23:53:45,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:45,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 23:53:45,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 23:53:45,301 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 23:53:45,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 23:53:45,372 INFO L93 Difference]: Finished difference Result 143 states and 243 transitions. [2022-03-20 23:53:45,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 23:53:45,373 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 23:53:45,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 23:53:45,374 INFO L225 Difference]: With dead ends: 143 [2022-03-20 23:53:45,374 INFO L226 Difference]: Without dead ends: 141 [2022-03-20 23:53:45,374 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 23:53:45,375 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 23:53:45,375 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 23:53:45,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-03-20 23:53:45,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 111. [2022-03-20 23:53:45,388 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 23:53:45,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 187 transitions. [2022-03-20 23:53:45,389 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 187 transitions. Word has length 20 [2022-03-20 23:53:45,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 23:53:45,389 INFO L478 AbstractCegarLoop]: Abstraction has 111 states and 187 transitions. [2022-03-20 23:53:45,389 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 23:53:45,389 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 187 transitions. [2022-03-20 23:53:45,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-20 23:53:45,390 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 23:53:45,390 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 23:53:45,390 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-20 23:53:45,391 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 23:53:45,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 23:53:45,391 INFO L85 PathProgramCache]: Analyzing trace with hash 131275990, now seen corresponding path program 1 times [2022-03-20 23:53:45,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:45,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [708883626] [2022-03-20 23:53:45,392 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 23:53:45,392 INFO L85 PathProgramCache]: Analyzing trace with hash 131275990, now seen corresponding path program 2 times [2022-03-20 23:53:45,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 23:53:45,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29512329] [2022-03-20 23:53:45,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 23:53:45,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 23:53:45,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:45,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 23:53:45,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:45,424 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 23:53:45,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 23:53:45,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29512329] [2022-03-20 23:53:45,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29512329] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:45,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:45,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:45,425 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 23:53:45,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [708883626] [2022-03-20 23:53:45,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [708883626] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:45,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:45,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:45,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060852818] [2022-03-20 23:53:45,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 23:53:45,426 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 23:53:45,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:45,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 23:53:45,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 23:53:45,426 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 23:53:45,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 23:53:45,498 INFO L93 Difference]: Finished difference Result 203 states and 347 transitions. [2022-03-20 23:53:45,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 23:53:45,499 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 23:53:45,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 23:53:45,500 INFO L225 Difference]: With dead ends: 203 [2022-03-20 23:53:45,500 INFO L226 Difference]: Without dead ends: 201 [2022-03-20 23:53:45,500 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 23:53:45,501 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 23:53:45,501 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 23:53:45,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-03-20 23:53:45,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 151. [2022-03-20 23:53:45,517 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 23:53:45,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 253 transitions. [2022-03-20 23:53:45,518 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 253 transitions. Word has length 21 [2022-03-20 23:53:45,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 23:53:45,518 INFO L478 AbstractCegarLoop]: Abstraction has 151 states and 253 transitions. [2022-03-20 23:53:45,519 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 23:53:45,519 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 253 transitions. [2022-03-20 23:53:45,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-20 23:53:45,520 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 23:53:45,520 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 23:53:45,520 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-20 23:53:45,520 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 23:53:45,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 23:53:45,520 INFO L85 PathProgramCache]: Analyzing trace with hash 832340568, now seen corresponding path program 1 times [2022-03-20 23:53:45,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:45,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1963974401] [2022-03-20 23:53:45,521 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 23:53:45,521 INFO L85 PathProgramCache]: Analyzing trace with hash 832340568, now seen corresponding path program 2 times [2022-03-20 23:53:45,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 23:53:45,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380263384] [2022-03-20 23:53:45,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 23:53:45,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 23:53:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:45,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 23:53:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:45,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 23:53:45,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 23:53:45,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380263384] [2022-03-20 23:53:45,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380263384] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:45,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:45,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:45,551 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 23:53:45,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1963974401] [2022-03-20 23:53:45,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1963974401] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:45,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:45,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:45,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991503371] [2022-03-20 23:53:45,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 23:53:45,552 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 23:53:45,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:45,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 23:53:45,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 23:53:45,552 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 23:53:45,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 23:53:45,628 INFO L93 Difference]: Finished difference Result 351 states and 595 transitions. [2022-03-20 23:53:45,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 23:53:45,628 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 23:53:45,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 23:53:45,630 INFO L225 Difference]: With dead ends: 351 [2022-03-20 23:53:45,630 INFO L226 Difference]: Without dead ends: 209 [2022-03-20 23:53:45,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 23:53:45,631 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.0s IncrementalHoareTripleChecker+Time [2022-03-20 23:53:45,631 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.0s Time] [2022-03-20 23:53:45,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-03-20 23:53:45,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2022-03-20 23:53:45,651 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 23:53:45,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 343 transitions. [2022-03-20 23:53:45,652 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 343 transitions. Word has length 21 [2022-03-20 23:53:45,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 23:53:45,653 INFO L478 AbstractCegarLoop]: Abstraction has 207 states and 343 transitions. [2022-03-20 23:53:45,653 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 23:53:45,653 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 343 transitions. [2022-03-20 23:53:45,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-20 23:53:45,654 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 23:53:45,654 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 23:53:45,654 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-20 23:53:45,654 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 23:53:45,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 23:53:45,655 INFO L85 PathProgramCache]: Analyzing trace with hash -225196893, now seen corresponding path program 1 times [2022-03-20 23:53:45,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:45,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [723064926] [2022-03-20 23:53:45,655 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 23:53:45,655 INFO L85 PathProgramCache]: Analyzing trace with hash -225196893, now seen corresponding path program 2 times [2022-03-20 23:53:45,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 23:53:45,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243983451] [2022-03-20 23:53:45,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 23:53:45,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 23:53:45,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:45,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 23:53:45,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:45,683 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 23:53:45,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 23:53:45,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243983451] [2022-03-20 23:53:45,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243983451] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:45,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:45,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:45,684 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 23:53:45,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [723064926] [2022-03-20 23:53:45,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [723064926] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:45,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:45,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:45,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118832228] [2022-03-20 23:53:45,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 23:53:45,685 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 23:53:45,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:45,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 23:53:45,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 23:53:45,686 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 23:53:45,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 23:53:45,761 INFO L93 Difference]: Finished difference Result 313 states and 517 transitions. [2022-03-20 23:53:45,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 23:53:45,761 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 23:53:45,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 23:53:45,762 INFO L225 Difference]: With dead ends: 313 [2022-03-20 23:53:45,763 INFO L226 Difference]: Without dead ends: 215 [2022-03-20 23:53:45,763 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 23:53:45,764 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 23:53:45,764 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 23:53:45,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-03-20 23:53:45,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2022-03-20 23:53:45,783 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 23:53:45,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 347 transitions. [2022-03-20 23:53:45,784 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 347 transitions. Word has length 22 [2022-03-20 23:53:45,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 23:53:45,784 INFO L478 AbstractCegarLoop]: Abstraction has 213 states and 347 transitions. [2022-03-20 23:53:45,784 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 23:53:45,784 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 347 transitions. [2022-03-20 23:53:45,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-20 23:53:45,785 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 23:53:45,785 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 23:53:45,785 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-20 23:53:45,785 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 23:53:45,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 23:53:45,786 INFO L85 PathProgramCache]: Analyzing trace with hash 32968545, now seen corresponding path program 1 times [2022-03-20 23:53:45,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:45,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [690555116] [2022-03-20 23:53:45,786 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 23:53:45,786 INFO L85 PathProgramCache]: Analyzing trace with hash 32968545, now seen corresponding path program 2 times [2022-03-20 23:53:45,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 23:53:45,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714889749] [2022-03-20 23:53:45,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 23:53:45,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 23:53:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:45,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 23:53:45,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:45,814 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 23:53:45,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 23:53:45,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714889749] [2022-03-20 23:53:45,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714889749] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:45,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:45,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:45,815 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 23:53:45,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [690555116] [2022-03-20 23:53:45,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [690555116] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:45,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:45,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:45,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556114041] [2022-03-20 23:53:45,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 23:53:45,815 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 23:53:45,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:45,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 23:53:45,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 23:53:45,816 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 23:53:45,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 23:53:45,916 INFO L93 Difference]: Finished difference Result 381 states and 629 transitions. [2022-03-20 23:53:45,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 23:53:45,917 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 23:53:45,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 23:53:45,918 INFO L225 Difference]: With dead ends: 381 [2022-03-20 23:53:45,919 INFO L226 Difference]: Without dead ends: 379 [2022-03-20 23:53:45,919 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 23:53:45,919 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 23:53:45,920 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 23:53:45,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-03-20 23:53:45,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 297. [2022-03-20 23:53:45,945 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 23:53:45,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 475 transitions. [2022-03-20 23:53:45,946 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 475 transitions. Word has length 22 [2022-03-20 23:53:45,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 23:53:45,946 INFO L478 AbstractCegarLoop]: Abstraction has 297 states and 475 transitions. [2022-03-20 23:53:45,946 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 23:53:45,946 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 475 transitions. [2022-03-20 23:53:45,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-20 23:53:45,947 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 23:53:45,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] [2022-03-20 23:53:45,947 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-20 23:53:45,947 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 23:53:45,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 23:53:45,948 INFO L85 PathProgramCache]: Analyzing trace with hash 734033123, now seen corresponding path program 1 times [2022-03-20 23:53:45,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:45,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [325406173] [2022-03-20 23:53:45,948 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 23:53:45,949 INFO L85 PathProgramCache]: Analyzing trace with hash 734033123, now seen corresponding path program 2 times [2022-03-20 23:53:45,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 23:53:45,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826956127] [2022-03-20 23:53:45,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 23:53:45,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 23:53:45,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:45,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 23:53:45,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:45,974 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 23:53:45,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 23:53:45,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826956127] [2022-03-20 23:53:45,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826956127] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:45,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:45,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:45,975 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 23:53:45,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [325406173] [2022-03-20 23:53:45,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [325406173] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:45,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:45,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:45,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291721883] [2022-03-20 23:53:45,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 23:53:45,976 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 23:53:45,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:45,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 23:53:45,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 23:53:45,977 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 23:53:46,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 23:53:46,078 INFO L93 Difference]: Finished difference Result 685 states and 1101 transitions. [2022-03-20 23:53:46,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 23:53:46,078 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 23:53:46,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 23:53:46,080 INFO L225 Difference]: With dead ends: 685 [2022-03-20 23:53:46,080 INFO L226 Difference]: Without dead ends: 403 [2022-03-20 23:53:46,081 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 23:53:46,082 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.1s IncrementalHoareTripleChecker+Time [2022-03-20 23:53:46,082 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.1s Time] [2022-03-20 23:53:46,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2022-03-20 23:53:46,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 401. [2022-03-20 23:53:46,117 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 23:53:46,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 631 transitions. [2022-03-20 23:53:46,119 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 631 transitions. Word has length 22 [2022-03-20 23:53:46,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 23:53:46,119 INFO L478 AbstractCegarLoop]: Abstraction has 401 states and 631 transitions. [2022-03-20 23:53:46,127 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 23:53:46,127 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 631 transitions. [2022-03-20 23:53:46,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-20 23:53:46,128 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 23:53:46,128 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 23:53:46,128 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-20 23:53:46,129 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 23:53:46,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 23:53:46,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1022239949, now seen corresponding path program 1 times [2022-03-20 23:53:46,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:46,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1084510328] [2022-03-20 23:53:46,130 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 23:53:46,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1022239949, now seen corresponding path program 2 times [2022-03-20 23:53:46,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 23:53:46,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907984980] [2022-03-20 23:53:46,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 23:53:46,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 23:53:46,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:46,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 23:53:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:46,154 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 23:53:46,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 23:53:46,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907984980] [2022-03-20 23:53:46,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907984980] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:46,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:46,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:46,155 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 23:53:46,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1084510328] [2022-03-20 23:53:46,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1084510328] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:46,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:46,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:46,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549560510] [2022-03-20 23:53:46,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 23:53:46,156 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 23:53:46,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:46,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 23:53:46,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 23:53:46,157 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 23:53:46,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 23:53:46,242 INFO L93 Difference]: Finished difference Result 601 states and 941 transitions. [2022-03-20 23:53:46,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 23:53:46,243 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 23:53:46,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 23:53:46,245 INFO L225 Difference]: With dead ends: 601 [2022-03-20 23:53:46,245 INFO L226 Difference]: Without dead ends: 411 [2022-03-20 23:53:46,246 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 23:53:46,247 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 23:53:46,247 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 23:53:46,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2022-03-20 23:53:46,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 409. [2022-03-20 23:53:46,284 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 23:53:46,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 631 transitions. [2022-03-20 23:53:46,285 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 631 transitions. Word has length 23 [2022-03-20 23:53:46,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 23:53:46,286 INFO L478 AbstractCegarLoop]: Abstraction has 409 states and 631 transitions. [2022-03-20 23:53:46,287 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 23:53:46,287 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 631 transitions. [2022-03-20 23:53:46,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-20 23:53:46,287 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 23:53:46,288 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 23:53:46,288 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-20 23:53:46,288 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 23:53:46,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 23:53:46,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1280405387, now seen corresponding path program 1 times [2022-03-20 23:53:46,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:46,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1229195471] [2022-03-20 23:53:46,289 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 23:53:46,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1280405387, now seen corresponding path program 2 times [2022-03-20 23:53:46,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 23:53:46,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12292866] [2022-03-20 23:53:46,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 23:53:46,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 23:53:46,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:46,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 23:53:46,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:46,339 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 23:53:46,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 23:53:46,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12292866] [2022-03-20 23:53:46,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12292866] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:46,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:46,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:46,340 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 23:53:46,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1229195471] [2022-03-20 23:53:46,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1229195471] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:46,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:46,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:46,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920529772] [2022-03-20 23:53:46,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 23:53:46,341 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 23:53:46,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:46,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 23:53:46,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 23:53:46,342 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 23:53:46,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 23:53:46,469 INFO L93 Difference]: Finished difference Result 717 states and 1121 transitions. [2022-03-20 23:53:46,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 23:53:46,470 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 23:53:46,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 23:53:46,473 INFO L225 Difference]: With dead ends: 717 [2022-03-20 23:53:46,473 INFO L226 Difference]: Without dead ends: 715 [2022-03-20 23:53:46,473 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 23:53:46,474 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 23:53:46,474 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 23:53:46,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2022-03-20 23:53:46,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 585. [2022-03-20 23:53:46,527 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 23:53:46,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 879 transitions. [2022-03-20 23:53:46,529 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 879 transitions. Word has length 23 [2022-03-20 23:53:46,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 23:53:46,529 INFO L478 AbstractCegarLoop]: Abstraction has 585 states and 879 transitions. [2022-03-20 23:53:46,530 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 23:53:46,530 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 879 transitions. [2022-03-20 23:53:46,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-20 23:53:46,531 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 23:53:46,531 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 23:53:46,531 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-20 23:53:46,531 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 23:53:46,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 23:53:46,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1981469965, now seen corresponding path program 1 times [2022-03-20 23:53:46,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:46,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1800600964] [2022-03-20 23:53:46,532 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 23:53:46,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1981469965, now seen corresponding path program 2 times [2022-03-20 23:53:46,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 23:53:46,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124893894] [2022-03-20 23:53:46,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 23:53:46,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 23:53:46,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:46,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 23:53:46,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:46,558 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 23:53:46,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 23:53:46,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124893894] [2022-03-20 23:53:46,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124893894] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:46,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:46,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:46,559 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 23:53:46,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1800600964] [2022-03-20 23:53:46,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1800600964] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:46,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:46,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:46,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292463697] [2022-03-20 23:53:46,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 23:53:46,559 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 23:53:46,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:46,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 23:53:46,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 23:53:46,560 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 23:53:46,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 23:53:46,694 INFO L93 Difference]: Finished difference Result 1341 states and 2017 transitions. [2022-03-20 23:53:46,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 23:53:46,694 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 23:53:46,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 23:53:46,698 INFO L225 Difference]: With dead ends: 1341 [2022-03-20 23:53:46,698 INFO L226 Difference]: Without dead ends: 779 [2022-03-20 23:53:46,699 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 23:53:46,699 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 23:53:46,700 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 23:53:46,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2022-03-20 23:53:46,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 777. [2022-03-20 23:53:46,785 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 23:53:46,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1143 transitions. [2022-03-20 23:53:46,788 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1143 transitions. Word has length 23 [2022-03-20 23:53:46,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 23:53:46,788 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 1143 transitions. [2022-03-20 23:53:46,788 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 23:53:46,788 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1143 transitions. [2022-03-20 23:53:46,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-20 23:53:46,790 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 23:53:46,790 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 23:53:46,790 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-20 23:53:46,790 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 23:53:46,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 23:53:46,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1038076728, now seen corresponding path program 1 times [2022-03-20 23:53:46,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:46,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1614244097] [2022-03-20 23:53:46,791 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 23:53:46,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1038076728, now seen corresponding path program 2 times [2022-03-20 23:53:46,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 23:53:46,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475693065] [2022-03-20 23:53:46,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 23:53:46,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 23:53:46,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:46,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 23:53:46,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:46,823 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 23:53:46,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 23:53:46,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475693065] [2022-03-20 23:53:46,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475693065] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:46,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:46,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:46,824 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 23:53:46,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1614244097] [2022-03-20 23:53:46,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1614244097] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:46,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:46,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:46,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392712585] [2022-03-20 23:53:46,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 23:53:46,825 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 23:53:46,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:46,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 23:53:46,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 23:53:46,826 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 23:53:46,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 23:53:46,966 INFO L93 Difference]: Finished difference Result 1165 states and 1705 transitions. [2022-03-20 23:53:46,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 23:53:46,966 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 23:53:46,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 23:53:46,969 INFO L225 Difference]: With dead ends: 1165 [2022-03-20 23:53:46,969 INFO L226 Difference]: Without dead ends: 795 [2022-03-20 23:53:46,970 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 23:53:46,971 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 23:53:46,971 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 23:53:46,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2022-03-20 23:53:47,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 793. [2022-03-20 23:53:47,031 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 23:53:47,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1143 transitions. [2022-03-20 23:53:47,034 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1143 transitions. Word has length 24 [2022-03-20 23:53:47,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 23:53:47,034 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 1143 transitions. [2022-03-20 23:53:47,034 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 23:53:47,034 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1143 transitions. [2022-03-20 23:53:47,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-20 23:53:47,035 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 23:53:47,035 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 23:53:47,036 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-20 23:53:47,036 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 23:53:47,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 23:53:47,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1296242166, now seen corresponding path program 1 times [2022-03-20 23:53:47,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:47,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1888272277] [2022-03-20 23:53:47,037 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 23:53:47,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1296242166, now seen corresponding path program 2 times [2022-03-20 23:53:47,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 23:53:47,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67490639] [2022-03-20 23:53:47,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 23:53:47,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 23:53:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:47,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 23:53:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:47,059 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 23:53:47,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 23:53:47,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67490639] [2022-03-20 23:53:47,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67490639] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:47,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:47,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:47,060 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 23:53:47,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1888272277] [2022-03-20 23:53:47,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1888272277] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:47,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:47,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:47,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878670739] [2022-03-20 23:53:47,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 23:53:47,061 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 23:53:47,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:47,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 23:53:47,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 23:53:47,061 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 23:53:47,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 23:53:47,242 INFO L93 Difference]: Finished difference Result 1357 states and 1977 transitions. [2022-03-20 23:53:47,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 23:53:47,242 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 23:53:47,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 23:53:47,248 INFO L225 Difference]: With dead ends: 1357 [2022-03-20 23:53:47,248 INFO L226 Difference]: Without dead ends: 1355 [2022-03-20 23:53:47,248 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 23:53:47,249 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 23:53:47,249 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 23:53:47,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2022-03-20 23:53:47,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1161. [2022-03-20 23:53:47,348 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 23:53:47,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1623 transitions. [2022-03-20 23:53:47,352 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1623 transitions. Word has length 24 [2022-03-20 23:53:47,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 23:53:47,352 INFO L478 AbstractCegarLoop]: Abstraction has 1161 states and 1623 transitions. [2022-03-20 23:53:47,352 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 23:53:47,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1623 transitions. [2022-03-20 23:53:47,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-20 23:53:47,354 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 23:53:47,355 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 23:53:47,355 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-20 23:53:47,355 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 23:53:47,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 23:53:47,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1997306744, now seen corresponding path program 1 times [2022-03-20 23:53:47,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:47,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [776769351] [2022-03-20 23:53:47,358 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 23:53:47,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1997306744, now seen corresponding path program 2 times [2022-03-20 23:53:47,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 23:53:47,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737933938] [2022-03-20 23:53:47,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 23:53:47,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 23:53:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:47,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 23:53:47,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:47,382 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 23:53:47,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 23:53:47,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737933938] [2022-03-20 23:53:47,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737933938] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:47,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:47,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:47,383 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 23:53:47,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [776769351] [2022-03-20 23:53:47,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [776769351] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:47,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:47,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:47,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200896856] [2022-03-20 23:53:47,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 23:53:47,383 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 23:53:47,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:47,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 23:53:47,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 23:53:47,384 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 23:53:47,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 23:53:47,573 INFO L93 Difference]: Finished difference Result 2637 states and 3673 transitions. [2022-03-20 23:53:47,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 23:53:47,574 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 23:53:47,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 23:53:47,579 INFO L225 Difference]: With dead ends: 2637 [2022-03-20 23:53:47,580 INFO L226 Difference]: Without dead ends: 1515 [2022-03-20 23:53:47,582 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 23:53:47,583 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 23:53:47,583 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 23:53:47,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2022-03-20 23:53:47,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1513. [2022-03-20 23:53:47,699 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 23:53:47,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2055 transitions. [2022-03-20 23:53:47,705 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2055 transitions. Word has length 24 [2022-03-20 23:53:47,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 23:53:47,705 INFO L478 AbstractCegarLoop]: Abstraction has 1513 states and 2055 transitions. [2022-03-20 23:53:47,705 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 23:53:47,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2055 transitions. [2022-03-20 23:53:47,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-20 23:53:47,707 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 23:53:47,707 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 23:53:47,708 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-20 23:53:47,708 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 23:53:47,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 23:53:47,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1529017218, now seen corresponding path program 1 times [2022-03-20 23:53:47,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:47,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [884606143] [2022-03-20 23:53:47,709 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 23:53:47,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1529017218, now seen corresponding path program 2 times [2022-03-20 23:53:47,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 23:53:47,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434145510] [2022-03-20 23:53:47,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 23:53:47,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 23:53:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:47,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 23:53:47,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:47,732 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 23:53:47,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 23:53:47,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434145510] [2022-03-20 23:53:47,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434145510] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:47,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:47,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:47,733 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 23:53:47,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [884606143] [2022-03-20 23:53:47,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [884606143] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:47,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:47,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:47,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999977166] [2022-03-20 23:53:47,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 23:53:47,733 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 23:53:47,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:47,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 23:53:47,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 23:53:47,734 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 23:53:47,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 23:53:47,937 INFO L93 Difference]: Finished difference Result 2269 states and 3065 transitions. [2022-03-20 23:53:47,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 23:53:47,937 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 23:53:47,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 23:53:47,942 INFO L225 Difference]: With dead ends: 2269 [2022-03-20 23:53:47,942 INFO L226 Difference]: Without dead ends: 1547 [2022-03-20 23:53:47,944 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 23:53:47,945 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.1s IncrementalHoareTripleChecker+Time [2022-03-20 23:53:47,945 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.1s Time] [2022-03-20 23:53:47,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2022-03-20 23:53:48,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1545. [2022-03-20 23:53:48,070 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 23:53:48,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2055 transitions. [2022-03-20 23:53:48,075 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2055 transitions. Word has length 25 [2022-03-20 23:53:48,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 23:53:48,075 INFO L478 AbstractCegarLoop]: Abstraction has 1545 states and 2055 transitions. [2022-03-20 23:53:48,076 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 23:53:48,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2055 transitions. [2022-03-20 23:53:48,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-20 23:53:48,078 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 23:53:48,078 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 23:53:48,078 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-20 23:53:48,078 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 23:53:48,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 23:53:48,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1787182656, now seen corresponding path program 1 times [2022-03-20 23:53:48,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:48,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [146764274] [2022-03-20 23:53:48,079 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 23:53:48,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1787182656, now seen corresponding path program 2 times [2022-03-20 23:53:48,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 23:53:48,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527753415] [2022-03-20 23:53:48,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 23:53:48,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 23:53:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:48,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 23:53:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:48,102 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 23:53:48,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 23:53:48,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527753415] [2022-03-20 23:53:48,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527753415] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:48,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:48,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:48,103 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 23:53:48,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [146764274] [2022-03-20 23:53:48,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [146764274] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:48,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:48,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:48,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647325947] [2022-03-20 23:53:48,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 23:53:48,103 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 23:53:48,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:48,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 23:53:48,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 23:53:48,104 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 23:53:48,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 23:53:48,395 INFO L93 Difference]: Finished difference Result 2573 states and 3433 transitions. [2022-03-20 23:53:48,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 23:53:48,395 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 23:53:48,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 23:53:48,404 INFO L225 Difference]: With dead ends: 2573 [2022-03-20 23:53:48,404 INFO L226 Difference]: Without dead ends: 2571 [2022-03-20 23:53:48,405 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 23:53:48,406 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 23:53:48,406 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 23:53:48,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2022-03-20 23:53:48,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2313. [2022-03-20 23:53:48,659 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 23:53:48,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 2983 transitions. [2022-03-20 23:53:48,666 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 2983 transitions. Word has length 25 [2022-03-20 23:53:48,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 23:53:48,666 INFO L478 AbstractCegarLoop]: Abstraction has 2313 states and 2983 transitions. [2022-03-20 23:53:48,666 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 23:53:48,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 2983 transitions. [2022-03-20 23:53:48,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-20 23:53:48,670 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 23:53:48,670 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 23:53:48,670 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-20 23:53:48,670 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 23:53:48,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 23:53:48,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1806720062, now seen corresponding path program 1 times [2022-03-20 23:53:48,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:48,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1554339892] [2022-03-20 23:53:48,671 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 23:53:48,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1806720062, now seen corresponding path program 2 times [2022-03-20 23:53:48,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 23:53:48,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945986342] [2022-03-20 23:53:48,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 23:53:48,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 23:53:48,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:48,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 23:53:48,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:48,698 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 23:53:48,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 23:53:48,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945986342] [2022-03-20 23:53:48,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945986342] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:48,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:48,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:48,701 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 23:53:48,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1554339892] [2022-03-20 23:53:48,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1554339892] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:48,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:48,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:48,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520241954] [2022-03-20 23:53:48,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 23:53:48,702 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 23:53:48,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:48,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 23:53:48,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 23:53:48,702 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 23:53:49,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 23:53:49,026 INFO L93 Difference]: Finished difference Result 5197 states and 6633 transitions. [2022-03-20 23:53:49,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 23:53:49,026 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 23:53:49,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 23:53:49,037 INFO L225 Difference]: With dead ends: 5197 [2022-03-20 23:53:49,037 INFO L226 Difference]: Without dead ends: 2955 [2022-03-20 23:53:49,041 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 23:53:49,042 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 23:53:49,043 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 23:53:49,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2022-03-20 23:53:49,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2953. [2022-03-20 23:53:49,330 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 23:53:49,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2953 states and 3655 transitions. [2022-03-20 23:53:49,336 INFO L78 Accepts]: Start accepts. Automaton has 2953 states and 3655 transitions. Word has length 25 [2022-03-20 23:53:49,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 23:53:49,336 INFO L478 AbstractCegarLoop]: Abstraction has 2953 states and 3655 transitions. [2022-03-20 23:53:49,336 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 23:53:49,336 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 3655 transitions. [2022-03-20 23:53:49,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-20 23:53:49,340 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 23:53:49,340 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 23:53:49,340 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-03-20 23:53:49,340 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 23:53:49,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 23:53:49,341 INFO L85 PathProgramCache]: Analyzing trace with hash -431696435, now seen corresponding path program 1 times [2022-03-20 23:53:49,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:49,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1758604997] [2022-03-20 23:53:49,341 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 23:53:49,341 INFO L85 PathProgramCache]: Analyzing trace with hash -431696435, now seen corresponding path program 2 times [2022-03-20 23:53:49,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 23:53:49,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254846604] [2022-03-20 23:53:49,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 23:53:49,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 23:53:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:49,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 23:53:49,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:49,362 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 23:53:49,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 23:53:49,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254846604] [2022-03-20 23:53:49,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254846604] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:49,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:49,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:49,363 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 23:53:49,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1758604997] [2022-03-20 23:53:49,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1758604997] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:49,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:49,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:49,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193608680] [2022-03-20 23:53:49,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 23:53:49,363 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 23:53:49,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:49,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 23:53:49,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 23:53:49,364 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 23:53:49,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 23:53:49,674 INFO L93 Difference]: Finished difference Result 4429 states and 5449 transitions. [2022-03-20 23:53:49,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 23:53:49,674 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 23:53:49,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 23:53:49,684 INFO L225 Difference]: With dead ends: 4429 [2022-03-20 23:53:49,684 INFO L226 Difference]: Without dead ends: 3019 [2022-03-20 23:53:49,688 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 23:53:49,689 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 23:53:49,690 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 23:53:49,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3019 states. [2022-03-20 23:53:49,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3019 to 3017. [2022-03-20 23:53:49,941 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 23:53:49,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3017 states to 3017 states and 3655 transitions. [2022-03-20 23:53:49,946 INFO L78 Accepts]: Start accepts. Automaton has 3017 states and 3655 transitions. Word has length 26 [2022-03-20 23:53:49,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 23:53:49,947 INFO L478 AbstractCegarLoop]: Abstraction has 3017 states and 3655 transitions. [2022-03-20 23:53:49,947 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 23:53:49,947 INFO L276 IsEmpty]: Start isEmpty. Operand 3017 states and 3655 transitions. [2022-03-20 23:53:49,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-20 23:53:49,950 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 23:53:49,950 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 23:53:49,951 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-03-20 23:53:49,951 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 23:53:49,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 23:53:49,951 INFO L85 PathProgramCache]: Analyzing trace with hash -173530997, now seen corresponding path program 1 times [2022-03-20 23:53:49,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:49,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [598224373] [2022-03-20 23:53:49,952 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 23:53:49,952 INFO L85 PathProgramCache]: Analyzing trace with hash -173530997, now seen corresponding path program 2 times [2022-03-20 23:53:49,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 23:53:49,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798216327] [2022-03-20 23:53:49,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 23:53:49,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 23:53:49,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:49,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 23:53:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:49,983 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 23:53:49,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 23:53:49,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798216327] [2022-03-20 23:53:49,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798216327] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:49,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:49,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:49,984 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 23:53:49,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [598224373] [2022-03-20 23:53:49,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [598224373] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:49,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:49,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:49,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712983481] [2022-03-20 23:53:49,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 23:53:49,985 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 23:53:49,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:49,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 23:53:49,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 23:53:49,986 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 23:53:50,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 23:53:50,480 INFO L93 Difference]: Finished difference Result 4875 states and 5832 transitions. [2022-03-20 23:53:50,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 23:53:50,480 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 23:53:50,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 23:53:50,496 INFO L225 Difference]: With dead ends: 4875 [2022-03-20 23:53:50,496 INFO L226 Difference]: Without dead ends: 4873 [2022-03-20 23:53:50,498 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 23:53:50,498 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 23:53:50,498 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 23:53:50,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4873 states. [2022-03-20 23:53:50,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4873 to 4617. [2022-03-20 23:53:50,957 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 23:53:50,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4617 states to 4617 states and 5447 transitions. [2022-03-20 23:53:50,965 INFO L78 Accepts]: Start accepts. Automaton has 4617 states and 5447 transitions. Word has length 26 [2022-03-20 23:53:50,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 23:53:50,965 INFO L478 AbstractCegarLoop]: Abstraction has 4617 states and 5447 transitions. [2022-03-20 23:53:50,965 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 23:53:50,966 INFO L276 IsEmpty]: Start isEmpty. Operand 4617 states and 5447 transitions. [2022-03-20 23:53:50,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-03-20 23:53:50,972 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 23:53:50,972 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 23:53:50,972 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-03-20 23:53:50,973 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 23:53:50,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 23:53:50,973 INFO L85 PathProgramCache]: Analyzing trace with hash 527533581, now seen corresponding path program 1 times [2022-03-20 23:53:50,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:50,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [455314386] [2022-03-20 23:53:50,974 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 23:53:50,974 INFO L85 PathProgramCache]: Analyzing trace with hash 527533581, now seen corresponding path program 2 times [2022-03-20 23:53:50,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 23:53:50,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878365645] [2022-03-20 23:53:50,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 23:53:50,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 23:53:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:50,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 23:53:50,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 23:53:50,995 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 23:53:50,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 23:53:50,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878365645] [2022-03-20 23:53:50,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878365645] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:50,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:50,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:50,996 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 23:53:50,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [455314386] [2022-03-20 23:53:50,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [455314386] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 23:53:50,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 23:53:50,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-20 23:53:50,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489354185] [2022-03-20 23:53:50,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 23:53:50,997 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-20 23:53:50,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 23:53:50,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-20 23:53:50,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-20 23:53:50,997 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 23:53:51,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 23:53:51,478 INFO L93 Difference]: Finished difference Result 10249 states and 11847 transitions. [2022-03-20 23:53:51,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-20 23:53:51,478 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 23:53:51,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 23:53:51,479 INFO L225 Difference]: With dead ends: 10249 [2022-03-20 23:53:51,479 INFO L226 Difference]: Without dead ends: 0 [2022-03-20 23:53:51,496 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 23:53:51,497 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 23:53:51,497 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 23:53:51,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-20 23:53:51,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-20 23:53:51,498 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 23:53:51,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-20 23:53:51,498 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2022-03-20 23:53:51,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 23:53:51,498 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-20 23:53:51,498 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 23:53:51,498 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-20 23:53:51,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-20 23:53:51,501 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-20 23:53:51,501 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-03-20 23:53:51,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-03-20 23:54:02,411 WARN L232 SmtUtils]: Spent 6.22s 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 23:54:10,440 WARN L232 SmtUtils]: Spent 8.02s 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 23:54:26,054 WARN L232 SmtUtils]: Spent 8.00s 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 23:55:16,408 WARN L232 SmtUtils]: Spent 10.08s 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 23:55:45,764 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-03-20 23:55:45,765 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-03-20 23:55:45,765 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-03-20 23:55:45,765 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-03-20 23:55:45,765 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 23:55:45,765 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-03-20 23:55:45,765 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-03-20 23:55:45,765 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-03-20 23:55:45,765 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-03-20 23:55:45,765 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-03-20 23:55:45,766 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 23:55:45,766 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 6 137) the Hoare annotation is: true [2022-03-20 23:55:45,766 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 23:55:45,767 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 23:55:45,767 INFO L885 garLoopResultBuilder]: At program point L127-1(lines 35 132) the Hoare annotation is: true [2022-03-20 23:55:45,768 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 23:55:45,768 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 23:55:45,768 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 23:55:45,768 INFO L885 garLoopResultBuilder]: At program point L37(lines 37 39) the Hoare annotation is: true [2022-03-20 23:55:45,768 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 23:55:45,769 INFO L878 garLoopResultBuilder]: At program point L128(line 128) the Hoare annotation is: (= main_~lk8~0 1) [2022-03-20 23:55:45,769 INFO L878 garLoopResultBuilder]: At program point L128-1(lines 7 137) the Hoare annotation is: false [2022-03-20 23:55:45,769 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 23:55:45,769 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 23:55:45,769 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 6 137) the Hoare annotation is: true [2022-03-20 23:55:45,769 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 135) the Hoare annotation is: false [2022-03-20 23:55:45,769 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 6 137) the Hoare annotation is: true [2022-03-20 23:55:45,769 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 23:55:45,770 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 23:55:45,770 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 23:55:45,770 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 23:55:45,770 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 23:55:45,771 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 23:55:45,771 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 23:55:45,771 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 23:55:45,771 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 23:55:45,771 INFO L885 garLoopResultBuilder]: At program point L58(lines 58 60) the Hoare annotation is: true [2022-03-20 23:55:45,771 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 23:55:45,772 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 23:55:45,772 INFO L885 garLoopResultBuilder]: At program point L133(lines 7 137) the Hoare annotation is: true [2022-03-20 23:55:45,772 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 23:55:45,772 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 23:55:45,775 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 23:55:45,776 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-20 23:55:45,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 11:55:45 BoogieIcfgContainer [2022-03-20 23:55:45,784 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-20 23:55:45,784 INFO L158 Benchmark]: Toolchain (without parser) took 122481.02ms. Allocated memory was 189.8MB in the beginning and 897.6MB in the end (delta: 707.8MB). Free memory was 139.9MB in the beginning and 639.4MB in the end (delta: -499.5MB). Peak memory consumption was 534.3MB. Max. memory is 8.0GB. [2022-03-20 23:55:45,784 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 189.8MB. Free memory was 156.2MB in the beginning and 156.1MB in the end (delta: 72.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-20 23:55:45,784 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.40ms. Allocated memory is still 189.8MB. Free memory was 139.6MB in the beginning and 166.0MB in the end (delta: -26.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-03-20 23:55:45,785 INFO L158 Benchmark]: Boogie Preprocessor took 33.08ms. Allocated memory is still 189.8MB. Free memory was 166.0MB in the beginning and 164.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-20 23:55:45,785 INFO L158 Benchmark]: RCFGBuilder took 275.52ms. Allocated memory is still 189.8MB. Free memory was 164.2MB in the beginning and 152.6MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-03-20 23:55:45,785 INFO L158 Benchmark]: TraceAbstraction took 121885.56ms. Allocated memory was 189.8MB in the beginning and 897.6MB in the end (delta: 707.8MB). Free memory was 152.1MB in the beginning and 639.4MB in the end (delta: -487.3MB). Peak memory consumption was 546.1MB. Max. memory is 8.0GB. [2022-03-20 23:55:45,786 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.15ms. Allocated memory is still 189.8MB. Free memory was 156.2MB in the beginning and 156.1MB in the end (delta: 72.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 281.40ms. Allocated memory is still 189.8MB. Free memory was 139.6MB in the beginning and 166.0MB in the end (delta: -26.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.08ms. Allocated memory is still 189.8MB. Free memory was 166.0MB in the beginning and 164.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 275.52ms. Allocated memory is still 189.8MB. Free memory was 164.2MB in the beginning and 152.6MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 121885.56ms. Allocated memory was 189.8MB in the beginning and 897.6MB in the end (delta: 707.8MB). Free memory was 152.1MB in the beginning and 639.4MB in the end (delta: -487.3MB). Peak memory consumption was 546.1MB. 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: 121.8s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 114.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2238 SdHoareTripleChecker+Valid, 1.1s 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.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 1044 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 39 PreInvPairs, 5808 NumberOfFragments, 22569 HoareAnnotationTreeSize, 39 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 54.9s HoareSimplificationTime, 39 FomulaSimplificationsInter, 565747 FormulaSimplificationTreeSizeReductionInter, 59.3s 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 23:55:45,818 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...