./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label39.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label39.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c9e5fbdda66ebb475fc0f8bb519ddbac927ae9c052949a5df5d6f2e890e35299 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 16:24:15,577 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 16:24:15,637 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 16:24:15,644 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 16:24:15,644 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 16:24:15,674 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 16:24:15,675 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 16:24:15,675 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 16:24:15,676 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 16:24:15,678 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 16:24:15,678 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 16:24:15,679 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 16:24:15,679 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 16:24:15,680 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 16:24:15,680 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 16:24:15,680 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 16:24:15,681 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 16:24:15,681 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 16:24:15,681 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 16:24:15,681 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 16:24:15,682 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 16:24:15,686 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 16:24:15,686 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 16:24:15,686 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 16:24:15,686 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 16:24:15,687 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 16:24:15,687 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 16:24:15,687 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 16:24:15,688 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 16:24:15,688 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 16:24:15,688 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 16:24:15,688 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 16:24:15,689 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:24:15,689 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 16:24:15,690 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 16:24:15,690 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 16:24:15,690 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 16:24:15,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 16:24:15,691 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 16:24:15,691 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 16:24:15,692 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 16:24:15,692 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 16:24:15,692 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c9e5fbdda66ebb475fc0f8bb519ddbac927ae9c052949a5df5d6f2e890e35299 [2024-10-12 16:24:15,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 16:24:15,930 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 16:24:15,933 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 16:24:15,934 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 16:24:15,934 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 16:24:15,935 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label39.c [2024-10-12 16:24:17,253 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 16:24:17,527 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 16:24:17,528 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label39.c [2024-10-12 16:24:17,543 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6112ae70/0860a9b525f04038af704aac5c7115b9/FLAG9bbcad623 [2024-10-12 16:24:17,557 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6112ae70/0860a9b525f04038af704aac5c7115b9 [2024-10-12 16:24:17,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 16:24:17,560 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 16:24:17,562 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 16:24:17,563 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 16:24:17,567 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 16:24:17,567 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:24:17" (1/1) ... [2024-10-12 16:24:17,568 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52bfbb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:24:17, skipping insertion in model container [2024-10-12 16:24:17,569 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:24:17" (1/1) ... [2024-10-12 16:24:17,620 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 16:24:17,810 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label39.c[5211,5224] [2024-10-12 16:24:18,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:24:18,156 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 16:24:18,180 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label39.c[5211,5224] [2024-10-12 16:24:18,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:24:18,314 INFO L204 MainTranslator]: Completed translation [2024-10-12 16:24:18,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:24:18 WrapperNode [2024-10-12 16:24:18,315 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 16:24:18,316 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 16:24:18,316 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 16:24:18,316 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 16:24:18,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:24:18" (1/1) ... [2024-10-12 16:24:18,349 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:24:18" (1/1) ... [2024-10-12 16:24:18,461 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1770 [2024-10-12 16:24:18,462 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 16:24:18,463 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 16:24:18,463 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 16:24:18,463 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 16:24:18,473 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:24:18" (1/1) ... [2024-10-12 16:24:18,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:24:18" (1/1) ... [2024-10-12 16:24:18,488 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:24:18" (1/1) ... [2024-10-12 16:24:18,543 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 16:24:18,544 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:24:18" (1/1) ... [2024-10-12 16:24:18,544 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:24:18" (1/1) ... [2024-10-12 16:24:18,591 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:24:18" (1/1) ... [2024-10-12 16:24:18,603 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:24:18" (1/1) ... [2024-10-12 16:24:18,622 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:24:18" (1/1) ... [2024-10-12 16:24:18,634 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:24:18" (1/1) ... [2024-10-12 16:24:18,670 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 16:24:18,671 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 16:24:18,671 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 16:24:18,671 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 16:24:18,672 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:24:18" (1/1) ... [2024-10-12 16:24:18,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:24:18,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:24:18,700 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 16:24:18,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 16:24:18,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 16:24:18,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 16:24:18,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 16:24:18,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 16:24:18,800 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 16:24:18,802 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 16:24:20,372 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2024-10-12 16:24:20,373 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 16:24:20,419 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 16:24:20,422 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 16:24:20,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:24:20 BoogieIcfgContainer [2024-10-12 16:24:20,422 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 16:24:20,423 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 16:24:20,423 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 16:24:20,426 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 16:24:20,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 04:24:17" (1/3) ... [2024-10-12 16:24:20,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d5d0ecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:24:20, skipping insertion in model container [2024-10-12 16:24:20,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:24:18" (2/3) ... [2024-10-12 16:24:20,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d5d0ecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:24:20, skipping insertion in model container [2024-10-12 16:24:20,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:24:20" (3/3) ... [2024-10-12 16:24:20,428 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label39.c [2024-10-12 16:24:20,441 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 16:24:20,442 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 16:24:20,499 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 16:24:20,506 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@81ba544, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 16:24:20,506 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 16:24:20,511 INFO L276 IsEmpty]: Start isEmpty. Operand has 334 states, 332 states have (on average 1.9909638554216869) internal successors, (661), 333 states have internal predecessors, (661), 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) [2024-10-12 16:24:20,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-12 16:24:20,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:24:20,518 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:24:20,518 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:24:20,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:24:20,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1959756799, now seen corresponding path program 1 times [2024-10-12 16:24:20,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:24:20,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365426734] [2024-10-12 16:24:20,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:24:20,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:24:20,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:24:20,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:24:20,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:24:20,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365426734] [2024-10-12 16:24:20,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365426734] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:24:20,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:24:20,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:24:20,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227777536] [2024-10-12 16:24:20,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:24:20,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 16:24:20,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:24:20,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 16:24:20,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 16:24:20,733 INFO L87 Difference]: Start difference. First operand has 334 states, 332 states have (on average 1.9909638554216869) internal successors, (661), 333 states have internal predecessors, (661), 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) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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) [2024-10-12 16:24:20,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:24:20,791 INFO L93 Difference]: Finished difference Result 667 states and 1321 transitions. [2024-10-12 16:24:20,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 16:24:20,793 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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) Word has length 48 [2024-10-12 16:24:20,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:24:20,803 INFO L225 Difference]: With dead ends: 667 [2024-10-12 16:24:20,805 INFO L226 Difference]: Without dead ends: 332 [2024-10-12 16:24:20,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 16:24:20,815 INFO L432 NwaCegarLoop]: 596 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:24:20,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 596 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 16:24:20,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-10-12 16:24:20,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2024-10-12 16:24:20,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 1.8006042296072509) internal successors, (596), 331 states have internal predecessors, (596), 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) [2024-10-12 16:24:20,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 596 transitions. [2024-10-12 16:24:20,878 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 596 transitions. Word has length 48 [2024-10-12 16:24:20,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:24:20,879 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 596 transitions. [2024-10-12 16:24:20,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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) [2024-10-12 16:24:20,879 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 596 transitions. [2024-10-12 16:24:20,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-12 16:24:20,880 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:24:20,880 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:24:20,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 16:24:20,881 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:24:20,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:24:20,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1317355180, now seen corresponding path program 1 times [2024-10-12 16:24:20,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:24:20,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426275098] [2024-10-12 16:24:20,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:24:20,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:24:20,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:24:21,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:24:21,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:24:21,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426275098] [2024-10-12 16:24:21,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426275098] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:24:21,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:24:21,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:24:21,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78430314] [2024-10-12 16:24:21,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:24:21,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:24:21,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:24:21,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:24:21,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:24:21,072 INFO L87 Difference]: Start difference. First operand 332 states and 596 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 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) [2024-10-12 16:24:22,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:24:22,277 INFO L93 Difference]: Finished difference Result 992 states and 1785 transitions. [2024-10-12 16:24:22,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:24:22,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 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) Word has length 48 [2024-10-12 16:24:22,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:24:22,282 INFO L225 Difference]: With dead ends: 992 [2024-10-12 16:24:22,282 INFO L226 Difference]: Without dead ends: 661 [2024-10-12 16:24:22,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:24:22,284 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 307 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 995 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:24:22,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 156 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 995 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 16:24:22,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2024-10-12 16:24:22,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2024-10-12 16:24:22,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 660 states have (on average 1.5833333333333333) internal successors, (1045), 660 states have internal predecessors, (1045), 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) [2024-10-12 16:24:22,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 1045 transitions. [2024-10-12 16:24:22,326 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 1045 transitions. Word has length 48 [2024-10-12 16:24:22,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:24:22,326 INFO L471 AbstractCegarLoop]: Abstraction has 661 states and 1045 transitions. [2024-10-12 16:24:22,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 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) [2024-10-12 16:24:22,327 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 1045 transitions. [2024-10-12 16:24:22,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-12 16:24:22,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:24:22,332 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:24:22,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 16:24:22,333 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:24:22,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:24:22,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1149434664, now seen corresponding path program 1 times [2024-10-12 16:24:22,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:24:22,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719388971] [2024-10-12 16:24:22,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:24:22,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:24:22,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:24:22,503 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:24:22,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:24:22,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719388971] [2024-10-12 16:24:22,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719388971] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:24:22,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:24:22,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:24:22,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185175220] [2024-10-12 16:24:22,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:24:22,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:24:22,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:24:22,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:24:22,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:24:22,509 INFO L87 Difference]: Start difference. First operand 661 states and 1045 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 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) [2024-10-12 16:24:23,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:24:23,482 INFO L93 Difference]: Finished difference Result 1650 states and 2538 transitions. [2024-10-12 16:24:23,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:24:23,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 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) Word has length 119 [2024-10-12 16:24:23,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:24:23,486 INFO L225 Difference]: With dead ends: 1650 [2024-10-12 16:24:23,486 INFO L226 Difference]: Without dead ends: 990 [2024-10-12 16:24:23,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:24:23,492 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 338 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 16:24:23,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 75 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 16:24:23,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2024-10-12 16:24:23,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 990. [2024-10-12 16:24:23,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 989 states have (on average 1.3771486349848332) internal successors, (1362), 989 states have internal predecessors, (1362), 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) [2024-10-12 16:24:23,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1362 transitions. [2024-10-12 16:24:23,520 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1362 transitions. Word has length 119 [2024-10-12 16:24:23,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:24:23,522 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1362 transitions. [2024-10-12 16:24:23,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 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) [2024-10-12 16:24:23,525 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1362 transitions. [2024-10-12 16:24:23,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-12 16:24:23,528 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:24:23,528 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:24:23,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 16:24:23,528 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:24:23,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:24:23,529 INFO L85 PathProgramCache]: Analyzing trace with hash 681944899, now seen corresponding path program 1 times [2024-10-12 16:24:23,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:24:23,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032023933] [2024-10-12 16:24:23,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:24:23,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:24:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:24:23,669 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:24:23,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:24:23,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032023933] [2024-10-12 16:24:23,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032023933] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:24:23,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:24:23,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:24:23,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464376132] [2024-10-12 16:24:23,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:24:23,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:24:23,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:24:23,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:24:23,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:24:23,696 INFO L87 Difference]: Start difference. First operand 990 states and 1362 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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) [2024-10-12 16:24:24,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:24:24,780 INFO L93 Difference]: Finished difference Result 2966 states and 4083 transitions. [2024-10-12 16:24:24,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:24:24,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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) Word has length 120 [2024-10-12 16:24:24,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:24:24,786 INFO L225 Difference]: With dead ends: 2966 [2024-10-12 16:24:24,786 INFO L226 Difference]: Without dead ends: 1977 [2024-10-12 16:24:24,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:24:24,789 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 289 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:24:24,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 207 Invalid, 1197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 16:24:24,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2024-10-12 16:24:24,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1977. [2024-10-12 16:24:24,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1977 states, 1976 states have (on average 1.2469635627530364) internal successors, (2464), 1976 states have internal predecessors, (2464), 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) [2024-10-12 16:24:24,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1977 states to 1977 states and 2464 transitions. [2024-10-12 16:24:24,821 INFO L78 Accepts]: Start accepts. Automaton has 1977 states and 2464 transitions. Word has length 120 [2024-10-12 16:24:24,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:24:24,823 INFO L471 AbstractCegarLoop]: Abstraction has 1977 states and 2464 transitions. [2024-10-12 16:24:24,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 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) [2024-10-12 16:24:24,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 2464 transitions. [2024-10-12 16:24:24,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-12 16:24:24,828 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:24:24,828 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:24:24,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 16:24:24,829 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:24:24,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:24:24,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1859406256, now seen corresponding path program 1 times [2024-10-12 16:24:24,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:24:24,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108513893] [2024-10-12 16:24:24,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:24:24,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:24:24,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:24:24,944 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:24:24,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:24:24,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108513893] [2024-10-12 16:24:24,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108513893] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:24:24,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:24:24,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:24:24,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407717048] [2024-10-12 16:24:24,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:24:24,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:24:24,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:24:24,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:24:24,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:24:24,948 INFO L87 Difference]: Start difference. First operand 1977 states and 2464 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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) [2024-10-12 16:24:25,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:24:25,999 INFO L93 Difference]: Finished difference Result 4611 states and 5851 transitions. [2024-10-12 16:24:25,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:24:25,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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) Word has length 135 [2024-10-12 16:24:26,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:24:26,006 INFO L225 Difference]: With dead ends: 4611 [2024-10-12 16:24:26,007 INFO L226 Difference]: Without dead ends: 2635 [2024-10-12 16:24:26,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:24:26,009 INFO L432 NwaCegarLoop]: 531 mSDtfsCounter, 335 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:24:26,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 536 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 16:24:26,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states. [2024-10-12 16:24:26,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 2635. [2024-10-12 16:24:26,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2635 states, 2634 states have (on average 1.2171602126044039) internal successors, (3206), 2634 states have internal predecessors, (3206), 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) [2024-10-12 16:24:26,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 3206 transitions. [2024-10-12 16:24:26,044 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 3206 transitions. Word has length 135 [2024-10-12 16:24:26,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:24:26,045 INFO L471 AbstractCegarLoop]: Abstraction has 2635 states and 3206 transitions. [2024-10-12 16:24:26,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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) [2024-10-12 16:24:26,045 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 3206 transitions. [2024-10-12 16:24:26,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2024-10-12 16:24:26,048 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:24:26,049 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:24:26,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 16:24:26,049 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:24:26,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:24:26,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1182569788, now seen corresponding path program 1 times [2024-10-12 16:24:26,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:24:26,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582710979] [2024-10-12 16:24:26,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:24:26,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:24:26,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:24:26,256 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-10-12 16:24:26,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:24:26,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582710979] [2024-10-12 16:24:26,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582710979] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:24:26,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:24:26,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:24:26,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611958020] [2024-10-12 16:24:26,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:24:26,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:24:26,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:24:26,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:24:26,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:24:26,260 INFO L87 Difference]: Start difference. First operand 2635 states and 3206 transitions. Second operand has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 2 states have internal predecessors, (197), 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) [2024-10-12 16:24:27,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:24:27,157 INFO L93 Difference]: Finished difference Result 6585 states and 8077 transitions. [2024-10-12 16:24:27,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:24:27,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 2 states have internal predecessors, (197), 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) Word has length 320 [2024-10-12 16:24:27,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:24:27,170 INFO L225 Difference]: With dead ends: 6585 [2024-10-12 16:24:27,171 INFO L226 Difference]: Without dead ends: 3293 [2024-10-12 16:24:27,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:24:27,177 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 358 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 16:24:27,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 154 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 16:24:27,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3293 states. [2024-10-12 16:24:27,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3293 to 3293. [2024-10-12 16:24:27,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3293 states, 3292 states have (on average 1.0653098420413123) internal successors, (3507), 3292 states have internal predecessors, (3507), 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) [2024-10-12 16:24:27,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3293 states to 3293 states and 3507 transitions. [2024-10-12 16:24:27,217 INFO L78 Accepts]: Start accepts. Automaton has 3293 states and 3507 transitions. Word has length 320 [2024-10-12 16:24:27,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:24:27,217 INFO L471 AbstractCegarLoop]: Abstraction has 3293 states and 3507 transitions. [2024-10-12 16:24:27,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 2 states have internal predecessors, (197), 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) [2024-10-12 16:24:27,218 INFO L276 IsEmpty]: Start isEmpty. Operand 3293 states and 3507 transitions. [2024-10-12 16:24:27,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2024-10-12 16:24:27,224 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:24:27,224 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:24:27,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 16:24:27,224 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:24:27,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:24:27,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1289122400, now seen corresponding path program 1 times [2024-10-12 16:24:27,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:24:27,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064947522] [2024-10-12 16:24:27,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:24:27,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:24:27,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:24:27,680 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 331 proven. 0 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2024-10-12 16:24:27,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:24:27,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064947522] [2024-10-12 16:24:27,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064947522] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:24:27,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:24:27,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:24:27,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797866111] [2024-10-12 16:24:27,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:24:27,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:24:27,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:24:27,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:24:27,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:24:27,682 INFO L87 Difference]: Start difference. First operand 3293 states and 3507 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 2 states have internal predecessors, (225), 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) [2024-10-12 16:24:28,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:24:28,486 INFO L93 Difference]: Finished difference Result 9546 states and 10183 transitions. [2024-10-12 16:24:28,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:24:28,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 2 states have internal predecessors, (225), 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) Word has length 486 [2024-10-12 16:24:28,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:24:28,501 INFO L225 Difference]: With dead ends: 9546 [2024-10-12 16:24:28,501 INFO L226 Difference]: Without dead ends: 6254 [2024-10-12 16:24:28,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:24:28,507 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 240 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 16:24:28,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 68 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 16:24:28,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6254 states. [2024-10-12 16:24:28,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6254 to 6254. [2024-10-12 16:24:28,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6254 states, 6253 states have (on average 1.060610906764753) internal successors, (6632), 6253 states have internal predecessors, (6632), 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) [2024-10-12 16:24:28,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6254 states to 6254 states and 6632 transitions. [2024-10-12 16:24:28,592 INFO L78 Accepts]: Start accepts. Automaton has 6254 states and 6632 transitions. Word has length 486 [2024-10-12 16:24:28,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:24:28,593 INFO L471 AbstractCegarLoop]: Abstraction has 6254 states and 6632 transitions. [2024-10-12 16:24:28,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 2 states have internal predecessors, (225), 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) [2024-10-12 16:24:28,594 INFO L276 IsEmpty]: Start isEmpty. Operand 6254 states and 6632 transitions. [2024-10-12 16:24:28,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2024-10-12 16:24:28,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:24:28,601 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:24:28,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 16:24:28,601 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:24:28,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:24:28,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1420442295, now seen corresponding path program 1 times [2024-10-12 16:24:28,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:24:28,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071492897] [2024-10-12 16:24:28,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:24:28,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:24:28,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:24:29,163 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-10-12 16:24:29,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:24:29,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071492897] [2024-10-12 16:24:29,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071492897] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:24:29,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:24:29,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:24:29,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770375608] [2024-10-12 16:24:29,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:24:29,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:24:29,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:24:29,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:24:29,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:24:29,165 INFO L87 Difference]: Start difference. First operand 6254 states and 6632 transitions. Second operand has 4 states, 4 states have (on average 89.75) internal successors, (359), 3 states have internal predecessors, (359), 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) [2024-10-12 16:24:30,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:24:30,019 INFO L93 Difference]: Finished difference Result 12178 states and 12931 transitions. [2024-10-12 16:24:30,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:24:30,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 89.75) internal successors, (359), 3 states have internal predecessors, (359), 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) Word has length 510 [2024-10-12 16:24:30,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:24:30,036 INFO L225 Difference]: With dead ends: 12178 [2024-10-12 16:24:30,036 INFO L226 Difference]: Without dead ends: 6254 [2024-10-12 16:24:30,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 16:24:30,042 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 127 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 1163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 16:24:30,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 122 Invalid, 1163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1163 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 16:24:30,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6254 states. [2024-10-12 16:24:30,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6254 to 6254. [2024-10-12 16:24:30,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6254 states, 6253 states have (on average 1.0604509835279066) internal successors, (6631), 6253 states have internal predecessors, (6631), 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) [2024-10-12 16:24:30,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6254 states to 6254 states and 6631 transitions. [2024-10-12 16:24:30,114 INFO L78 Accepts]: Start accepts. Automaton has 6254 states and 6631 transitions. Word has length 510 [2024-10-12 16:24:30,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:24:30,114 INFO L471 AbstractCegarLoop]: Abstraction has 6254 states and 6631 transitions. [2024-10-12 16:24:30,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.75) internal successors, (359), 3 states have internal predecessors, (359), 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) [2024-10-12 16:24:30,115 INFO L276 IsEmpty]: Start isEmpty. Operand 6254 states and 6631 transitions. [2024-10-12 16:24:30,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2024-10-12 16:24:30,123 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:24:30,123 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:24:30,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 16:24:30,123 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:24:30,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:24:30,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1787076317, now seen corresponding path program 1 times [2024-10-12 16:24:30,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:24:30,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847780526] [2024-10-12 16:24:30,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:24:30,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:24:30,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:24:30,755 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 649 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-10-12 16:24:30,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:24:30,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847780526] [2024-10-12 16:24:30,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847780526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:24:30,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:24:30,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:24:30,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717243703] [2024-10-12 16:24:30,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:24:30,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:24:30,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:24:30,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:24:30,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:24:30,758 INFO L87 Difference]: Start difference. First operand 6254 states and 6631 transitions. Second operand has 4 states, 4 states have (on average 118.5) internal successors, (474), 3 states have internal predecessors, (474), 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) [2024-10-12 16:24:31,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:24:31,869 INFO L93 Difference]: Finished difference Result 16784 states and 17897 transitions. [2024-10-12 16:24:31,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:24:31,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 3 states have internal predecessors, (474), 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) Word has length 625 [2024-10-12 16:24:31,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:24:31,903 INFO L225 Difference]: With dead ends: 16784 [2024-10-12 16:24:31,906 INFO L226 Difference]: Without dead ends: 10860 [2024-10-12 16:24:31,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:24:31,917 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 398 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1229 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 1370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:24:31,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 70 Invalid, 1370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1229 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 16:24:31,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10860 states. [2024-10-12 16:24:32,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10860 to 9873. [2024-10-12 16:24:32,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9873 states, 9872 states have (on average 1.0590559157212318) internal successors, (10455), 9872 states have internal predecessors, (10455), 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) [2024-10-12 16:24:32,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9873 states to 9873 states and 10455 transitions. [2024-10-12 16:24:32,040 INFO L78 Accepts]: Start accepts. Automaton has 9873 states and 10455 transitions. Word has length 625 [2024-10-12 16:24:32,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:24:32,041 INFO L471 AbstractCegarLoop]: Abstraction has 9873 states and 10455 transitions. [2024-10-12 16:24:32,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 3 states have internal predecessors, (474), 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) [2024-10-12 16:24:32,042 INFO L276 IsEmpty]: Start isEmpty. Operand 9873 states and 10455 transitions. [2024-10-12 16:24:32,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 730 [2024-10-12 16:24:32,055 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:24:32,056 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:24:32,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 16:24:32,056 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:24:32,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:24:32,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1309140318, now seen corresponding path program 1 times [2024-10-12 16:24:32,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:24:32,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293383686] [2024-10-12 16:24:32,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:24:32,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:24:32,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:24:32,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1279 backedges. 984 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2024-10-12 16:24:32,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:24:32,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293383686] [2024-10-12 16:24:32,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293383686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:24:32,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:24:32,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:24:32,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256773354] [2024-10-12 16:24:32,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:24:32,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:24:32,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:24:32,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:24:32,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:24:32,622 INFO L87 Difference]: Start difference. First operand 9873 states and 10455 transitions. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 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) [2024-10-12 16:24:33,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:24:33,275 INFO L93 Difference]: Finished difference Result 23035 states and 24563 transitions. [2024-10-12 16:24:33,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:24:33,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 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) Word has length 729 [2024-10-12 16:24:33,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:24:33,300 INFO L225 Difference]: With dead ends: 23035 [2024-10-12 16:24:33,301 INFO L226 Difference]: Without dead ends: 13821 [2024-10-12 16:24:33,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:24:33,311 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 222 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:24:33,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 34 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 16:24:33,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13821 states. [2024-10-12 16:24:33,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13821 to 13821. [2024-10-12 16:24:33,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13821 states, 13820 states have (on average 1.0627351664254703) internal successors, (14687), 13820 states have internal predecessors, (14687), 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) [2024-10-12 16:24:33,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13821 states to 13821 states and 14687 transitions. [2024-10-12 16:24:33,507 INFO L78 Accepts]: Start accepts. Automaton has 13821 states and 14687 transitions. Word has length 729 [2024-10-12 16:24:33,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:24:33,507 INFO L471 AbstractCegarLoop]: Abstraction has 13821 states and 14687 transitions. [2024-10-12 16:24:33,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 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) [2024-10-12 16:24:33,508 INFO L276 IsEmpty]: Start isEmpty. Operand 13821 states and 14687 transitions. [2024-10-12 16:24:33,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 987 [2024-10-12 16:24:33,528 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:24:33,529 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:24:33,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 16:24:33,529 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:24:33,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:24:33,530 INFO L85 PathProgramCache]: Analyzing trace with hash -305272858, now seen corresponding path program 1 times [2024-10-12 16:24:33,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:24:33,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078231069] [2024-10-12 16:24:33,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:24:33,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:24:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:24:34,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2495 backedges. 1335 proven. 0 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2024-10-12 16:24:34,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:24:34,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078231069] [2024-10-12 16:24:34,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078231069] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:24:34,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:24:34,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:24:34,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367338146] [2024-10-12 16:24:34,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:24:34,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:24:34,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:24:34,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:24:34,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:24:34,501 INFO L87 Difference]: Start difference. First operand 13821 states and 14687 transitions. Second operand has 4 states, 4 states have (on average 134.25) internal successors, (537), 3 states have internal predecessors, (537), 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) [2024-10-12 16:24:35,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:24:35,243 INFO L93 Difference]: Finished difference Result 26983 states and 28706 transitions. [2024-10-12 16:24:35,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:24:35,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 134.25) internal successors, (537), 3 states have internal predecessors, (537), 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) Word has length 986 [2024-10-12 16:24:35,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:24:35,262 INFO L225 Difference]: With dead ends: 26983 [2024-10-12 16:24:35,262 INFO L226 Difference]: Without dead ends: 13821 [2024-10-12 16:24:35,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:24:35,275 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 172 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1174 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:24:35,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 108 Invalid, 1177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1174 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 16:24:35,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13821 states. [2024-10-12 16:24:35,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13821 to 13821. [2024-10-12 16:24:35,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13821 states, 13820 states have (on average 1.0625180897250361) internal successors, (14684), 13820 states have internal predecessors, (14684), 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) [2024-10-12 16:24:35,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13821 states to 13821 states and 14684 transitions. [2024-10-12 16:24:35,411 INFO L78 Accepts]: Start accepts. Automaton has 13821 states and 14684 transitions. Word has length 986 [2024-10-12 16:24:35,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:24:35,412 INFO L471 AbstractCegarLoop]: Abstraction has 13821 states and 14684 transitions. [2024-10-12 16:24:35,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.25) internal successors, (537), 3 states have internal predecessors, (537), 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) [2024-10-12 16:24:35,412 INFO L276 IsEmpty]: Start isEmpty. Operand 13821 states and 14684 transitions. [2024-10-12 16:24:35,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1048 [2024-10-12 16:24:35,429 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:24:35,430 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:24:35,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 16:24:35,430 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:24:35,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:24:35,431 INFO L85 PathProgramCache]: Analyzing trace with hash 403537538, now seen corresponding path program 1 times [2024-10-12 16:24:35,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:24:35,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449511449] [2024-10-12 16:24:35,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:24:35,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:24:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:24:35,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 1695 proven. 0 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-10-12 16:24:35,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:24:35,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449511449] [2024-10-12 16:24:35,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449511449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:24:35,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:24:35,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:24:35,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518034448] [2024-10-12 16:24:35,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:24:35,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:24:35,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:24:35,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:24:35,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:24:35,969 INFO L87 Difference]: Start difference. First operand 13821 states and 14684 transitions. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 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) [2024-10-12 16:24:36,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:24:36,700 INFO L93 Difference]: Finished difference Result 29615 states and 31582 transitions. [2024-10-12 16:24:36,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:24:36,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 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) Word has length 1047 [2024-10-12 16:24:36,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:24:36,724 INFO L225 Difference]: With dead ends: 29615 [2024-10-12 16:24:36,724 INFO L226 Difference]: Without dead ends: 16453 [2024-10-12 16:24:36,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:24:36,739 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 220 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:24:36,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 427 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 16:24:36,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16453 states. [2024-10-12 16:24:36,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16453 to 15795. [2024-10-12 16:24:36,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15795 states, 15794 states have (on average 1.0509054071166266) internal successors, (16598), 15794 states have internal predecessors, (16598), 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) [2024-10-12 16:24:36,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15795 states to 15795 states and 16598 transitions. [2024-10-12 16:24:36,935 INFO L78 Accepts]: Start accepts. Automaton has 15795 states and 16598 transitions. Word has length 1047 [2024-10-12 16:24:36,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:24:36,936 INFO L471 AbstractCegarLoop]: Abstraction has 15795 states and 16598 transitions. [2024-10-12 16:24:36,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 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) [2024-10-12 16:24:36,936 INFO L276 IsEmpty]: Start isEmpty. Operand 15795 states and 16598 transitions. [2024-10-12 16:24:36,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1049 [2024-10-12 16:24:36,958 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:24:36,959 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:24:36,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 16:24:36,959 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:24:36,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:24:36,960 INFO L85 PathProgramCache]: Analyzing trace with hash 2081000641, now seen corresponding path program 1 times [2024-10-12 16:24:36,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:24:36,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667019883] [2024-10-12 16:24:36,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:24:36,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:24:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:24:37,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2562 backedges. 1453 proven. 0 refuted. 0 times theorem prover too weak. 1109 trivial. 0 not checked. [2024-10-12 16:24:37,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:24:37,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667019883] [2024-10-12 16:24:37,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667019883] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:24:37,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:24:37,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:24:37,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723242022] [2024-10-12 16:24:37,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:24:37,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:24:37,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:24:37,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:24:37,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:24:37,504 INFO L87 Difference]: Start difference. First operand 15795 states and 16598 transitions. Second operand has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 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) [2024-10-12 16:24:38,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:24:38,175 INFO L93 Difference]: Finished difference Result 32247 states and 33925 transitions. [2024-10-12 16:24:38,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:24:38,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 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) Word has length 1048 [2024-10-12 16:24:38,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:24:38,198 INFO L225 Difference]: With dead ends: 32247 [2024-10-12 16:24:38,199 INFO L226 Difference]: Without dead ends: 17111 [2024-10-12 16:24:38,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:24:38,214 INFO L432 NwaCegarLoop]: 417 mSDtfsCounter, 192 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:24:38,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 422 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 16:24:38,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17111 states. [2024-10-12 16:24:38,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17111 to 16453. [2024-10-12 16:24:38,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16453 states, 16452 states have (on average 1.0432774130804765) internal successors, (17164), 16452 states have internal predecessors, (17164), 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) [2024-10-12 16:24:38,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16453 states to 16453 states and 17164 transitions. [2024-10-12 16:24:38,370 INFO L78 Accepts]: Start accepts. Automaton has 16453 states and 17164 transitions. Word has length 1048 [2024-10-12 16:24:38,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:24:38,371 INFO L471 AbstractCegarLoop]: Abstraction has 16453 states and 17164 transitions. [2024-10-12 16:24:38,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 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) [2024-10-12 16:24:38,371 INFO L276 IsEmpty]: Start isEmpty. Operand 16453 states and 17164 transitions. [2024-10-12 16:24:38,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1078 [2024-10-12 16:24:38,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:24:38,385 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:24:38,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 16:24:38,386 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:24:38,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:24:38,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1726266360, now seen corresponding path program 1 times [2024-10-12 16:24:38,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:24:38,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668284638] [2024-10-12 16:24:38,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:24:38,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:24:38,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:24:38,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2661 backedges. 1797 proven. 0 refuted. 0 times theorem prover too weak. 864 trivial. 0 not checked. [2024-10-12 16:24:38,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:24:38,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668284638] [2024-10-12 16:24:38,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668284638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:24:38,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:24:38,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:24:38,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582833238] [2024-10-12 16:24:38,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:24:38,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:24:38,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:24:38,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:24:38,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:24:38,975 INFO L87 Difference]: Start difference. First operand 16453 states and 17164 transitions. Second operand has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 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) [2024-10-12 16:24:39,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:24:39,595 INFO L93 Difference]: Finished difference Result 32247 states and 33663 transitions. [2024-10-12 16:24:39,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:24:39,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 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) Word has length 1077 [2024-10-12 16:24:39,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:24:39,615 INFO L225 Difference]: With dead ends: 32247 [2024-10-12 16:24:39,616 INFO L226 Difference]: Without dead ends: 16453 [2024-10-12 16:24:39,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:24:39,627 INFO L432 NwaCegarLoop]: 416 mSDtfsCounter, 193 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:24:39,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 421 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 16:24:39,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16453 states. [2024-10-12 16:24:39,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16453 to 16124. [2024-10-12 16:24:39,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16124 states, 16123 states have (on average 1.0326242014513427) internal successors, (16649), 16123 states have internal predecessors, (16649), 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) [2024-10-12 16:24:39,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16124 states to 16124 states and 16649 transitions. [2024-10-12 16:24:39,783 INFO L78 Accepts]: Start accepts. Automaton has 16124 states and 16649 transitions. Word has length 1077 [2024-10-12 16:24:39,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:24:39,783 INFO L471 AbstractCegarLoop]: Abstraction has 16124 states and 16649 transitions. [2024-10-12 16:24:39,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 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) [2024-10-12 16:24:39,784 INFO L276 IsEmpty]: Start isEmpty. Operand 16124 states and 16649 transitions. [2024-10-12 16:24:39,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1088 [2024-10-12 16:24:39,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:24:39,797 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:24:39,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 16:24:39,797 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:24:39,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:24:39,798 INFO L85 PathProgramCache]: Analyzing trace with hash 742267290, now seen corresponding path program 1 times [2024-10-12 16:24:39,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:24:39,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554750018] [2024-10-12 16:24:39,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:24:39,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:24:39,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:24:40,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1976 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 1742 trivial. 0 not checked. [2024-10-12 16:24:40,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:24:40,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554750018] [2024-10-12 16:24:40,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554750018] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:24:40,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:24:40,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:24:40,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674394683] [2024-10-12 16:24:40,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:24:40,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:24:40,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:24:40,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:24:40,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:24:40,954 INFO L87 Difference]: Start difference. First operand 16124 states and 16649 transitions. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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) [2024-10-12 16:24:41,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:24:41,695 INFO L93 Difference]: Finished difference Result 31918 states and 32966 transitions. [2024-10-12 16:24:41,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:24:41,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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) Word has length 1087 [2024-10-12 16:24:41,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:24:41,715 INFO L225 Difference]: With dead ends: 31918 [2024-10-12 16:24:41,715 INFO L226 Difference]: Without dead ends: 16124 [2024-10-12 16:24:41,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:24:41,728 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 291 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:24:41,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 365 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 16:24:41,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16124 states. [2024-10-12 16:24:41,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16124 to 15466. [2024-10-12 16:24:41,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15466 states, 15465 states have (on average 1.027804720336243) internal successors, (15895), 15465 states have internal predecessors, (15895), 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) [2024-10-12 16:24:41,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15466 states to 15466 states and 15895 transitions. [2024-10-12 16:24:41,909 INFO L78 Accepts]: Start accepts. Automaton has 15466 states and 15895 transitions. Word has length 1087 [2024-10-12 16:24:41,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:24:41,910 INFO L471 AbstractCegarLoop]: Abstraction has 15466 states and 15895 transitions. [2024-10-12 16:24:41,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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) [2024-10-12 16:24:41,911 INFO L276 IsEmpty]: Start isEmpty. Operand 15466 states and 15895 transitions. [2024-10-12 16:24:41,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1136 [2024-10-12 16:24:41,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:24:41,925 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:24:41,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 16:24:41,926 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:24:41,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:24:41,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1735039277, now seen corresponding path program 1 times [2024-10-12 16:24:41,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:24:41,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238101190] [2024-10-12 16:24:41,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:24:41,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:24:42,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:24:42,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2913 backedges. 328 proven. 0 refuted. 0 times theorem prover too weak. 2585 trivial. 0 not checked. [2024-10-12 16:24:42,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:24:42,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238101190] [2024-10-12 16:24:42,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238101190] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:24:42,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:24:42,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:24:42,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758917796] [2024-10-12 16:24:42,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:24:42,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:24:42,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:24:42,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:24:42,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:24:42,469 INFO L87 Difference]: Start difference. First operand 15466 states and 15895 transitions. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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) [2024-10-12 16:24:43,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:24:43,128 INFO L93 Difference]: Finished difference Result 33563 states and 34578 transitions. [2024-10-12 16:24:43,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:24:43,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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) Word has length 1135 [2024-10-12 16:24:43,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:24:43,145 INFO L225 Difference]: With dead ends: 33563 [2024-10-12 16:24:43,146 INFO L226 Difference]: Without dead ends: 16453 [2024-10-12 16:24:43,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:24:43,158 INFO L432 NwaCegarLoop]: 404 mSDtfsCounter, 294 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:24:43,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 409 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 16:24:43,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16453 states. [2024-10-12 16:24:43,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16453 to 14150. [2024-10-12 16:24:43,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14150 states, 14149 states have (on average 1.0253021414940986) internal successors, (14507), 14149 states have internal predecessors, (14507), 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) [2024-10-12 16:24:43,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14150 states to 14150 states and 14507 transitions. [2024-10-12 16:24:43,294 INFO L78 Accepts]: Start accepts. Automaton has 14150 states and 14507 transitions. Word has length 1135 [2024-10-12 16:24:43,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:24:43,295 INFO L471 AbstractCegarLoop]: Abstraction has 14150 states and 14507 transitions. [2024-10-12 16:24:43,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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) [2024-10-12 16:24:43,295 INFO L276 IsEmpty]: Start isEmpty. Operand 14150 states and 14507 transitions. [2024-10-12 16:24:43,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1627 [2024-10-12 16:24:43,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:24:43,318 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:24:43,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 16:24:43,319 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:24:43,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:24:43,319 INFO L85 PathProgramCache]: Analyzing trace with hash -176658699, now seen corresponding path program 1 times [2024-10-12 16:24:43,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:24:43,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806741384] [2024-10-12 16:24:43,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:24:43,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:24:43,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:24:44,920 INFO L134 CoverageAnalysis]: Checked inductivity of 4267 backedges. 2462 proven. 0 refuted. 0 times theorem prover too weak. 1805 trivial. 0 not checked. [2024-10-12 16:24:44,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:24:44,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806741384] [2024-10-12 16:24:44,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806741384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:24:44,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:24:44,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:24:44,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579025543] [2024-10-12 16:24:44,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:24:44,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:24:44,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:24:44,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:24:44,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:24:44,925 INFO L87 Difference]: Start difference. First operand 14150 states and 14507 transitions. Second operand has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 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) [2024-10-12 16:24:45,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:24:45,473 INFO L93 Difference]: Finished difference Result 27639 states and 28350 transitions. [2024-10-12 16:24:45,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:24:45,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 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) Word has length 1626 [2024-10-12 16:24:45,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:24:45,475 INFO L225 Difference]: With dead ends: 27639 [2024-10-12 16:24:45,475 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 16:24:45,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:24:45,487 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 34 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 16:24:45,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 371 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 16:24:45,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 16:24:45,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 16:24:45,487 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) [2024-10-12 16:24:45,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 16:24:45,488 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1626 [2024-10-12 16:24:45,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:24:45,488 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 16:24:45,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 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) [2024-10-12 16:24:45,488 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 16:24:45,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 16:24:45,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 16:24:45,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 16:24:45,493 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:24:45,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 16:24:46,010 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 16:24:46,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 04:24:46 BoogieIcfgContainer [2024-10-12 16:24:46,027 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 16:24:46,028 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 16:24:46,028 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 16:24:46,028 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 16:24:46,028 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:24:20" (3/4) ... [2024-10-12 16:24:46,030 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 16:24:46,054 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-12 16:24:46,056 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-12 16:24:46,057 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 16:24:46,059 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 16:24:46,220 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 16:24:46,220 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 16:24:46,220 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 16:24:46,221 INFO L158 Benchmark]: Toolchain (without parser) took 28660.46ms. Allocated memory was 161.5MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 84.8MB in the beginning and 802.8MB in the end (delta: -718.0MB). Peak memory consumption was 508.1MB. Max. memory is 16.1GB. [2024-10-12 16:24:46,221 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 161.5MB. Free memory is still 112.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 16:24:46,221 INFO L158 Benchmark]: CACSL2BoogieTranslator took 753.64ms. Allocated memory was 161.5MB in the beginning and 228.6MB in the end (delta: 67.1MB). Free memory was 84.6MB in the beginning and 157.8MB in the end (delta: -73.2MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. [2024-10-12 16:24:46,221 INFO L158 Benchmark]: Boogie Procedure Inliner took 146.07ms. Allocated memory is still 228.6MB. Free memory was 157.8MB in the beginning and 133.7MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-12 16:24:46,222 INFO L158 Benchmark]: Boogie Preprocessor took 207.68ms. Allocated memory is still 228.6MB. Free memory was 133.7MB in the beginning and 99.1MB in the end (delta: 34.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-12 16:24:46,222 INFO L158 Benchmark]: RCFGBuilder took 1751.43ms. Allocated memory is still 228.6MB. Free memory was 99.1MB in the beginning and 86.2MB in the end (delta: 12.8MB). Peak memory consumption was 70.5MB. Max. memory is 16.1GB. [2024-10-12 16:24:46,222 INFO L158 Benchmark]: TraceAbstraction took 25603.92ms. Allocated memory was 228.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 86.2MB in the beginning and 829.0MB in the end (delta: -742.8MB). Peak memory consumption was 415.9MB. Max. memory is 16.1GB. [2024-10-12 16:24:46,222 INFO L158 Benchmark]: Witness Printer took 192.70ms. Allocated memory is still 1.4GB. Free memory was 829.0MB in the beginning and 802.8MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-12 16:24:46,223 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 161.5MB. Free memory is still 112.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 753.64ms. Allocated memory was 161.5MB in the beginning and 228.6MB in the end (delta: 67.1MB). Free memory was 84.6MB in the beginning and 157.8MB in the end (delta: -73.2MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 146.07ms. Allocated memory is still 228.6MB. Free memory was 157.8MB in the beginning and 133.7MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 207.68ms. Allocated memory is still 228.6MB. Free memory was 133.7MB in the beginning and 99.1MB in the end (delta: 34.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * RCFGBuilder took 1751.43ms. Allocated memory is still 228.6MB. Free memory was 99.1MB in the beginning and 86.2MB in the end (delta: 12.8MB). Peak memory consumption was 70.5MB. Max. memory is 16.1GB. * TraceAbstraction took 25603.92ms. Allocated memory was 228.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 86.2MB in the beginning and 829.0MB in the end (delta: -742.8MB). Peak memory consumption was 415.9MB. Max. memory is 16.1GB. * Witness Printer took 192.70ms. Allocated memory is still 1.4GB. Free memory was 829.0MB in the beginning and 802.8MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * 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: 164]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 334 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.0s, OverallIterations: 17, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 13.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4010 SdHoareTripleChecker+Valid, 12.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4010 mSDsluCounter, 4541 SdHoareTripleChecker+Invalid, 10.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 99 mSDsCounter, 2224 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13969 IncrementalHoareTripleChecker+Invalid, 16193 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2224 mSolverCounterUnsat, 4442 mSDtfsCounter, 13969 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16453occurred in iteration=13, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 5593 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 11146 NumberOfCodeBlocks, 11146 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 11129 ConstructedInterpolants, 0 QuantifiedInterpolants, 23665 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 23335/23335 InterpolantCoveringCapability, 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: 1783]: Loop Invariant Derived loop invariant: ((((((((((((((((a15 != 3) && (a12 <= 7)) && (a16 <= 11)) || (((0 <= ((long long) 87 + a18)) && (a15 <= 3)) && (a12 <= 6))) || ((a16 <= 8) && (a12 == 9))) || ((a16 <= 8) && (a12 == 8))) || (((0 <= ((long long) 87 + a18)) && (a12 == 9)) && (a15 <= 3))) || ((a15 <= 3) && (7 == a12))) || ((a12 <= 5) && (a16 == 9))) || ((a16 == 9) && (a12 == 8))) || ((a15 <= 3) && (a12 == 8))) || ((a16 <= 8) && (a15 <= 3))) || (((5 != a12) && (a12 <= 7)) && (a16 <= 11))) || (((a12 == 9) && (a16 == 9)) && (a15 != 3))) || (((a12 == 9) && (a15 <= 3)) && (11 <= a16))) || (((a12 <= 5) && (a15 <= 3)) && (11 <= a16))) RESULT: Ultimate proved your program to be correct! [2024-10-12 16:24:46,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE