/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_7.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7968f31 [2022-03-18 05:40:44,286 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-18 05:40:44,288 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-18 05:40:44,314 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-18 05:40:44,314 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-18 05:40:44,316 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-18 05:40:44,322 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-18 05:40:44,327 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-18 05:40:44,328 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-18 05:40:44,333 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-18 05:40:44,334 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-18 05:40:44,335 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-18 05:40:44,335 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-18 05:40:44,339 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-18 05:40:44,339 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-18 05:40:44,340 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-18 05:40:44,340 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-18 05:40:44,341 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-18 05:40:44,342 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-18 05:40:44,343 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-18 05:40:44,343 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-18 05:40:44,348 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-18 05:40:44,349 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-18 05:40:44,349 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-18 05:40:44,351 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-18 05:40:44,357 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-18 05:40:44,357 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-18 05:40:44,358 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-18 05:40:44,358 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-18 05:40:44,358 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-18 05:40:44,359 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-18 05:40:44,359 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-18 05:40:44,359 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-18 05:40:44,360 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-18 05:40:44,360 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-18 05:40:44,361 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-18 05:40:44,361 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-18 05:40:44,361 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-18 05:40:44,361 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-18 05:40:44,362 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-18 05:40:44,362 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-18 05:40:44,367 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-18 05:40:44,368 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-03-18 05:40:44,378 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-18 05:40:44,378 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-18 05:40:44,380 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-18 05:40:44,380 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-18 05:40:44,380 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-18 05:40:44,380 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-18 05:40:44,380 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-18 05:40:44,380 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-18 05:40:44,380 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-18 05:40:44,381 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-18 05:40:44,381 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-18 05:40:44,381 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-18 05:40:44,381 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-18 05:40:44,381 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-18 05:40:44,382 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-18 05:40:44,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-18 05:40:44,382 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-18 05:40:44,382 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-18 05:40:44,382 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-03-18 05:40:44,382 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-03-18 05:40:44,382 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-18 05:40:44,382 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-03-18 05:40:44,382 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-18 05:40:44,561 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-18 05:40:44,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-18 05:40:44,578 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-18 05:40:44,579 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-18 05:40:44,580 INFO L275 PluginConnector]: CDTParser initialized [2022-03-18 05:40:44,580 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_7.c [2022-03-18 05:40:44,637 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6972d53f1/180f9d90a02b41b88c7c38e4cb63843e/FLAG45abd2931 [2022-03-18 05:40:45,007 INFO L306 CDTParser]: Found 1 translation units. [2022-03-18 05:40:45,007 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c [2022-03-18 05:40:45,015 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6972d53f1/180f9d90a02b41b88c7c38e4cb63843e/FLAG45abd2931 [2022-03-18 05:40:45,023 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6972d53f1/180f9d90a02b41b88c7c38e4cb63843e [2022-03-18 05:40:45,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-18 05:40:45,026 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-18 05:40:45,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-18 05:40:45,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-18 05:40:45,032 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-18 05:40:45,033 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.03 05:40:45" (1/1) ... [2022-03-18 05:40:45,034 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1019c6f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 05:40:45, skipping insertion in model container [2022-03-18 05:40:45,034 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.03 05:40:45" (1/1) ... [2022-03-18 05:40:45,039 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-18 05:40:45,058 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-18 05:40:45,182 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_7.c[2881,2894] [2022-03-18 05:40:45,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-18 05:40:45,189 INFO L203 MainTranslator]: Completed pre-run [2022-03-18 05:40:45,201 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_7.c[2881,2894] [2022-03-18 05:40:45,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-18 05:40:45,211 INFO L208 MainTranslator]: Completed translation [2022-03-18 05:40:45,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 05:40:45 WrapperNode [2022-03-18 05:40:45,212 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-18 05:40:45,213 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-18 05:40:45,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-18 05:40:45,213 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-18 05:40:45,220 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 05:40:45" (1/1) ... [2022-03-18 05:40:45,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 05:40:45" (1/1) ... [2022-03-18 05:40:45,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 05:40:45" (1/1) ... [2022-03-18 05:40:45,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 05:40:45" (1/1) ... [2022-03-18 05:40:45,236 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 05:40:45" (1/1) ... [2022-03-18 05:40:45,244 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 05:40:45" (1/1) ... [2022-03-18 05:40:45,248 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 05:40:45" (1/1) ... [2022-03-18 05:40:45,250 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-18 05:40:45,250 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-18 05:40:45,250 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-18 05:40:45,250 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-18 05:40:45,252 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 05:40:45" (1/1) ... [2022-03-18 05:40:45,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-18 05:40:45,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-18 05:40:45,298 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-18 05:40:45,316 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-18 05:40:45,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-18 05:40:45,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-18 05:40:45,333 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-18 05:40:45,333 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-18 05:40:45,334 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-18 05:40:45,334 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-18 05:40:45,334 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-18 05:40:45,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-18 05:40:45,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-18 05:40:45,334 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-18 05:40:45,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-18 05:40:45,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-18 05:40:45,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-18 05:40:45,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-18 05:40:45,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-18 05:40:45,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-18 05:40:45,406 INFO L234 CfgBuilder]: Building ICFG [2022-03-18 05:40:45,407 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-18 05:40:45,534 INFO L275 CfgBuilder]: Performing block encoding [2022-03-18 05:40:45,539 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-18 05:40:45,539 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-18 05:40:45,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.03 05:40:45 BoogieIcfgContainer [2022-03-18 05:40:45,541 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-18 05:40:45,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-18 05:40:45,542 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-18 05:40:45,544 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-18 05:40:45,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.03 05:40:45" (1/3) ... [2022-03-18 05:40:45,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a1480f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.03 05:40:45, skipping insertion in model container [2022-03-18 05:40:45,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.03 05:40:45" (2/3) ... [2022-03-18 05:40:45,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a1480f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.03 05:40:45, skipping insertion in model container [2022-03-18 05:40:45,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.03 05:40:45" (3/3) ... [2022-03-18 05:40:45,546 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2022-03-18 05:40:45,549 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-18 05:40:45,550 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-18 05:40:45,577 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-18 05:40:45,587 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-18 05:40:45,588 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-18 05:40:45,599 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 31 states have internal predecessors, (55), 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-18 05:40:45,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-18 05:40:45,606 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:45,606 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 05:40:45,607 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:45,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:45,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1576798563, now seen corresponding path program 1 times [2022-03-18 05:40:45,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:45,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1548860639] [2022-03-18 05:40:45,673 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:45,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1576798563, now seen corresponding path program 2 times [2022-03-18 05:40:45,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:45,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140784078] [2022-03-18 05:40:45,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:45,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:45,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:45,884 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-18 05:40:45,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:45,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140784078] [2022-03-18 05:40:45,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140784078] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:45,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:45,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:45,887 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:45,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1548860639] [2022-03-18 05:40:45,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1548860639] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:45,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:45,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:45,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998099424] [2022-03-18 05:40:45,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:45,893 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:45,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:45,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:45,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:45,919 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 31 states have internal predecessors, (55), 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 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-18 05:40:46,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:46,076 INFO L93 Difference]: Finished difference Result 70 states and 115 transitions. [2022-03-18 05:40:46,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:46,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 18 [2022-03-18 05:40:46,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:46,093 INFO L225 Difference]: With dead ends: 70 [2022-03-18 05:40:46,093 INFO L226 Difference]: Without dead ends: 55 [2022-03-18 05:40:46,095 INFO L911 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-18 05:40:46,097 INFO L912 BasicCegarLoop]: 62 mSDtfsCounter, 123 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-18 05:40:46,098 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 71 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-18 05:40:46,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-03-18 05:40:46,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2022-03-18 05:40:46,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 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-18 05:40:46,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 66 transitions. [2022-03-18 05:40:46,138 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 66 transitions. Word has length 18 [2022-03-18 05:40:46,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:46,139 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 66 transitions. [2022-03-18 05:40:46,139 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-18 05:40:46,139 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 66 transitions. [2022-03-18 05:40:46,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-18 05:40:46,140 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:46,140 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 05:40:46,140 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-18 05:40:46,140 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:46,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:46,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1969825573, now seen corresponding path program 1 times [2022-03-18 05:40:46,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:46,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1993816303] [2022-03-18 05:40:46,143 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:46,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1969825573, now seen corresponding path program 2 times [2022-03-18 05:40:46,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:46,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642722964] [2022-03-18 05:40:46,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:46,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:46,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:46,194 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-18 05:40:46,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:46,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642722964] [2022-03-18 05:40:46,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642722964] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:46,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:46,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:46,195 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:46,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1993816303] [2022-03-18 05:40:46,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1993816303] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:46,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:46,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:46,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394928204] [2022-03-18 05:40:46,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:46,196 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:46,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:46,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:46,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:46,197 INFO L87 Difference]: Start difference. First operand 39 states and 66 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-18 05:40:46,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:46,280 INFO L93 Difference]: Finished difference Result 88 states and 153 transitions. [2022-03-18 05:40:46,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:46,281 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 18 [2022-03-18 05:40:46,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:46,283 INFO L225 Difference]: With dead ends: 88 [2022-03-18 05:40:46,283 INFO L226 Difference]: Without dead ends: 55 [2022-03-18 05:40:46,283 INFO L911 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-18 05:40:46,284 INFO L912 BasicCegarLoop]: 64 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 71 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.1s IncrementalHoareTripleChecker+Time [2022-03-18 05:40:46,284 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 71 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-18 05:40:46,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-03-18 05:40:46,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2022-03-18 05:40:46,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 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-18 05:40:46,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 90 transitions. [2022-03-18 05:40:46,298 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 90 transitions. Word has length 18 [2022-03-18 05:40:46,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:46,301 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 90 transitions. [2022-03-18 05:40:46,301 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-18 05:40:46,301 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 90 transitions. [2022-03-18 05:40:46,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-18 05:40:46,302 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:46,302 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 05:40:46,302 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-18 05:40:46,302 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:46,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:46,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1635900842, now seen corresponding path program 1 times [2022-03-18 05:40:46,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:46,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [678875875] [2022-03-18 05:40:46,303 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:46,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1635900842, now seen corresponding path program 2 times [2022-03-18 05:40:46,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:46,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033129047] [2022-03-18 05:40:46,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:46,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:46,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:46,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:46,372 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-18 05:40:46,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:46,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033129047] [2022-03-18 05:40:46,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033129047] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:46,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:46,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:46,373 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:46,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [678875875] [2022-03-18 05:40:46,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [678875875] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:46,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:46,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:46,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837642678] [2022-03-18 05:40:46,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:46,374 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:46,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:46,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:46,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:46,375 INFO L87 Difference]: Start difference. First operand 53 states and 90 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-18 05:40:46,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:46,441 INFO L93 Difference]: Finished difference Result 82 states and 136 transitions. [2022-03-18 05:40:46,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:46,442 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-18 05:40:46,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:46,443 INFO L225 Difference]: With dead ends: 82 [2022-03-18 05:40:46,443 INFO L226 Difference]: Without dead ends: 58 [2022-03-18 05:40:46,444 INFO L911 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-18 05:40:46,444 INFO L912 BasicCegarLoop]: 76 mSDtfsCounter, 92 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 83 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-18 05:40:46,445 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 83 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 05:40:46,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-03-18 05:40:46,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2022-03-18 05:40:46,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 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-18 05:40:46,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 92 transitions. [2022-03-18 05:40:46,453 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 92 transitions. Word has length 19 [2022-03-18 05:40:46,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:46,453 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 92 transitions. [2022-03-18 05:40:46,453 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-18 05:40:46,453 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 92 transitions. [2022-03-18 05:40:46,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-18 05:40:46,454 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:46,454 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 05:40:46,454 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-18 05:40:46,454 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:46,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:46,455 INFO L85 PathProgramCache]: Analyzing trace with hash -934836264, now seen corresponding path program 1 times [2022-03-18 05:40:46,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:46,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [271216319] [2022-03-18 05:40:46,455 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:46,455 INFO L85 PathProgramCache]: Analyzing trace with hash -934836264, now seen corresponding path program 2 times [2022-03-18 05:40:46,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:46,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343335354] [2022-03-18 05:40:46,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:46,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:46,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:46,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:46,488 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-18 05:40:46,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:46,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343335354] [2022-03-18 05:40:46,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343335354] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:46,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:46,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:46,489 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:46,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [271216319] [2022-03-18 05:40:46,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [271216319] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:46,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:46,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:46,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326051181] [2022-03-18 05:40:46,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:46,490 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:46,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:46,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:46,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:46,491 INFO L87 Difference]: Start difference. First operand 56 states and 92 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-18 05:40:46,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:46,551 INFO L93 Difference]: Finished difference Result 148 states and 252 transitions. [2022-03-18 05:40:46,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:46,553 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-18 05:40:46,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:46,554 INFO L225 Difference]: With dead ends: 148 [2022-03-18 05:40:46,554 INFO L226 Difference]: Without dead ends: 101 [2022-03-18 05:40:46,554 INFO L911 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-18 05:40:46,569 INFO L912 BasicCegarLoop]: 54 mSDtfsCounter, 112 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 61 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-18 05:40:46,570 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 61 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 05:40:46,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-03-18 05:40:46,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2022-03-18 05:40:46,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 95 states have (on average 1.7052631578947368) internal successors, (162), 95 states have internal predecessors, (162), 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-18 05:40:46,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 165 transitions. [2022-03-18 05:40:46,587 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 165 transitions. Word has length 19 [2022-03-18 05:40:46,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:46,587 INFO L478 AbstractCegarLoop]: Abstraction has 99 states and 165 transitions. [2022-03-18 05:40:46,587 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-18 05:40:46,587 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 165 transitions. [2022-03-18 05:40:46,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-18 05:40:46,588 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:46,588 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-18 05:40:46,588 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-18 05:40:46,589 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:46,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:46,589 INFO L85 PathProgramCache]: Analyzing trace with hash -541809254, now seen corresponding path program 1 times [2022-03-18 05:40:46,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:46,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2002801647] [2022-03-18 05:40:46,590 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:46,591 INFO L85 PathProgramCache]: Analyzing trace with hash -541809254, now seen corresponding path program 2 times [2022-03-18 05:40:46,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:46,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420557030] [2022-03-18 05:40:46,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:46,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:46,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:46,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:46,658 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-18 05:40:46,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:46,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420557030] [2022-03-18 05:40:46,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420557030] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:46,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:46,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:46,659 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:46,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2002801647] [2022-03-18 05:40:46,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2002801647] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:46,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:46,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:46,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129182082] [2022-03-18 05:40:46,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:46,660 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:46,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:46,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:46,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:46,661 INFO L87 Difference]: Start difference. First operand 99 states and 165 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-18 05:40:46,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:46,722 INFO L93 Difference]: Finished difference Result 127 states and 211 transitions. [2022-03-18 05:40:46,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:46,723 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-18 05:40:46,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:46,724 INFO L225 Difference]: With dead ends: 127 [2022-03-18 05:40:46,724 INFO L226 Difference]: Without dead ends: 125 [2022-03-18 05:40:46,725 INFO L911 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-18 05:40:46,725 INFO L912 BasicCegarLoop]: 85 mSDtfsCounter, 73 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 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, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 05:40:46,728 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 92 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 05:40:46,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-03-18 05:40:46,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 99. [2022-03-18 05:40:46,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 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-18 05:40:46,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 163 transitions. [2022-03-18 05:40:46,754 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 163 transitions. Word has length 19 [2022-03-18 05:40:46,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:46,754 INFO L478 AbstractCegarLoop]: Abstraction has 99 states and 163 transitions. [2022-03-18 05:40:46,754 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-18 05:40:46,754 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 163 transitions. [2022-03-18 05:40:46,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-18 05:40:46,757 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:46,757 INFO L500 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-18 05:40:46,757 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-18 05:40:46,757 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:46,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:46,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1085061584, now seen corresponding path program 1 times [2022-03-18 05:40:46,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:46,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [833251027] [2022-03-18 05:40:46,758 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:46,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1085061584, now seen corresponding path program 2 times [2022-03-18 05:40:46,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:46,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028803641] [2022-03-18 05:40:46,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:46,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:46,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:46,809 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-18 05:40:46,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:46,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028803641] [2022-03-18 05:40:46,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028803641] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:46,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:46,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:46,810 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:46,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [833251027] [2022-03-18 05:40:46,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [833251027] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:46,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:46,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:46,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793667580] [2022-03-18 05:40:46,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:46,810 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:46,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:46,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:46,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:46,811 INFO L87 Difference]: Start difference. First operand 99 states and 163 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-18 05:40:46,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:46,870 INFO L93 Difference]: Finished difference Result 179 states and 299 transitions. [2022-03-18 05:40:46,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:46,871 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-18 05:40:46,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:46,871 INFO L225 Difference]: With dead ends: 179 [2022-03-18 05:40:46,872 INFO L226 Difference]: Without dead ends: 177 [2022-03-18 05:40:46,872 INFO L911 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-18 05:40:46,872 INFO L912 BasicCegarLoop]: 51 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 05:40:46,872 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 58 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 05:40:46,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-03-18 05:40:46,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 135. [2022-03-18 05:40:46,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 131 states have (on average 1.6641221374045803) internal successors, (218), 131 states have internal predecessors, (218), 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-18 05:40:46,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 221 transitions. [2022-03-18 05:40:46,882 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 221 transitions. Word has length 20 [2022-03-18 05:40:46,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:46,882 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 221 transitions. [2022-03-18 05:40:46,882 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-18 05:40:46,882 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 221 transitions. [2022-03-18 05:40:46,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-18 05:40:46,883 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:46,883 INFO L500 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-18 05:40:46,883 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-18 05:40:46,883 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:46,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:46,883 INFO L85 PathProgramCache]: Analyzing trace with hash 692034574, now seen corresponding path program 1 times [2022-03-18 05:40:46,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:46,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2074622427] [2022-03-18 05:40:46,884 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:46,884 INFO L85 PathProgramCache]: Analyzing trace with hash 692034574, now seen corresponding path program 2 times [2022-03-18 05:40:46,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:46,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032738960] [2022-03-18 05:40:46,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:46,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:46,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:46,907 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-18 05:40:46,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:46,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032738960] [2022-03-18 05:40:46,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032738960] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:46,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:46,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:46,908 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:46,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2074622427] [2022-03-18 05:40:46,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2074622427] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:46,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:46,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:46,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273301447] [2022-03-18 05:40:46,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:46,908 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:46,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:46,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:46,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:46,909 INFO L87 Difference]: Start difference. First operand 135 states and 221 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-18 05:40:46,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:46,961 INFO L93 Difference]: Finished difference Result 311 states and 515 transitions. [2022-03-18 05:40:46,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:46,961 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-18 05:40:46,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:46,962 INFO L225 Difference]: With dead ends: 311 [2022-03-18 05:40:46,962 INFO L226 Difference]: Without dead ends: 185 [2022-03-18 05:40:46,963 INFO L911 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-18 05:40:46,963 INFO L912 BasicCegarLoop]: 68 mSDtfsCounter, 91 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 75 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-18 05:40:46,964 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 75 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 05:40:46,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-03-18 05:40:46,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2022-03-18 05:40:46,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 179 states have internal predecessors, (292), 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-18 05:40:46,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 295 transitions. [2022-03-18 05:40:46,976 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 295 transitions. Word has length 20 [2022-03-18 05:40:46,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:46,976 INFO L478 AbstractCegarLoop]: Abstraction has 183 states and 295 transitions. [2022-03-18 05:40:46,976 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-18 05:40:46,976 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 295 transitions. [2022-03-18 05:40:46,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-18 05:40:46,976 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:46,977 INFO L500 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-18 05:40:46,977 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-18 05:40:46,977 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:46,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:46,977 INFO L85 PathProgramCache]: Analyzing trace with hash -722614227, now seen corresponding path program 1 times [2022-03-18 05:40:46,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:46,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [189624192] [2022-03-18 05:40:46,977 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:46,978 INFO L85 PathProgramCache]: Analyzing trace with hash -722614227, now seen corresponding path program 2 times [2022-03-18 05:40:46,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:46,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109851558] [2022-03-18 05:40:46,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:46,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:46,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:47,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:47,011 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-18 05:40:47,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:47,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109851558] [2022-03-18 05:40:47,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109851558] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:47,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:47,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:47,012 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:47,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [189624192] [2022-03-18 05:40:47,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [189624192] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:47,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:47,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:47,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567306839] [2022-03-18 05:40:47,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:47,013 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:47,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:47,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:47,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:47,013 INFO L87 Difference]: Start difference. First operand 183 states and 295 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-18 05:40:47,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:47,069 INFO L93 Difference]: Finished difference Result 277 states and 445 transitions. [2022-03-18 05:40:47,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:47,070 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-18 05:40:47,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:47,070 INFO L225 Difference]: With dead ends: 277 [2022-03-18 05:40:47,071 INFO L226 Difference]: Without dead ends: 191 [2022-03-18 05:40:47,071 INFO L911 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-18 05:40:47,071 INFO L912 BasicCegarLoop]: 70 mSDtfsCounter, 90 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 05:40:47,072 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 77 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 05:40:47,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-03-18 05:40:47,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2022-03-18 05:40:47,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 185 states have (on average 1.6) internal successors, (296), 185 states have internal predecessors, (296), 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-18 05:40:47,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 299 transitions. [2022-03-18 05:40:47,083 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 299 transitions. Word has length 21 [2022-03-18 05:40:47,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:47,083 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 299 transitions. [2022-03-18 05:40:47,084 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-18 05:40:47,084 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 299 transitions. [2022-03-18 05:40:47,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-18 05:40:47,084 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:47,084 INFO L500 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-18 05:40:47,084 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-18 05:40:47,084 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:47,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:47,085 INFO L85 PathProgramCache]: Analyzing trace with hash -21549649, now seen corresponding path program 1 times [2022-03-18 05:40:47,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:47,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1951738294] [2022-03-18 05:40:47,085 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:47,085 INFO L85 PathProgramCache]: Analyzing trace with hash -21549649, now seen corresponding path program 2 times [2022-03-18 05:40:47,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:47,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692788527] [2022-03-18 05:40:47,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:47,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:47,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:47,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:47,105 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-18 05:40:47,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:47,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692788527] [2022-03-18 05:40:47,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692788527] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:47,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:47,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:47,106 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:47,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1951738294] [2022-03-18 05:40:47,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1951738294] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:47,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:47,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:47,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498729040] [2022-03-18 05:40:47,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:47,107 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:47,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:47,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:47,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:47,107 INFO L87 Difference]: Start difference. First operand 189 states and 299 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-18 05:40:47,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:47,171 INFO L93 Difference]: Finished difference Result 333 states and 533 transitions. [2022-03-18 05:40:47,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:47,172 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-18 05:40:47,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:47,173 INFO L225 Difference]: With dead ends: 333 [2022-03-18 05:40:47,173 INFO L226 Difference]: Without dead ends: 331 [2022-03-18 05:40:47,173 INFO L911 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-18 05:40:47,174 INFO L912 BasicCegarLoop]: 50 mSDtfsCounter, 96 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 57 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-18 05:40:47,174 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 57 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 05:40:47,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-03-18 05:40:47,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 265. [2022-03-18 05:40:47,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 261 states have (on average 1.5632183908045978) internal successors, (408), 261 states have internal predecessors, (408), 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-18 05:40:47,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 411 transitions. [2022-03-18 05:40:47,191 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 411 transitions. Word has length 21 [2022-03-18 05:40:47,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:47,191 INFO L478 AbstractCegarLoop]: Abstraction has 265 states and 411 transitions. [2022-03-18 05:40:47,191 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-18 05:40:47,191 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 411 transitions. [2022-03-18 05:40:47,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-03-18 05:40:47,191 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:47,192 INFO L500 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-18 05:40:47,192 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-18 05:40:47,192 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:47,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:47,192 INFO L85 PathProgramCache]: Analyzing trace with hash -414576659, now seen corresponding path program 1 times [2022-03-18 05:40:47,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:47,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [249302163] [2022-03-18 05:40:47,192 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:47,193 INFO L85 PathProgramCache]: Analyzing trace with hash -414576659, now seen corresponding path program 2 times [2022-03-18 05:40:47,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:47,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394122897] [2022-03-18 05:40:47,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:47,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:47,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:47,228 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-18 05:40:47,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:47,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394122897] [2022-03-18 05:40:47,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394122897] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:47,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:47,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:47,229 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:47,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [249302163] [2022-03-18 05:40:47,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [249302163] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:47,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:47,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:47,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724040995] [2022-03-18 05:40:47,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:47,230 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:47,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:47,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:47,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:47,230 INFO L87 Difference]: Start difference. First operand 265 states and 411 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-18 05:40:47,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:47,285 INFO L93 Difference]: Finished difference Result 605 states and 941 transitions. [2022-03-18 05:40:47,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:47,285 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-18 05:40:47,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:47,287 INFO L225 Difference]: With dead ends: 605 [2022-03-18 05:40:47,287 INFO L226 Difference]: Without dead ends: 355 [2022-03-18 05:40:47,287 INFO L911 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-18 05:40:47,288 INFO L912 BasicCegarLoop]: 70 mSDtfsCounter, 85 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 05:40:47,288 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 77 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 05:40:47,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-03-18 05:40:47,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 353. [2022-03-18 05:40:47,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 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-18 05:40:47,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 535 transitions. [2022-03-18 05:40:47,307 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 535 transitions. Word has length 21 [2022-03-18 05:40:47,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:47,307 INFO L478 AbstractCegarLoop]: Abstraction has 353 states and 535 transitions. [2022-03-18 05:40:47,307 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-18 05:40:47,307 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 535 transitions. [2022-03-18 05:40:47,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-18 05:40:47,308 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:47,308 INFO L500 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-18 05:40:47,308 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-18 05:40:47,308 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:47,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:47,309 INFO L85 PathProgramCache]: Analyzing trace with hash -667823741, now seen corresponding path program 1 times [2022-03-18 05:40:47,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:47,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1841999686] [2022-03-18 05:40:47,309 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:47,309 INFO L85 PathProgramCache]: Analyzing trace with hash -667823741, now seen corresponding path program 2 times [2022-03-18 05:40:47,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:47,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711974006] [2022-03-18 05:40:47,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:47,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:47,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:47,331 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-18 05:40:47,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:47,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711974006] [2022-03-18 05:40:47,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711974006] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:47,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:47,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:47,332 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:47,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1841999686] [2022-03-18 05:40:47,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1841999686] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:47,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:47,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:47,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186538821] [2022-03-18 05:40:47,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:47,332 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:47,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:47,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:47,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:47,333 INFO L87 Difference]: Start difference. First operand 353 states and 535 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-18 05:40:47,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:47,399 INFO L93 Difference]: Finished difference Result 529 states and 797 transitions. [2022-03-18 05:40:47,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:47,400 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-18 05:40:47,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:47,401 INFO L225 Difference]: With dead ends: 529 [2022-03-18 05:40:47,401 INFO L226 Difference]: Without dead ends: 363 [2022-03-18 05:40:47,401 INFO L911 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-18 05:40:47,402 INFO L912 BasicCegarLoop]: 67 mSDtfsCounter, 89 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 05:40:47,402 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 74 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 05:40:47,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-03-18 05:40:47,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 361. [2022-03-18 05:40:47,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 357 states have (on average 1.4901960784313726) internal successors, (532), 357 states have internal predecessors, (532), 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-18 05:40:47,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 535 transitions. [2022-03-18 05:40:47,423 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 535 transitions. Word has length 22 [2022-03-18 05:40:47,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:47,423 INFO L478 AbstractCegarLoop]: Abstraction has 361 states and 535 transitions. [2022-03-18 05:40:47,424 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-18 05:40:47,424 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 535 transitions. [2022-03-18 05:40:47,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-18 05:40:47,424 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:47,424 INFO L500 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-18 05:40:47,424 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-18 05:40:47,425 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:47,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:47,425 INFO L85 PathProgramCache]: Analyzing trace with hash 33240837, now seen corresponding path program 1 times [2022-03-18 05:40:47,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:47,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1045319879] [2022-03-18 05:40:47,425 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:47,425 INFO L85 PathProgramCache]: Analyzing trace with hash 33240837, now seen corresponding path program 2 times [2022-03-18 05:40:47,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:47,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948249807] [2022-03-18 05:40:47,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:47,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:47,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:47,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:47,451 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-18 05:40:47,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:47,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948249807] [2022-03-18 05:40:47,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948249807] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:47,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:47,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:47,452 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:47,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1045319879] [2022-03-18 05:40:47,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1045319879] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:47,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:47,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:47,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535843505] [2022-03-18 05:40:47,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:47,452 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:47,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:47,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:47,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:47,453 INFO L87 Difference]: Start difference. First operand 361 states and 535 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-18 05:40:47,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:47,543 INFO L93 Difference]: Finished difference Result 621 states and 929 transitions. [2022-03-18 05:40:47,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:47,543 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-18 05:40:47,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:47,547 INFO L225 Difference]: With dead ends: 621 [2022-03-18 05:40:47,547 INFO L226 Difference]: Without dead ends: 619 [2022-03-18 05:40:47,547 INFO L911 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-18 05:40:47,548 INFO L912 BasicCegarLoop]: 49 mSDtfsCounter, 89 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 05:40:47,548 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 56 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 05:40:47,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-03-18 05:40:47,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 521. [2022-03-18 05:40:47,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 517 states have (on average 1.446808510638298) internal successors, (748), 517 states have internal predecessors, (748), 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-18 05:40:47,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 751 transitions. [2022-03-18 05:40:47,591 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 751 transitions. Word has length 22 [2022-03-18 05:40:47,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:47,591 INFO L478 AbstractCegarLoop]: Abstraction has 521 states and 751 transitions. [2022-03-18 05:40:47,591 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-18 05:40:47,591 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 751 transitions. [2022-03-18 05:40:47,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-03-18 05:40:47,594 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:47,594 INFO L500 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-18 05:40:47,594 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-18 05:40:47,594 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:47,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:47,594 INFO L85 PathProgramCache]: Analyzing trace with hash -359786173, now seen corresponding path program 1 times [2022-03-18 05:40:47,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:47,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [275319245] [2022-03-18 05:40:47,595 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:47,595 INFO L85 PathProgramCache]: Analyzing trace with hash -359786173, now seen corresponding path program 2 times [2022-03-18 05:40:47,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:47,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000198213] [2022-03-18 05:40:47,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:47,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:47,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:47,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:47,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:47,638 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-18 05:40:47,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:47,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000198213] [2022-03-18 05:40:47,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000198213] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:47,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:47,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:47,639 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:47,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [275319245] [2022-03-18 05:40:47,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [275319245] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:47,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:47,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:47,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968363631] [2022-03-18 05:40:47,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:47,640 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:47,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:47,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:47,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:47,640 INFO L87 Difference]: Start difference. First operand 521 states and 751 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-18 05:40:47,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:47,733 INFO L93 Difference]: Finished difference Result 1181 states and 1697 transitions. [2022-03-18 05:40:47,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:47,733 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-18 05:40:47,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:47,736 INFO L225 Difference]: With dead ends: 1181 [2022-03-18 05:40:47,736 INFO L226 Difference]: Without dead ends: 683 [2022-03-18 05:40:47,737 INFO L911 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-18 05:40:47,738 INFO L912 BasicCegarLoop]: 72 mSDtfsCounter, 79 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 05:40:47,738 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 79 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 05:40:47,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2022-03-18 05:40:47,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 681. [2022-03-18 05:40:47,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 677 states have (on average 1.4002954209748892) internal successors, (948), 677 states have internal predecessors, (948), 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-18 05:40:47,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 951 transitions. [2022-03-18 05:40:47,806 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 951 transitions. Word has length 22 [2022-03-18 05:40:47,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:47,807 INFO L478 AbstractCegarLoop]: Abstraction has 681 states and 951 transitions. [2022-03-18 05:40:47,807 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-18 05:40:47,807 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 951 transitions. [2022-03-18 05:40:47,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-18 05:40:47,808 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:47,808 INFO L500 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-18 05:40:47,808 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-18 05:40:47,808 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:47,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:47,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1030681666, now seen corresponding path program 1 times [2022-03-18 05:40:47,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:47,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1733229891] [2022-03-18 05:40:47,809 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:47,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1030681666, now seen corresponding path program 2 times [2022-03-18 05:40:47,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:47,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185751395] [2022-03-18 05:40:47,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:47,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:47,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:47,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:47,832 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-18 05:40:47,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:47,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185751395] [2022-03-18 05:40:47,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185751395] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:47,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:47,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:47,833 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:47,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1733229891] [2022-03-18 05:40:47,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1733229891] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:47,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:47,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:47,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87462392] [2022-03-18 05:40:47,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:47,834 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:47,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:47,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:47,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:47,835 INFO L87 Difference]: Start difference. First operand 681 states and 951 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-18 05:40:47,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:47,919 INFO L93 Difference]: Finished difference Result 1021 states and 1417 transitions. [2022-03-18 05:40:47,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:47,919 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-18 05:40:47,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:47,921 INFO L225 Difference]: With dead ends: 1021 [2022-03-18 05:40:47,921 INFO L226 Difference]: Without dead ends: 699 [2022-03-18 05:40:47,922 INFO L911 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-18 05:40:47,923 INFO L912 BasicCegarLoop]: 64 mSDtfsCounter, 88 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 05:40:47,923 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 71 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 05:40:47,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2022-03-18 05:40:47,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 697. [2022-03-18 05:40:47,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 693 states have (on average 1.367965367965368) internal successors, (948), 693 states have internal predecessors, (948), 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-18 05:40:47,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 951 transitions. [2022-03-18 05:40:47,963 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 951 transitions. Word has length 23 [2022-03-18 05:40:47,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:47,963 INFO L478 AbstractCegarLoop]: Abstraction has 697 states and 951 transitions. [2022-03-18 05:40:47,963 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-18 05:40:47,963 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 951 transitions. [2022-03-18 05:40:47,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-18 05:40:47,964 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:47,964 INFO L500 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-18 05:40:47,964 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-18 05:40:47,964 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:47,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:47,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1731746244, now seen corresponding path program 1 times [2022-03-18 05:40:47,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:47,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [182209927] [2022-03-18 05:40:47,965 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:47,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1731746244, now seen corresponding path program 2 times [2022-03-18 05:40:47,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:47,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86957000] [2022-03-18 05:40:47,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:47,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:47,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:47,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:47,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:47,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-18 05:40:47,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:47,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86957000] [2022-03-18 05:40:47,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86957000] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:47,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:47,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:47,984 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:47,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [182209927] [2022-03-18 05:40:47,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [182209927] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:47,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:47,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:47,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560839406] [2022-03-18 05:40:47,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:47,984 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:47,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:47,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:47,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:47,985 INFO L87 Difference]: Start difference. First operand 697 states and 951 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-18 05:40:48,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:48,110 INFO L93 Difference]: Finished difference Result 1165 states and 1593 transitions. [2022-03-18 05:40:48,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:48,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-03-18 05:40:48,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:48,115 INFO L225 Difference]: With dead ends: 1165 [2022-03-18 05:40:48,115 INFO L226 Difference]: Without dead ends: 1163 [2022-03-18 05:40:48,117 INFO L911 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-18 05:40:48,118 INFO L912 BasicCegarLoop]: 48 mSDtfsCounter, 82 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 05:40:48,118 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 55 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 05:40:48,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2022-03-18 05:40:48,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1033. [2022-03-18 05:40:48,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 1029 states have (on average 1.3255587949465502) internal successors, (1364), 1029 states have internal predecessors, (1364), 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-18 05:40:48,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1367 transitions. [2022-03-18 05:40:48,206 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1367 transitions. Word has length 23 [2022-03-18 05:40:48,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:48,206 INFO L478 AbstractCegarLoop]: Abstraction has 1033 states and 1367 transitions. [2022-03-18 05:40:48,206 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-18 05:40:48,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1367 transitions. [2022-03-18 05:40:48,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-18 05:40:48,207 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:48,207 INFO L500 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-18 05:40:48,207 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-18 05:40:48,207 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:48,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:48,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1338719234, now seen corresponding path program 1 times [2022-03-18 05:40:48,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:48,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1970687536] [2022-03-18 05:40:48,208 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:48,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1338719234, now seen corresponding path program 2 times [2022-03-18 05:40:48,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:48,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972185684] [2022-03-18 05:40:48,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:48,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:48,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:48,238 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-18 05:40:48,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:48,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972185684] [2022-03-18 05:40:48,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972185684] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:48,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:48,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:48,239 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:48,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1970687536] [2022-03-18 05:40:48,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1970687536] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:48,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:48,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:48,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183033438] [2022-03-18 05:40:48,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:48,239 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:48,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:48,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:48,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:48,240 INFO L87 Difference]: Start difference. First operand 1033 states and 1367 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-18 05:40:48,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:48,387 INFO L93 Difference]: Finished difference Result 2317 states and 3033 transitions. [2022-03-18 05:40:48,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:48,388 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-18 05:40:48,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:48,392 INFO L225 Difference]: With dead ends: 2317 [2022-03-18 05:40:48,392 INFO L226 Difference]: Without dead ends: 1323 [2022-03-18 05:40:48,394 INFO L911 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-18 05:40:48,395 INFO L912 BasicCegarLoop]: 74 mSDtfsCounter, 73 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 05:40:48,395 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 81 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 05:40:48,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2022-03-18 05:40:48,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1321. [2022-03-18 05:40:48,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1317 states have (on average 1.2665148063781322) internal successors, (1668), 1317 states have internal predecessors, (1668), 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-18 05:40:48,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1671 transitions. [2022-03-18 05:40:48,474 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1671 transitions. Word has length 23 [2022-03-18 05:40:48,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:48,474 INFO L478 AbstractCegarLoop]: Abstraction has 1321 states and 1671 transitions. [2022-03-18 05:40:48,474 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-18 05:40:48,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1671 transitions. [2022-03-18 05:40:48,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-18 05:40:48,476 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:48,476 INFO L500 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-18 05:40:48,476 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-18 05:40:48,476 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:48,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:48,476 INFO L85 PathProgramCache]: Analyzing trace with hash 2144742072, now seen corresponding path program 1 times [2022-03-18 05:40:48,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:48,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [899566574] [2022-03-18 05:40:48,477 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:48,477 INFO L85 PathProgramCache]: Analyzing trace with hash 2144742072, now seen corresponding path program 2 times [2022-03-18 05:40:48,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:48,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774567304] [2022-03-18 05:40:48,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:48,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:48,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:48,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:48,495 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-18 05:40:48,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:48,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774567304] [2022-03-18 05:40:48,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774567304] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:48,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:48,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:48,496 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:48,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [899566574] [2022-03-18 05:40:48,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [899566574] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:48,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:48,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:48,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257271441] [2022-03-18 05:40:48,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:48,496 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:48,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:48,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:48,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:48,497 INFO L87 Difference]: Start difference. First operand 1321 states and 1671 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-18 05:40:48,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:48,622 INFO L93 Difference]: Finished difference Result 1981 states and 2489 transitions. [2022-03-18 05:40:48,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:48,622 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-18 05:40:48,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:48,626 INFO L225 Difference]: With dead ends: 1981 [2022-03-18 05:40:48,626 INFO L226 Difference]: Without dead ends: 1355 [2022-03-18 05:40:48,627 INFO L911 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-18 05:40:48,628 INFO L912 BasicCegarLoop]: 61 mSDtfsCounter, 87 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 05:40:48,628 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 68 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 05:40:48,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2022-03-18 05:40:48,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1353. [2022-03-18 05:40:48,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 1349 states have (on average 1.2364714603409934) internal successors, (1668), 1349 states have internal predecessors, (1668), 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-18 05:40:48,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1671 transitions. [2022-03-18 05:40:48,725 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1671 transitions. Word has length 24 [2022-03-18 05:40:48,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:48,725 INFO L478 AbstractCegarLoop]: Abstraction has 1353 states and 1671 transitions. [2022-03-18 05:40:48,725 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-18 05:40:48,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1671 transitions. [2022-03-18 05:40:48,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-18 05:40:48,727 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:48,727 INFO L500 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-18 05:40:48,727 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-18 05:40:48,727 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:48,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:48,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1449160646, now seen corresponding path program 1 times [2022-03-18 05:40:48,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:48,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1230393331] [2022-03-18 05:40:48,728 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:48,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1449160646, now seen corresponding path program 2 times [2022-03-18 05:40:48,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:48,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079629826] [2022-03-18 05:40:48,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:48,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:48,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:48,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:48,747 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-18 05:40:48,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:48,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079629826] [2022-03-18 05:40:48,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079629826] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:48,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:48,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:48,747 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:48,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1230393331] [2022-03-18 05:40:48,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1230393331] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:48,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:48,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:48,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186835864] [2022-03-18 05:40:48,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:48,748 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:48,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:48,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:48,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:48,749 INFO L87 Difference]: Start difference. First operand 1353 states and 1671 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-18 05:40:48,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:48,916 INFO L93 Difference]: Finished difference Result 2187 states and 2664 transitions. [2022-03-18 05:40:48,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:48,916 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-18 05:40:48,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:48,921 INFO L225 Difference]: With dead ends: 2187 [2022-03-18 05:40:48,922 INFO L226 Difference]: Without dead ends: 2185 [2022-03-18 05:40:48,922 INFO L911 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-18 05:40:48,923 INFO L912 BasicCegarLoop]: 46 mSDtfsCounter, 74 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 05:40:48,923 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 53 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 05:40:48,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2185 states. [2022-03-18 05:40:49,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2185 to 2057. [2022-03-18 05:40:49,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2057 states, 2053 states have (on average 1.2021432050657574) internal successors, (2468), 2053 states have internal predecessors, (2468), 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-18 05:40:49,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 2471 transitions. [2022-03-18 05:40:49,089 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 2471 transitions. Word has length 24 [2022-03-18 05:40:49,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:49,090 INFO L478 AbstractCegarLoop]: Abstraction has 2057 states and 2471 transitions. [2022-03-18 05:40:49,090 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-18 05:40:49,090 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 2471 transitions. [2022-03-18 05:40:49,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-03-18 05:40:49,092 INFO L492 BasicCegarLoop]: Found error trace [2022-03-18 05:40:49,092 INFO L500 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-18 05:40:49,092 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-18 05:40:49,092 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-18 05:40:49,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-18 05:40:49,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1842187656, now seen corresponding path program 1 times [2022-03-18 05:40:49,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:49,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1782635070] [2022-03-18 05:40:49,093 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-18 05:40:49,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1842187656, now seen corresponding path program 2 times [2022-03-18 05:40:49,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-18 05:40:49,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713028163] [2022-03-18 05:40:49,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-18 05:40:49,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-18 05:40:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:49,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-18 05:40:49,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-18 05:40:49,110 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-18 05:40:49,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-18 05:40:49,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713028163] [2022-03-18 05:40:49,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713028163] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:49,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:49,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:49,111 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-18 05:40:49,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1782635070] [2022-03-18 05:40:49,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1782635070] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-18 05:40:49,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-18 05:40:49,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-18 05:40:49,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002456097] [2022-03-18 05:40:49,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-18 05:40:49,111 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-18 05:40:49,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-18 05:40:49,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-18 05:40:49,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-18 05:40:49,112 INFO L87 Difference]: Start difference. First operand 2057 states and 2471 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-18 05:40:49,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-18 05:40:49,315 INFO L93 Difference]: Finished difference Result 4553 states and 5351 transitions. [2022-03-18 05:40:49,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-18 05:40:49,316 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-18 05:40:49,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-18 05:40:49,316 INFO L225 Difference]: With dead ends: 4553 [2022-03-18 05:40:49,316 INFO L226 Difference]: Without dead ends: 0 [2022-03-18 05:40:49,322 INFO L911 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-18 05:40:49,322 INFO L912 BasicCegarLoop]: 75 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-18 05:40:49,323 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 82 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-18 05:40:49,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-18 05:40:49,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-18 05:40:49,323 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-18 05:40:49,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-18 05:40:49,323 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-03-18 05:40:49,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-18 05:40:49,323 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-18 05:40:49,324 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-18 05:40:49,324 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-18 05:40:49,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-18 05:40:49,326 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-18 05:40:49,326 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-03-18 05:40:49,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-03-18 05:41:17,957 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-03-18 05:41:17,957 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-03-18 05:41:17,957 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-03-18 05:41:17,957 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-03-18 05:41:17,958 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-18 05:41:17,958 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-03-18 05:41:17,958 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-03-18 05:41:17,958 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-03-18 05:41:17,958 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-03-18 05:41:17,958 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-03-18 05:41:17,958 INFO L878 garLoopResultBuilder]: At program point L93-1(lines 32 118) the Hoare annotation is: (let ((.cse0 (= main_~lk5~0 1)) (.cse2 (= main_~p7~0 0)) (.cse1 (= main_~lk4~0 1)) (.cse3 (= main_~p6~0 0)) (.cse4 (= main_~lk7~0 1)) (.cse5 (= main_~p4~0 0)) (.cse7 (= main_~p5~0 0)) (.cse6 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse0 .cse3) (and .cse0 .cse1 .cse2 .cse6) (and .cse4 .cse0 .cse1 .cse3) (and .cse5 .cse2 .cse7 .cse6) (and .cse4 .cse0 .cse1 .cse6) (and .cse5 .cse0 .cse2 .cse3) (and .cse5 .cse2 .cse7 .cse3) (and .cse1 .cse2 .cse7 .cse6) (and .cse4 .cse5 .cse7 .cse3) (and .cse4 .cse5 .cse0 .cse6) (and .cse1 .cse2 .cse7 .cse3) (and .cse4 .cse1 .cse7 .cse6) (and .cse5 .cse0 .cse2 .cse6) (and .cse4 .cse1 .cse7 .cse3) (and .cse4 .cse5 .cse7 .cse6))) [2022-03-18 05:41:17,958 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 6 123) the Hoare annotation is: true [2022-03-18 05:41:17,959 INFO L878 garLoopResultBuilder]: At program point L77-1(lines 32 118) 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-18 05:41:17,959 INFO L878 garLoopResultBuilder]: At program point L69-1(lines 32 118) 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-18 05:41:17,959 INFO L878 garLoopResultBuilder]: At program point L94(line 94) the Hoare annotation is: (let ((.cse6 (= main_~p7~0 0)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~p5~0 0)) (.cse8 (= main_~lk6~0 1)) (.cse0 (not (= main_~p3~0 0))) (.cse1 (= main_~lk7~0 1)) (.cse3 (= main_~lk5~0 1)) (.cse9 (= main_~lk4~0 1)) (.cse4 (= main_~lk3~0 1)) (.cse5 (= main_~p6~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse8) (and .cse0 .cse1 .cse3 .cse9 .cse4 .cse8) (and .cse0 .cse2 .cse4 .cse6 .cse7 .cse5) (and .cse0 .cse9 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse5) (and .cse0 .cse1 .cse9 .cse4 .cse7 .cse5) (and .cse0 .cse3 .cse9 .cse4 .cse6 .cse8) (and .cse0 .cse1 .cse9 .cse4 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse7 .cse5) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse8) (and .cse0 .cse3 .cse9 .cse4 .cse6 .cse5) (and .cse0 .cse9 .cse4 .cse6 .cse7 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse9 .cse4 .cse5))) [2022-03-18 05:41:17,959 INFO L878 garLoopResultBuilder]: At program point L61-1(lines 32 118) 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-18 05:41:17,959 INFO L885 garLoopResultBuilder]: At program point L119(lines 7 123) the Hoare annotation is: true [2022-03-18 05:41:17,959 INFO L885 garLoopResultBuilder]: At program point L53(lines 53 55) the Hoare annotation is: true [2022-03-18 05:41:17,959 INFO L878 garLoopResultBuilder]: At program point L53-2(lines 32 118) the Hoare annotation is: (or (= main_~lk1~0 1) (= main_~p1~0 0)) [2022-03-18 05:41:17,959 INFO L878 garLoopResultBuilder]: At program point L103-1(lines 32 118) the Hoare annotation is: (let ((.cse1 (= main_~lk6~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse2 (= main_~p7~0 0)) (.cse3 (= main_~p6~0 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and .cse0 .cse3) (and .cse2 .cse3))) [2022-03-18 05:41:17,960 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 6 123) the Hoare annotation is: true [2022-03-18 05:41:17,960 INFO L878 garLoopResultBuilder]: At program point L104(line 104) the Hoare annotation is: (let ((.cse3 (= main_~p6~0 0)) (.cse1 (= main_~lk7~0 1)) (.cse0 (not (= main_~p5~0 0))) (.cse2 (= main_~lk5~0 1)) (.cse4 (= main_~p7~0 0)) (.cse5 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse4 .cse3) (and .cse0 .cse1 .cse2 .cse5) (and .cse0 .cse2 .cse4 .cse5))) [2022-03-18 05:41:17,960 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 121) the Hoare annotation is: false [2022-03-18 05:41:17,960 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 6 123) the Hoare annotation is: true [2022-03-18 05:41:17,960 INFO L878 garLoopResultBuilder]: At program point L88-1(lines 32 118) the Hoare annotation is: (let ((.cse8 (= main_~p7~0 0)) (.cse6 (= main_~p5~0 0)) (.cse7 (= main_~p6~0 0)) (.cse1 (= main_~p4~0 0)) (.cse9 (= main_~lk3~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse2 (= main_~lk5~0 1)) (.cse5 (= main_~lk4~0 1)) (.cse3 (= main_~lk6~0 1)) (.cse4 (= main_~p3~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse6 .cse7 .cse4) (and .cse5 .cse8 .cse6 .cse3 .cse4) (and .cse2 .cse5 .cse9 .cse8 .cse7) (and .cse0 .cse2 .cse5 .cse7 .cse4) (and .cse0 .cse1 .cse9 .cse6 .cse3) (and .cse1 .cse2 .cse9 .cse8 .cse3) (and .cse2 .cse5 .cse8 .cse3 .cse4) (and .cse1 .cse8 .cse6 .cse3 .cse4) (and .cse1 .cse8 .cse6 .cse7 .cse4) (and .cse2 .cse5 .cse9 .cse8 .cse3) (and .cse0 .cse1 .cse2 .cse7 .cse4) (and .cse0 .cse1 .cse6 .cse7 .cse4) (and .cse1 .cse2 .cse8 .cse3 .cse4) (and .cse5 .cse8 .cse6 .cse7 .cse4) (and .cse0 .cse5 .cse9 .cse6 .cse7) (and .cse0 .cse5 .cse6 .cse3 .cse4) (and .cse0 .cse5 .cse9 .cse6 .cse3) (and .cse5 .cse9 .cse8 .cse6 .cse7) (and .cse0 .cse2 .cse5 .cse9 .cse3) (and .cse1 .cse9 .cse8 .cse6 .cse3) (and .cse1 .cse2 .cse8 .cse7 .cse4) (and .cse0 .cse2 .cse5 .cse9 .cse7) (and .cse5 .cse9 .cse8 .cse6 .cse3) (and .cse1 .cse2 .cse9 .cse8 .cse7) (and .cse0 .cse1 .cse2 .cse9 .cse7) (and .cse0 .cse1 .cse9 .cse6 .cse7) (and .cse2 .cse5 .cse8 .cse7 .cse4) (and .cse0 .cse1 .cse6 .cse3 .cse4) (and .cse1 .cse9 .cse8 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse0 .cse2 .cse5 .cse3 .cse4))) [2022-03-18 05:41:17,960 INFO L885 garLoopResultBuilder]: At program point L113-1(lines 32 118) the Hoare annotation is: true [2022-03-18 05:41:17,960 INFO L878 garLoopResultBuilder]: At program point L89(line 89) the Hoare annotation is: (let ((.cse4 (= main_~lk6~0 1)) (.cse6 (= main_~p4~0 0)) (.cse2 (= main_~lk3~0 1)) (.cse7 (= main_~lk5~0 1)) (.cse8 (= main_~p7~0 0)) (.cse0 (= main_~lk7~0 1)) (.cse1 (= main_~lk4~0 1)) (.cse3 (= main_~p5~0 0)) (.cse10 (= main_~p6~0 0)) (.cse9 (= main_~p3~0 0)) (.cse5 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse2 .cse8 .cse4 .cse5) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse5) (and .cse0 .cse6 .cse3 .cse4 .cse9 .cse5) (and .cse6 .cse2 .cse8 .cse3 .cse10 .cse5) (and .cse7 .cse1 .cse2 .cse8 .cse10 .cse5) (and .cse1 .cse2 .cse8 .cse3 .cse10 .cse5) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse5) (and .cse7 .cse1 .cse2 .cse8 .cse4 .cse5) (and .cse6 .cse7 .cse2 .cse8 .cse10 .cse5) (and .cse0 .cse7 .cse1 .cse2 .cse10 .cse5) (and .cse6 .cse7 .cse8 .cse10 .cse9 .cse5) (and .cse1 .cse8 .cse3 .cse10 .cse9 .cse5) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse5) (and .cse6 .cse8 .cse3 .cse4 .cse9 .cse5) (and .cse0 .cse6 .cse7 .cse2 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5) (and .cse6 .cse8 .cse3 .cse10 .cse9 .cse5) (and .cse0 .cse6 .cse7 .cse10 .cse9 .cse5) (and .cse6 .cse2 .cse8 .cse3 .cse4 .cse5) (and .cse0 .cse7 .cse1 .cse2 .cse4 .cse5) (and .cse0 .cse6 .cse7 .cse4 .cse9 .cse5) (and .cse0 .cse7 .cse1 .cse4 .cse9 .cse5) (and .cse0 .cse6 .cse3 .cse10 .cse9 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse10 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse7 .cse1 .cse10 .cse9 .cse5) (and .cse6 .cse7 .cse8 .cse4 .cse9 .cse5) (and .cse7 .cse1 .cse8 .cse4 .cse9 .cse5) (and .cse0 .cse6 .cse7 .cse2 .cse10 .cse5) (and .cse7 .cse1 .cse8 .cse10 .cse9 .cse5) (and .cse0 .cse1 .cse3 .cse10 .cse9 .cse5))) [2022-03-18 05:41:17,960 INFO L878 garLoopResultBuilder]: At program point L114(line 114) the Hoare annotation is: (= main_~lk7~0 1) [2022-03-18 05:41:17,960 INFO L878 garLoopResultBuilder]: At program point L114-1(lines 7 123) the Hoare annotation is: false [2022-03-18 05:41:17,961 INFO L878 garLoopResultBuilder]: At program point L73-1(lines 32 118) 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-18 05:41:17,961 INFO L878 garLoopResultBuilder]: At program point L98-1(lines 32 118) the Hoare annotation is: (let ((.cse5 (= main_~p5~0 0)) (.cse3 (= main_~lk7~0 1)) (.cse2 (= main_~lk6~0 1)) (.cse0 (= main_~lk5~0 1)) (.cse1 (= main_~p7~0 0)) (.cse4 (= main_~p6~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse4) (and .cse1 .cse5 .cse4) (and .cse1 .cse5 .cse2) (and .cse3 .cse5 .cse4) (and .cse3 .cse5 .cse2) (and .cse3 .cse0 .cse2) (and .cse0 .cse1 .cse4))) [2022-03-18 05:41:17,961 INFO L878 garLoopResultBuilder]: At program point L65-1(lines 32 118) 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-18 05:41:17,961 INFO L878 garLoopResultBuilder]: At program point L57-1(lines 32 118) 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-18 05:41:17,961 INFO L878 garLoopResultBuilder]: At program point L99(line 99) the Hoare annotation is: (let ((.cse4 (= main_~p6~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse3 (= main_~p7~0 0)) (.cse6 (= main_~lk7~0 1)) (.cse1 (not (= main_~p4~0 0))) (.cse2 (= main_~lk4~0 1)) (.cse5 (= main_~p5~0 0)) (.cse7 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse5 .cse4) (and .cse6 .cse0 .cse1 .cse2 .cse7) (and .cse6 .cse0 .cse1 .cse2 .cse4) (and .cse6 .cse1 .cse2 .cse5 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse7) (and .cse1 .cse2 .cse3 .cse5 .cse7) (and .cse6 .cse1 .cse2 .cse5 .cse7))) [2022-03-18 05:41:17,961 INFO L878 garLoopResultBuilder]: At program point L83-1(lines 32 118) the Hoare annotation is: (let ((.cse6 (= main_~p4~0 0)) (.cse10 (= main_~p7~0 0)) (.cse3 (= main_~p5~0 0)) (.cse11 (= main_~p6~0 0)) (.cse8 (= main_~p3~0 0)) (.cse5 (= main_~lk2~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse9 (= main_~lk5~0 1)) (.cse1 (= main_~lk4~0 1)) (.cse2 (= main_~lk3~0 1)) (.cse7 (= main_~p2~0 0)) (.cse4 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse3 .cse7 .cse4 .cse8) (and .cse6 .cse9 .cse2 .cse10 .cse4 .cse5) (and .cse0 .cse1 .cse3 .cse4 .cse8 .cse5) (and .cse0 .cse6 .cse3 .cse4 .cse8 .cse5) (and .cse6 .cse2 .cse10 .cse3 .cse11 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse7 .cse11) (and .cse0 .cse9 .cse1 .cse2 .cse7 .cse11) (and .cse9 .cse1 .cse2 .cse10 .cse11 .cse5) (and .cse0 .cse6 .cse9 .cse7 .cse11 .cse8) (and .cse6 .cse2 .cse10 .cse3 .cse7 .cse11) (and .cse1 .cse2 .cse10 .cse3 .cse11 .cse5) (and .cse1 .cse10 .cse3 .cse4 .cse8 .cse5) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse7 .cse4) (and .cse6 .cse2 .cse10 .cse3 .cse7 .cse4) (and .cse9 .cse1 .cse10 .cse7 .cse11 .cse8) (and .cse6 .cse9 .cse2 .cse10 .cse11 .cse5) (and .cse0 .cse9 .cse1 .cse2 .cse11 .cse5) (and .cse6 .cse9 .cse10 .cse11 .cse8 .cse5) (and .cse1 .cse10 .cse3 .cse11 .cse8 .cse5) (and .cse0 .cse1 .cse3 .cse7 .cse11 .cse8) (and .cse0 .cse9 .cse1 .cse7 .cse11 .cse8) (and .cse1 .cse2 .cse10 .cse3 .cse4 .cse5) (and .cse1 .cse10 .cse3 .cse7 .cse4 .cse8) (and .cse0 .cse6 .cse9 .cse7 .cse4 .cse8) (and .cse6 .cse10 .cse3 .cse4 .cse8 .cse5) (and .cse6 .cse9 .cse2 .cse10 .cse7 .cse4) (and .cse0 .cse6 .cse9 .cse2 .cse4 .cse5) (and .cse9 .cse1 .cse2 .cse10 .cse7 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse5) (and .cse6 .cse10 .cse3 .cse11 .cse8 .cse5) (and .cse0 .cse6 .cse9 .cse2 .cse7 .cse11) (and .cse6 .cse10 .cse3 .cse7 .cse11 .cse8) (and .cse6 .cse10 .cse3 .cse7 .cse4 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse4) (and .cse0 .cse6 .cse9 .cse11 .cse8 .cse5) (and .cse9 .cse1 .cse2 .cse10 .cse7 .cse11) (and .cse0 .cse9 .cse1 .cse7 .cse4 .cse8) (and .cse1 .cse2 .cse10 .cse3 .cse7 .cse4) (and .cse9 .cse1 .cse10 .cse7 .cse4 .cse8) (and .cse6 .cse2 .cse10 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse9 .cse2 .cse7 .cse4) (and .cse0 .cse9 .cse1 .cse2 .cse4 .cse5) (and .cse0 .cse6 .cse9 .cse4 .cse8 .cse5) (and .cse0 .cse9 .cse1 .cse4 .cse8 .cse5) (and .cse0 .cse6 .cse3 .cse11 .cse8 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse11 .cse5) (and .cse6 .cse9 .cse10 .cse7 .cse4 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse11) (and .cse6 .cse9 .cse2 .cse10 .cse7 .cse11) (and .cse1 .cse10 .cse3 .cse7 .cse11 .cse8) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse9 .cse1 .cse11 .cse8 .cse5) (and .cse6 .cse9 .cse10 .cse7 .cse11 .cse8) (and .cse0 .cse6 .cse3 .cse7 .cse11 .cse8) (and .cse6 .cse9 .cse10 .cse4 .cse8 .cse5) (and .cse0 .cse1 .cse3 .cse7 .cse4 .cse8) (and .cse9 .cse1 .cse10 .cse4 .cse8 .cse5) (and .cse0 .cse6 .cse9 .cse2 .cse11 .cse5) (and .cse9 .cse1 .cse10 .cse11 .cse8 .cse5) (and .cse1 .cse2 .cse10 .cse3 .cse7 .cse11) (and .cse0 .cse1 .cse3 .cse11 .cse8 .cse5) (and .cse0 .cse9 .cse1 .cse2 .cse7 .cse4))) [2022-03-18 05:41:17,961 INFO L878 garLoopResultBuilder]: At program point L108-1(lines 32 118) the Hoare annotation is: (or (= main_~lk7~0 1) (= main_~p7~0 0)) [2022-03-18 05:41:17,962 INFO L885 garLoopResultBuilder]: At program point L34(lines 34 36) the Hoare annotation is: true [2022-03-18 05:41:17,962 INFO L878 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: (let ((.cse9 (= main_~p7~0 0)) (.cse10 (= main_~lk2~0 1)) (.cse8 (= main_~lk5~0 1)) (.cse13 (= main_~lk4~0 1)) (.cse4 (= main_~lk3~0 1)) (.cse11 (= main_~lk6~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse1 (= main_~p4~0 0)) (.cse2 (not (= main_~p1~0 0))) (.cse3 (= main_~lk1~0 1)) (.cse5 (= main_~p5~0 0)) (.cse6 (= main_~p2~0 0)) (.cse7 (= main_~p6~0 0)) (.cse12 (= main_~p3~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse9 .cse7 .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse11 .cse10) (and .cse1 .cse2 .cse3 .cse9 .cse5 .cse11 .cse12 .cse10) (and .cse8 .cse2 .cse3 .cse13 .cse9 .cse6 .cse11 .cse12) (and .cse8 .cse2 .cse3 .cse13 .cse9 .cse7 .cse12 .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse7 .cse10) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse9 .cse11 .cse10) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse9 .cse6 .cse7) (and .cse2 .cse3 .cse13 .cse9 .cse5 .cse6 .cse11 .cse12) (and .cse2 .cse3 .cse13 .cse4 .cse9 .cse5 .cse6 .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse9 .cse5 .cse6 .cse7 .cse12) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse4 .cse7 .cse10) (and .cse1 .cse8 .cse2 .cse3 .cse9 .cse7 .cse12 .cse10) (and .cse2 .cse3 .cse13 .cse4 .cse9 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse4 .cse6 .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse11 .cse12) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse9 .cse7 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse4 .cse11 .cse10) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse6 .cse7 .cse12) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse4 .cse11 .cse10) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse5 .cse11 .cse10) (and .cse8 .cse2 .cse3 .cse13 .cse9 .cse6 .cse7 .cse12) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse4 .cse7 .cse10) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse9 .cse6 .cse11) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse5 .cse7 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse4 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse10) (and .cse0 .cse2 .cse3 .cse13 .cse5 .cse6 .cse11 .cse12) (and .cse1 .cse8 .cse2 .cse3 .cse9 .cse11 .cse12 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse6 .cse7 .cse12) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse11 .cse12 .cse10) (and .cse2 .cse3 .cse13 .cse4 .cse9 .cse5 .cse11 .cse10) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse9 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse12 .cse10) (and .cse2 .cse3 .cse13 .cse9 .cse5 .cse7 .cse12 .cse10) (and .cse2 .cse3 .cse13 .cse4 .cse9 .cse5 .cse7 .cse10) (and .cse0 .cse2 .cse3 .cse13 .cse5 .cse7 .cse12 .cse10) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse7 .cse12 .cse10) (and .cse0 .cse2 .cse3 .cse13 .cse5 .cse6 .cse7 .cse12) (and .cse0 .cse2 .cse3 .cse13 .cse5 .cse11 .cse12 .cse10) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse9 .cse11 .cse10) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse9 .cse6 .cse11) (and .cse2 .cse3 .cse13 .cse9 .cse5 .cse6 .cse7 .cse12) (and .cse1 .cse2 .cse3 .cse9 .cse5 .cse6 .cse11 .cse12) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse11 .cse12 .cse10) (and .cse1 .cse2 .cse3 .cse9 .cse5 .cse7 .cse12 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse4 .cse6 .cse11) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse8 .cse2 .cse3 .cse9 .cse6 .cse11 .cse12) (and .cse2 .cse3 .cse13 .cse9 .cse5 .cse11 .cse12 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse7 .cse12 .cse10) (and .cse1 .cse8 .cse2 .cse3 .cse9 .cse6 .cse7 .cse12) (and .cse8 .cse2 .cse3 .cse13 .cse9 .cse11 .cse12 .cse10) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse6 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse11 .cse12 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse6 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse12))) [2022-03-18 05:41:17,962 INFO L878 garLoopResultBuilder]: At program point L109(line 109) the Hoare annotation is: (let ((.cse0 (= main_~lk6~0 1)) (.cse1 (not (= main_~p6~0 0)))) (or (and (= main_~lk7~0 1) .cse0 .cse1) (and (= main_~p7~0 0) .cse0 .cse1))) [2022-03-18 05:41:17,965 INFO L718 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-03-18 05:41:17,966 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-18 05:41:17,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.03 05:41:17 BoogieIcfgContainer [2022-03-18 05:41:17,972 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-18 05:41:17,973 INFO L158 Benchmark]: Toolchain (without parser) took 32946.79ms. Allocated memory was 184.5MB in the beginning and 795.9MB in the end (delta: 611.3MB). Free memory was 135.0MB in the beginning and 457.2MB in the end (delta: -322.2MB). Peak memory consumption was 462.9MB. Max. memory is 8.0GB. [2022-03-18 05:41:17,973 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 184.5MB. Free memory was 151.0MB in the beginning and 150.9MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-18 05:41:17,973 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.04ms. Allocated memory is still 184.5MB. Free memory was 134.7MB in the beginning and 160.6MB in the end (delta: -25.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-03-18 05:41:17,973 INFO L158 Benchmark]: Boogie Preprocessor took 37.12ms. Allocated memory is still 184.5MB. Free memory was 160.6MB in the beginning and 159.1MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-18 05:41:17,973 INFO L158 Benchmark]: RCFGBuilder took 290.52ms. Allocated memory is still 184.5MB. Free memory was 159.1MB in the beginning and 148.0MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-03-18 05:41:17,974 INFO L158 Benchmark]: TraceAbstraction took 32430.58ms. Allocated memory was 184.5MB in the beginning and 795.9MB in the end (delta: 611.3MB). Free memory was 147.4MB in the beginning and 457.2MB in the end (delta: -309.8MB). Peak memory consumption was 475.5MB. Max. memory is 8.0GB. [2022-03-18 05:41:17,974 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 184.5MB. Free memory was 151.0MB in the beginning and 150.9MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 185.04ms. Allocated memory is still 184.5MB. Free memory was 134.7MB in the beginning and 160.6MB in the end (delta: -25.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.12ms. Allocated memory is still 184.5MB. Free memory was 160.6MB in the beginning and 159.1MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 290.52ms. Allocated memory is still 184.5MB. Free memory was 159.1MB in the beginning and 148.0MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 32430.58ms. Allocated memory was 184.5MB in the beginning and 795.9MB in the end (delta: 611.3MB). Free memory was 147.4MB in the beginning and 457.2MB in the end (delta: -309.8MB). Peak memory consumption was 475.5MB. 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: 121]: 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, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.4s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 28.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1693 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1693 mSDsluCounter, 1341 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 135 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 832 IncrementalHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 1206 mSDtfsCounter, 832 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2057occurred in iteration=18, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 19 MinimizatonAttempts, 528 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 36 LocationsWithAnnotation, 36 PreInvPairs, 2605 NumberOfFragments, 9766 HoareAnnotationTreeSize, 36 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 11.1s HoareSimplificationTime, 36 FomulaSimplificationsInter, 148195 FormulaSimplificationTreeSizeReductionInter, 17.5s 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: 32]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - ProcedureContractResult [Line: 6]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-03-18 05:41:18,004 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...