./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/Problem03_label14.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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/Problem03_label14.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 57f7a1998dcd55fec053068d0046a0ca66d4d8a7aa0cff34b96de19d20fe9283 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-23 20:20:28,656 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-23 20:20:28,711 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-23 20:20:28,718 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-23 20:20:28,722 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-23 20:20:28,749 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-23 20:20:28,750 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-23 20:20:28,750 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-23 20:20:28,751 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-23 20:20:28,751 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-23 20:20:28,751 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-23 20:20:28,752 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-23 20:20:28,752 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-23 20:20:28,752 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-23 20:20:28,753 INFO L153 SettingsManager]: * Use SBE=true [2024-10-23 20:20:28,753 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-23 20:20:28,755 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-23 20:20:28,757 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-23 20:20:28,757 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-23 20:20:28,757 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-23 20:20:28,757 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-23 20:20:28,758 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-23 20:20:28,758 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-23 20:20:28,758 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-23 20:20:28,758 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-23 20:20:28,758 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-23 20:20:28,759 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-23 20:20:28,759 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-23 20:20:28,759 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-23 20:20:28,759 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-23 20:20:28,759 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-23 20:20:28,760 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-23 20:20:28,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 20:20:28,760 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-23 20:20:28,760 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-23 20:20:28,760 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-23 20:20:28,760 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-23 20:20:28,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-23 20:20:28,761 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-23 20:20:28,761 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-23 20:20:28,761 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-23 20:20:28,762 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-23 20:20:28,762 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 -> 57f7a1998dcd55fec053068d0046a0ca66d4d8a7aa0cff34b96de19d20fe9283 [2024-10-23 20:20:28,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-23 20:20:28,995 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-23 20:20:28,997 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-23 20:20:28,998 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-23 20:20:28,999 INFO L274 PluginConnector]: CDTParser initialized [2024-10-23 20:20:29,000 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label14.c [2024-10-23 20:20:30,317 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-23 20:20:30,605 INFO L384 CDTParser]: Found 1 translation units. [2024-10-23 20:20:30,606 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label14.c [2024-10-23 20:20:30,637 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaef3778e/74f50f6a781440a2bb7f55629c3a2f51/FLAGc3b11052a [2024-10-23 20:20:30,653 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaef3778e/74f50f6a781440a2bb7f55629c3a2f51 [2024-10-23 20:20:30,655 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-23 20:20:30,657 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-23 20:20:30,660 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-23 20:20:30,661 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-23 20:20:30,666 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-23 20:20:30,667 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:20:30" (1/1) ... [2024-10-23 20:20:30,667 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15c3d4fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:20:30, skipping insertion in model container [2024-10-23 20:20:30,668 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:20:30" (1/1) ... [2024-10-23 20:20:30,727 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-23 20:20:31,211 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/Problem03_label14.c[57171,57184] [2024-10-23 20:20:31,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 20:20:31,256 INFO L200 MainTranslator]: Completed pre-run [2024-10-23 20:20:31,400 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/Problem03_label14.c[57171,57184] [2024-10-23 20:20:31,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 20:20:31,430 INFO L204 MainTranslator]: Completed translation [2024-10-23 20:20:31,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:20:31 WrapperNode [2024-10-23 20:20:31,430 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-23 20:20:31,431 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-23 20:20:31,431 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-23 20:20:31,432 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-23 20:20:31,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:20:31" (1/1) ... [2024-10-23 20:20:31,477 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:20:31" (1/1) ... [2024-10-23 20:20:31,554 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1772 [2024-10-23 20:20:31,555 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-23 20:20:31,556 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-23 20:20:31,556 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-23 20:20:31,557 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-23 20:20:31,567 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:20:31" (1/1) ... [2024-10-23 20:20:31,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:20:31" (1/1) ... [2024-10-23 20:20:31,576 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:20:31" (1/1) ... [2024-10-23 20:20:31,609 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-23 20:20:31,610 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:20:31" (1/1) ... [2024-10-23 20:20:31,610 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:20:31" (1/1) ... [2024-10-23 20:20:31,642 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:20:31" (1/1) ... [2024-10-23 20:20:31,658 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:20:31" (1/1) ... [2024-10-23 20:20:31,667 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:20:31" (1/1) ... [2024-10-23 20:20:31,675 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:20:31" (1/1) ... [2024-10-23 20:20:31,687 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-23 20:20:31,689 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-23 20:20:31,689 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-23 20:20:31,689 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-23 20:20:31,690 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:20:31" (1/1) ... [2024-10-23 20:20:31,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 20:20:31,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 20:20:31,720 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-23 20:20:31,723 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-23 20:20:31,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-23 20:20:31,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-23 20:20:31,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-23 20:20:31,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-23 20:20:31,853 INFO L238 CfgBuilder]: Building ICFG [2024-10-23 20:20:31,855 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-23 20:20:33,294 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-10-23 20:20:33,295 INFO L287 CfgBuilder]: Performing block encoding [2024-10-23 20:20:33,361 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-23 20:20:33,362 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-23 20:20:33,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:20:33 BoogieIcfgContainer [2024-10-23 20:20:33,362 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-23 20:20:33,363 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-23 20:20:33,363 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-23 20:20:33,366 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-23 20:20:33,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 08:20:30" (1/3) ... [2024-10-23 20:20:33,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2302fa3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:20:33, skipping insertion in model container [2024-10-23 20:20:33,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:20:31" (2/3) ... [2024-10-23 20:20:33,368 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2302fa3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:20:33, skipping insertion in model container [2024-10-23 20:20:33,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:20:33" (3/3) ... [2024-10-23 20:20:33,371 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label14.c [2024-10-23 20:20:33,387 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-23 20:20:33,387 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-23 20:20:33,453 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-23 20:20:33,459 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;@d0d7dca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-23 20:20:33,460 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-23 20:20:33,465 INFO L276 IsEmpty]: Start isEmpty. Operand has 240 states, 238 states have (on average 1.9201680672268908) internal successors, (457), 239 states have internal predecessors, (457), 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-23 20:20:33,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-23 20:20:33,479 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:20:33,480 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 20:20:33,481 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:20:33,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:20:33,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1681799603, now seen corresponding path program 1 times [2024-10-23 20:20:33,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:20:33,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672629168] [2024-10-23 20:20:33,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:33,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:20:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:33,909 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-23 20:20:33,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:20:33,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672629168] [2024-10-23 20:20:33,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672629168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:20:33,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:20:33,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:20:33,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116060792] [2024-10-23 20:20:33,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:20:33,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-23 20:20:33,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:20:33,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-23 20:20:33,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 20:20:33,942 INFO L87 Difference]: Start difference. First operand has 240 states, 238 states have (on average 1.9201680672268908) internal successors, (457), 239 states have internal predecessors, (457), 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 84.5) internal successors, (169), 2 states have internal predecessors, (169), 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-23 20:20:33,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:20:33,987 INFO L93 Difference]: Finished difference Result 479 states and 913 transitions. [2024-10-23 20:20:33,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-23 20:20:33,993 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 84.5) internal successors, (169), 2 states have internal predecessors, (169), 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 169 [2024-10-23 20:20:33,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:20:34,004 INFO L225 Difference]: With dead ends: 479 [2024-10-23 20:20:34,005 INFO L226 Difference]: Without dead ends: 238 [2024-10-23 20:20:34,008 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-23 20:20:34,020 INFO L432 NwaCegarLoop]: 392 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, 392 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-23 20:20:34,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 392 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 20:20:34,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-23 20:20:34,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2024-10-23 20:20:34,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.6540084388185654) internal successors, (392), 237 states have internal predecessors, (392), 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-23 20:20:34,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 392 transitions. [2024-10-23 20:20:34,076 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 392 transitions. Word has length 169 [2024-10-23 20:20:34,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:20:34,078 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 392 transitions. [2024-10-23 20:20:34,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 84.5) internal successors, (169), 2 states have internal predecessors, (169), 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-23 20:20:34,078 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 392 transitions. [2024-10-23 20:20:34,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-23 20:20:34,083 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:20:34,083 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 20:20:34,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-23 20:20:34,084 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:20:34,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:20:34,084 INFO L85 PathProgramCache]: Analyzing trace with hash -434992729, now seen corresponding path program 1 times [2024-10-23 20:20:34,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:20:34,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796574707] [2024-10-23 20:20:34,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:34,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:20:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:34,581 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-23 20:20:34,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:20:34,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796574707] [2024-10-23 20:20:34,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796574707] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:20:34,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:20:34,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:20:34,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444383556] [2024-10-23 20:20:34,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:20:34,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:20:34,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:20:34,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:20:34,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:20:34,588 INFO L87 Difference]: Start difference. First operand 238 states and 392 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 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-23 20:20:35,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:20:35,332 INFO L93 Difference]: Finished difference Result 696 states and 1149 transitions. [2024-10-23 20:20:35,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:20:35,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 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 169 [2024-10-23 20:20:35,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:20:35,337 INFO L225 Difference]: With dead ends: 696 [2024-10-23 20:20:35,337 INFO L226 Difference]: Without dead ends: 459 [2024-10-23 20:20:35,338 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-23 20:20:35,339 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 94 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-23 20:20:35,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 137 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-23 20:20:35,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-10-23 20:20:35,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 458. [2024-10-23 20:20:35,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 457 states have (on average 1.5514223194748358) internal successors, (709), 457 states have internal predecessors, (709), 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-23 20:20:35,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 709 transitions. [2024-10-23 20:20:35,359 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 709 transitions. Word has length 169 [2024-10-23 20:20:35,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:20:35,359 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 709 transitions. [2024-10-23 20:20:35,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 2 states have internal predecessors, (169), 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-23 20:20:35,360 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 709 transitions. [2024-10-23 20:20:35,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-23 20:20:35,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:20:35,362 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 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-23 20:20:35,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-23 20:20:35,363 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:20:35,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:20:35,363 INFO L85 PathProgramCache]: Analyzing trace with hash -160970915, now seen corresponding path program 1 times [2024-10-23 20:20:35,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:20:35,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97912458] [2024-10-23 20:20:35,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:35,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:20:35,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:35,561 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:20:35,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:20:35,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97912458] [2024-10-23 20:20:35,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97912458] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:20:35,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:20:35,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:20:35,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558418325] [2024-10-23 20:20:35,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:20:35,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:20:35,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:20:35,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:20:35,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:20:35,568 INFO L87 Difference]: Start difference. First operand 458 states and 709 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 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-23 20:20:36,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:20:36,173 INFO L93 Difference]: Finished difference Result 1341 states and 2081 transitions. [2024-10-23 20:20:36,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:20:36,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 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 174 [2024-10-23 20:20:36,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:20:36,177 INFO L225 Difference]: With dead ends: 1341 [2024-10-23 20:20:36,177 INFO L226 Difference]: Without dead ends: 884 [2024-10-23 20:20:36,178 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-23 20:20:36,179 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 251 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 20:20:36,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 179 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 20:20:36,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2024-10-23 20:20:36,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 879. [2024-10-23 20:20:36,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 878 states have (on average 1.469248291571754) internal successors, (1290), 878 states have internal predecessors, (1290), 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-23 20:20:36,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1290 transitions. [2024-10-23 20:20:36,223 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1290 transitions. Word has length 174 [2024-10-23 20:20:36,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:20:36,223 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1290 transitions. [2024-10-23 20:20:36,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 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-23 20:20:36,223 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1290 transitions. [2024-10-23 20:20:36,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-23 20:20:36,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:20:36,233 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 20:20:36,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-23 20:20:36,233 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:20:36,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:20:36,234 INFO L85 PathProgramCache]: Analyzing trace with hash 621738886, now seen corresponding path program 1 times [2024-10-23 20:20:36,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:20:36,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44882000] [2024-10-23 20:20:36,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:36,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:20:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:36,387 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:20:36,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:20:36,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44882000] [2024-10-23 20:20:36,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44882000] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:20:36,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:20:36,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:20:36,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716244136] [2024-10-23 20:20:36,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:20:36,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:20:36,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:20:36,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:20:36,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:20:36,390 INFO L87 Difference]: Start difference. First operand 879 states and 1290 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 2 states have internal predecessors, (177), 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-23 20:20:37,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:20:37,120 INFO L93 Difference]: Finished difference Result 2593 states and 3821 transitions. [2024-10-23 20:20:37,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:20:37,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 2 states have internal predecessors, (177), 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 177 [2024-10-23 20:20:37,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:20:37,127 INFO L225 Difference]: With dead ends: 2593 [2024-10-23 20:20:37,128 INFO L226 Difference]: Without dead ends: 1715 [2024-10-23 20:20:37,130 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-23 20:20:37,131 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 247 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-23 20:20:37,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 90 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-23 20:20:37,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2024-10-23 20:20:37,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1695. [2024-10-23 20:20:37,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1695 states, 1694 states have (on average 1.4386068476977567) internal successors, (2437), 1694 states have internal predecessors, (2437), 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-23 20:20:37,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1695 states and 2437 transitions. [2024-10-23 20:20:37,167 INFO L78 Accepts]: Start accepts. Automaton has 1695 states and 2437 transitions. Word has length 177 [2024-10-23 20:20:37,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:20:37,168 INFO L471 AbstractCegarLoop]: Abstraction has 1695 states and 2437 transitions. [2024-10-23 20:20:37,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 2 states have internal predecessors, (177), 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-23 20:20:37,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 2437 transitions. [2024-10-23 20:20:37,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-10-23 20:20:37,172 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:20:37,172 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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, 1, 1, 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-23 20:20:37,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-23 20:20:37,173 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:20:37,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:20:37,173 INFO L85 PathProgramCache]: Analyzing trace with hash 337573741, now seen corresponding path program 1 times [2024-10-23 20:20:37,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:20:37,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882991152] [2024-10-23 20:20:37,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:37,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:20:37,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:37,438 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-23 20:20:37,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:20:37,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882991152] [2024-10-23 20:20:37,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882991152] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:20:37,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:20:37,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:20:37,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337931035] [2024-10-23 20:20:37,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:20:37,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:20:37,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:20:37,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:20:37,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:20:37,443 INFO L87 Difference]: Start difference. First operand 1695 states and 2437 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 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-23 20:20:38,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:20:38,139 INFO L93 Difference]: Finished difference Result 5016 states and 7220 transitions. [2024-10-23 20:20:38,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:20:38,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 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 189 [2024-10-23 20:20:38,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:20:38,148 INFO L225 Difference]: With dead ends: 5016 [2024-10-23 20:20:38,149 INFO L226 Difference]: Without dead ends: 3322 [2024-10-23 20:20:38,151 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-23 20:20:38,153 INFO L432 NwaCegarLoop]: 380 mSDtfsCounter, 236 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 20:20:38,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 407 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 20:20:38,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3322 states. [2024-10-23 20:20:38,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3322 to 3319. [2024-10-23 20:20:38,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3319 states, 3318 states have (on average 1.28541289933695) internal successors, (4265), 3318 states have internal predecessors, (4265), 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-23 20:20:38,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3319 states to 3319 states and 4265 transitions. [2024-10-23 20:20:38,207 INFO L78 Accepts]: Start accepts. Automaton has 3319 states and 4265 transitions. Word has length 189 [2024-10-23 20:20:38,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:20:38,207 INFO L471 AbstractCegarLoop]: Abstraction has 3319 states and 4265 transitions. [2024-10-23 20:20:38,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 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-23 20:20:38,209 INFO L276 IsEmpty]: Start isEmpty. Operand 3319 states and 4265 transitions. [2024-10-23 20:20:38,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-23 20:20:38,214 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:20:38,214 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:20:38,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-23 20:20:38,215 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:20:38,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:20:38,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1898337063, now seen corresponding path program 1 times [2024-10-23 20:20:38,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:20:38,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282578937] [2024-10-23 20:20:38,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:38,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:20:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:38,469 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-23 20:20:38,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:20:38,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282578937] [2024-10-23 20:20:38,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282578937] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:20:38,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:20:38,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:20:38,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758554906] [2024-10-23 20:20:38,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:20:38,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:20:38,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:20:38,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:20:38,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:20:38,471 INFO L87 Difference]: Start difference. First operand 3319 states and 4265 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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-23 20:20:39,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:20:39,208 INFO L93 Difference]: Finished difference Result 8273 states and 10605 transitions. [2024-10-23 20:20:39,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:20:39,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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 197 [2024-10-23 20:20:39,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:20:39,223 INFO L225 Difference]: With dead ends: 8273 [2024-10-23 20:20:39,224 INFO L226 Difference]: Without dead ends: 4955 [2024-10-23 20:20:39,229 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-23 20:20:39,229 INFO L432 NwaCegarLoop]: 386 mSDtfsCounter, 214 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-23 20:20:39,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 406 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-23 20:20:39,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4955 states. [2024-10-23 20:20:39,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4955 to 4943. [2024-10-23 20:20:39,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4943 states, 4942 states have (on average 1.2414002428166735) internal successors, (6135), 4942 states have internal predecessors, (6135), 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-23 20:20:39,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4943 states to 4943 states and 6135 transitions. [2024-10-23 20:20:39,350 INFO L78 Accepts]: Start accepts. Automaton has 4943 states and 6135 transitions. Word has length 197 [2024-10-23 20:20:39,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:20:39,350 INFO L471 AbstractCegarLoop]: Abstraction has 4943 states and 6135 transitions. [2024-10-23 20:20:39,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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-23 20:20:39,351 INFO L276 IsEmpty]: Start isEmpty. Operand 4943 states and 6135 transitions. [2024-10-23 20:20:39,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-23 20:20:39,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:20:39,358 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 20:20:39,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-23 20:20:39,358 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:20:39,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:20:39,358 INFO L85 PathProgramCache]: Analyzing trace with hash 991947067, now seen corresponding path program 1 times [2024-10-23 20:20:39,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:20:39,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357291367] [2024-10-23 20:20:39,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:39,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:20:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:39,585 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-23 20:20:39,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:20:39,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357291367] [2024-10-23 20:20:39,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357291367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:20:39,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:20:39,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:20:39,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236408004] [2024-10-23 20:20:39,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:20:39,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:20:39,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:20:39,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:20:39,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:20:39,588 INFO L87 Difference]: Start difference. First operand 4943 states and 6135 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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-23 20:20:40,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:20:40,369 INFO L93 Difference]: Finished difference Result 13756 states and 17026 transitions. [2024-10-23 20:20:40,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:20:40,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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 204 [2024-10-23 20:20:40,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:20:40,393 INFO L225 Difference]: With dead ends: 13756 [2024-10-23 20:20:40,393 INFO L226 Difference]: Without dead ends: 8814 [2024-10-23 20:20:40,399 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-23 20:20:40,400 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 202 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-23 20:20:40,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 415 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-23 20:20:40,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8814 states. [2024-10-23 20:20:40,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8814 to 8403. [2024-10-23 20:20:40,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8403 states, 8402 states have (on average 1.2023327779100215) internal successors, (10102), 8402 states have internal predecessors, (10102), 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-23 20:20:40,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8403 states to 8403 states and 10102 transitions. [2024-10-23 20:20:40,528 INFO L78 Accepts]: Start accepts. Automaton has 8403 states and 10102 transitions. Word has length 204 [2024-10-23 20:20:40,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:20:40,529 INFO L471 AbstractCegarLoop]: Abstraction has 8403 states and 10102 transitions. [2024-10-23 20:20:40,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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-23 20:20:40,529 INFO L276 IsEmpty]: Start isEmpty. Operand 8403 states and 10102 transitions. [2024-10-23 20:20:40,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-23 20:20:40,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:20:40,539 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 20:20:40,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-23 20:20:40,539 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:20:40,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:20:40,540 INFO L85 PathProgramCache]: Analyzing trace with hash 655162076, now seen corresponding path program 1 times [2024-10-23 20:20:40,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:20:40,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754605584] [2024-10-23 20:20:40,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:40,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:20:40,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:40,956 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:20:40,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:20:40,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754605584] [2024-10-23 20:20:40,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754605584] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:20:40,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:20:40,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:20:40,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546540817] [2024-10-23 20:20:40,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:20:40,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:20:40,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:20:40,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:20:40,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:20:40,960 INFO L87 Difference]: Start difference. First operand 8403 states and 10102 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 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-23 20:20:41,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:20:41,739 INFO L93 Difference]: Finished difference Result 20287 states and 24387 transitions. [2024-10-23 20:20:41,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:20:41,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 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 210 [2024-10-23 20:20:41,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:20:41,782 INFO L225 Difference]: With dead ends: 20287 [2024-10-23 20:20:41,782 INFO L226 Difference]: Without dead ends: 11885 [2024-10-23 20:20:41,793 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-23 20:20:41,795 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 197 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-23 20:20:41,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 192 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-23 20:20:41,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11885 states. [2024-10-23 20:20:41,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11885 to 11874. [2024-10-23 20:20:41,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11874 states, 11873 states have (on average 1.1927061399814705) internal successors, (14161), 11873 states have internal predecessors, (14161), 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-23 20:20:42,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11874 states to 11874 states and 14161 transitions. [2024-10-23 20:20:42,004 INFO L78 Accepts]: Start accepts. Automaton has 11874 states and 14161 transitions. Word has length 210 [2024-10-23 20:20:42,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:20:42,005 INFO L471 AbstractCegarLoop]: Abstraction has 11874 states and 14161 transitions. [2024-10-23 20:20:42,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 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-23 20:20:42,005 INFO L276 IsEmpty]: Start isEmpty. Operand 11874 states and 14161 transitions. [2024-10-23 20:20:42,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-23 20:20:42,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:20:42,018 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 20:20:42,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-23 20:20:42,019 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:20:42,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:20:42,019 INFO L85 PathProgramCache]: Analyzing trace with hash -86892620, now seen corresponding path program 1 times [2024-10-23 20:20:42,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:20:42,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268167101] [2024-10-23 20:20:42,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:42,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:20:42,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:42,279 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:20:42,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:20:42,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268167101] [2024-10-23 20:20:42,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268167101] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:20:42,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:20:42,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:20:42,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217239916] [2024-10-23 20:20:42,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:20:42,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 20:20:42,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:20:42,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 20:20:42,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 20:20:42,282 INFO L87 Difference]: Start difference. First operand 11874 states and 14161 transitions. Second operand has 4 states, 4 states have (on average 53.25) internal successors, (213), 3 states have internal predecessors, (213), 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-23 20:20:43,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:20:43,286 INFO L93 Difference]: Finished difference Result 23574 states and 28129 transitions. [2024-10-23 20:20:43,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 20:20:43,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 3 states have internal predecessors, (213), 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 213 [2024-10-23 20:20:43,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:20:43,304 INFO L225 Difference]: With dead ends: 23574 [2024-10-23 20:20:43,305 INFO L226 Difference]: Without dead ends: 11904 [2024-10-23 20:20:43,316 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-23 20:20:43,316 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 408 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 1385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-23 20:20:43,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 197 Invalid, 1385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-23 20:20:43,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11904 states. [2024-10-23 20:20:43,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11904 to 10859. [2024-10-23 20:20:43,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10859 states, 10858 states have (on average 1.197826487382575) internal successors, (13006), 10858 states have internal predecessors, (13006), 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-23 20:20:43,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10859 states to 10859 states and 13006 transitions. [2024-10-23 20:20:43,447 INFO L78 Accepts]: Start accepts. Automaton has 10859 states and 13006 transitions. Word has length 213 [2024-10-23 20:20:43,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:20:43,448 INFO L471 AbstractCegarLoop]: Abstraction has 10859 states and 13006 transitions. [2024-10-23 20:20:43,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 3 states have internal predecessors, (213), 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-23 20:20:43,449 INFO L276 IsEmpty]: Start isEmpty. Operand 10859 states and 13006 transitions. [2024-10-23 20:20:43,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-23 20:20:43,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:20:43,463 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 20:20:43,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-23 20:20:43,463 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:20:43,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:20:43,466 INFO L85 PathProgramCache]: Analyzing trace with hash -682038037, now seen corresponding path program 1 times [2024-10-23 20:20:43,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:20:43,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120036681] [2024-10-23 20:20:43,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:43,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:20:43,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:43,829 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:20:43,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:20:43,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120036681] [2024-10-23 20:20:43,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120036681] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 20:20:43,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447522666] [2024-10-23 20:20:43,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:43,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:20:43,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 20:20:43,834 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 20:20:43,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-23 20:20:43,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:43,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 20:20:43,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 20:20:44,181 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-23 20:20:44,182 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 20:20:44,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447522666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:20:44,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 20:20:44,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-23 20:20:44,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200473021] [2024-10-23 20:20:44,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:20:44,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:20:44,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:20:44,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:20:44,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 20:20:44,183 INFO L87 Difference]: Start difference. First operand 10859 states and 13006 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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-23 20:20:44,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:20:44,811 INFO L93 Difference]: Finished difference Result 21310 states and 25542 transitions. [2024-10-23 20:20:44,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:20:44,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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 217 [2024-10-23 20:20:44,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:20:44,828 INFO L225 Difference]: With dead ends: 21310 [2024-10-23 20:20:44,829 INFO L226 Difference]: Without dead ends: 10655 [2024-10-23 20:20:44,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 20:20:44,840 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 107 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 20:20:44,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 96 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 20:20:44,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10655 states. [2024-10-23 20:20:44,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10655 to 10652. [2024-10-23 20:20:44,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10652 states, 10651 states have (on average 1.1931274058773824) internal successors, (12708), 10651 states have internal predecessors, (12708), 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-23 20:20:44,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10652 states to 10652 states and 12708 transitions. [2024-10-23 20:20:44,986 INFO L78 Accepts]: Start accepts. Automaton has 10652 states and 12708 transitions. Word has length 217 [2024-10-23 20:20:44,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:20:44,986 INFO L471 AbstractCegarLoop]: Abstraction has 10652 states and 12708 transitions. [2024-10-23 20:20:44,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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-23 20:20:44,987 INFO L276 IsEmpty]: Start isEmpty. Operand 10652 states and 12708 transitions. [2024-10-23 20:20:45,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-23 20:20:45,000 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:20:45,001 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 20:20:45,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-23 20:20:45,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-23 20:20:45,202 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:20:45,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:20:45,203 INFO L85 PathProgramCache]: Analyzing trace with hash -793788603, now seen corresponding path program 1 times [2024-10-23 20:20:45,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:20:45,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173087183] [2024-10-23 20:20:45,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:45,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:20:45,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:45,501 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 56 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-23 20:20:45,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:20:45,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173087183] [2024-10-23 20:20:45,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173087183] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 20:20:45,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703480710] [2024-10-23 20:20:45,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:45,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:20:45,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 20:20:45,504 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 20:20:45,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-23 20:20:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:45,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 20:20:45,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 20:20:45,735 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-23 20:20:45,737 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 20:20:45,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703480710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:20:45,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 20:20:45,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-23 20:20:45,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335319582] [2024-10-23 20:20:45,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:20:45,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:20:45,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:20:45,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:20:45,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 20:20:45,739 INFO L87 Difference]: Start difference. First operand 10652 states and 12708 transitions. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 2 states have internal predecessors, (203), 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-23 20:20:46,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:20:46,086 INFO L93 Difference]: Finished difference Result 20861 states and 24884 transitions. [2024-10-23 20:20:46,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:20:46,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 2 states have internal predecessors, (203), 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 220 [2024-10-23 20:20:46,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:20:46,102 INFO L225 Difference]: With dead ends: 20861 [2024-10-23 20:20:46,102 INFO L226 Difference]: Without dead ends: 10616 [2024-10-23 20:20:46,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 20:20:46,113 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 308 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-23 20:20:46,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 29 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-23 20:20:46,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10616 states. [2024-10-23 20:20:46,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10616 to 10616. [2024-10-23 20:20:46,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10616 states, 10615 states have (on average 1.1837965143664626) internal successors, (12566), 10615 states have internal predecessors, (12566), 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-23 20:20:46,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10616 states to 10616 states and 12566 transitions. [2024-10-23 20:20:46,225 INFO L78 Accepts]: Start accepts. Automaton has 10616 states and 12566 transitions. Word has length 220 [2024-10-23 20:20:46,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:20:46,226 INFO L471 AbstractCegarLoop]: Abstraction has 10616 states and 12566 transitions. [2024-10-23 20:20:46,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 2 states have internal predecessors, (203), 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-23 20:20:46,226 INFO L276 IsEmpty]: Start isEmpty. Operand 10616 states and 12566 transitions. [2024-10-23 20:20:46,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-10-23 20:20:46,240 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:20:46,240 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 20:20:46,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-23 20:20:46,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-23 20:20:46,441 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:20:46,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:20:46,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1606173905, now seen corresponding path program 1 times [2024-10-23 20:20:46,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:20:46,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070050612] [2024-10-23 20:20:46,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:46,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:20:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:46,676 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-23 20:20:46,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:20:46,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070050612] [2024-10-23 20:20:46,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070050612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:20:46,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:20:46,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:20:46,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717698880] [2024-10-23 20:20:46,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:20:46,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 20:20:46,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:20:46,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 20:20:46,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 20:20:46,679 INFO L87 Difference]: Start difference. First operand 10616 states and 12566 transitions. Second operand has 4 states, 4 states have (on average 63.0) internal successors, (252), 3 states have internal predecessors, (252), 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-23 20:20:47,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:20:47,331 INFO L93 Difference]: Finished difference Result 25505 states and 30487 transitions. [2024-10-23 20:20:47,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 20:20:47,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.0) internal successors, (252), 3 states have internal predecessors, (252), 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 257 [2024-10-23 20:20:47,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:20:47,350 INFO L225 Difference]: With dead ends: 25505 [2024-10-23 20:20:47,351 INFO L226 Difference]: Without dead ends: 14281 [2024-10-23 20:20:47,361 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-23 20:20:47,361 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 445 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-23 20:20:47,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 56 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-23 20:20:47,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14281 states. [2024-10-23 20:20:47,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14281 to 13874. [2024-10-23 20:20:47,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13874 states, 13873 states have (on average 1.118143155770201) internal successors, (15512), 13873 states have internal predecessors, (15512), 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-23 20:20:47,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13874 states to 13874 states and 15512 transitions. [2024-10-23 20:20:47,496 INFO L78 Accepts]: Start accepts. Automaton has 13874 states and 15512 transitions. Word has length 257 [2024-10-23 20:20:47,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:20:47,496 INFO L471 AbstractCegarLoop]: Abstraction has 13874 states and 15512 transitions. [2024-10-23 20:20:47,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.0) internal successors, (252), 3 states have internal predecessors, (252), 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-23 20:20:47,497 INFO L276 IsEmpty]: Start isEmpty. Operand 13874 states and 15512 transitions. [2024-10-23 20:20:47,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2024-10-23 20:20:47,516 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:20:47,516 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 20:20:47,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-23 20:20:47,517 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:20:47,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:20:47,517 INFO L85 PathProgramCache]: Analyzing trace with hash 950113569, now seen corresponding path program 1 times [2024-10-23 20:20:47,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:20:47,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262728009] [2024-10-23 20:20:47,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:47,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:20:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:47,670 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-10-23 20:20:47,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:20:47,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262728009] [2024-10-23 20:20:47,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262728009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:20:47,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:20:47,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:20:47,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590837326] [2024-10-23 20:20:47,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:20:47,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:20:47,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:20:47,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:20:47,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:20:47,673 INFO L87 Difference]: Start difference. First operand 13874 states and 15512 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 2 states have internal predecessors, (216), 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-23 20:20:48,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:20:48,268 INFO L93 Difference]: Finished difference Result 32419 states and 36565 transitions. [2024-10-23 20:20:48,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:20:48,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 2 states have internal predecessors, (216), 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 286 [2024-10-23 20:20:48,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:20:48,290 INFO L225 Difference]: With dead ends: 32419 [2024-10-23 20:20:48,290 INFO L226 Difference]: Without dead ends: 18749 [2024-10-23 20:20:48,297 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-23 20:20:48,298 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 180 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 20:20:48,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 109 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 20:20:48,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18749 states. [2024-10-23 20:20:48,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18749 to 18340. [2024-10-23 20:20:48,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18340 states, 18339 states have (on average 1.098424123452751) internal successors, (20144), 18339 states have internal predecessors, (20144), 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-23 20:20:48,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18340 states to 18340 states and 20144 transitions. [2024-10-23 20:20:48,483 INFO L78 Accepts]: Start accepts. Automaton has 18340 states and 20144 transitions. Word has length 286 [2024-10-23 20:20:48,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:20:48,484 INFO L471 AbstractCegarLoop]: Abstraction has 18340 states and 20144 transitions. [2024-10-23 20:20:48,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 2 states have internal predecessors, (216), 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-23 20:20:48,484 INFO L276 IsEmpty]: Start isEmpty. Operand 18340 states and 20144 transitions. [2024-10-23 20:20:48,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2024-10-23 20:20:48,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:20:48,500 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-23 20:20:48,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-23 20:20:48,500 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:20:48,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:20:48,501 INFO L85 PathProgramCache]: Analyzing trace with hash 752036146, now seen corresponding path program 1 times [2024-10-23 20:20:48,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:20:48,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730818632] [2024-10-23 20:20:48,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:48,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:20:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:48,947 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:20:48,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:20:48,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730818632] [2024-10-23 20:20:48,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730818632] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:20:48,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:20:48,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:20:48,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832441749] [2024-10-23 20:20:48,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:20:48,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:20:48,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:20:48,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:20:48,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:20:48,950 INFO L87 Difference]: Start difference. First operand 18340 states and 20144 transitions. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 2 states have internal predecessors, (295), 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-23 20:20:49,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:20:49,496 INFO L93 Difference]: Finished difference Result 41568 states and 45760 transitions. [2024-10-23 20:20:49,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:20:49,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 2 states have internal predecessors, (295), 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 295 [2024-10-23 20:20:49,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:20:49,521 INFO L225 Difference]: With dead ends: 41568 [2024-10-23 20:20:49,521 INFO L226 Difference]: Without dead ends: 23432 [2024-10-23 20:20:49,534 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-23 20:20:49,535 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 94 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 20:20:49,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 124 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 20:20:49,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23432 states. [2024-10-23 20:20:49,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23432 to 23430. [2024-10-23 20:20:49,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23430 states, 23429 states have (on average 1.0998335396303727) internal successors, (25768), 23429 states have internal predecessors, (25768), 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-23 20:20:49,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23430 states to 23430 states and 25768 transitions. [2024-10-23 20:20:49,762 INFO L78 Accepts]: Start accepts. Automaton has 23430 states and 25768 transitions. Word has length 295 [2024-10-23 20:20:49,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:20:49,762 INFO L471 AbstractCegarLoop]: Abstraction has 23430 states and 25768 transitions. [2024-10-23 20:20:49,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 2 states have internal predecessors, (295), 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-23 20:20:49,762 INFO L276 IsEmpty]: Start isEmpty. Operand 23430 states and 25768 transitions. [2024-10-23 20:20:49,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2024-10-23 20:20:49,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:20:49,784 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-23 20:20:49,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-23 20:20:49,784 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:20:49,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:20:49,784 INFO L85 PathProgramCache]: Analyzing trace with hash -2032836989, now seen corresponding path program 1 times [2024-10-23 20:20:49,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:20:49,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940074606] [2024-10-23 20:20:49,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:49,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:20:49,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:50,839 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 130 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:20:50,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:20:50,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940074606] [2024-10-23 20:20:50,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940074606] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 20:20:50,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137741011] [2024-10-23 20:20:50,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:20:50,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:20:50,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 20:20:50,840 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 20:20:50,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-23 20:20:50,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:20:50,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 20:20:50,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 20:20:51,142 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-23 20:20:51,142 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 20:20:51,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137741011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:20:51,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 20:20:51,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-23 20:20:51,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156852484] [2024-10-23 20:20:51,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:20:51,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:20:51,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:20:51,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:20:51,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-23 20:20:51,144 INFO L87 Difference]: Start difference. First operand 23430 states and 25768 transitions. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 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-23 20:20:51,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:20:51,691 INFO L93 Difference]: Finished difference Result 49721 states and 54825 transitions. [2024-10-23 20:20:51,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:20:51,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 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 302 [2024-10-23 20:20:51,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:20:51,693 INFO L225 Difference]: With dead ends: 49721 [2024-10-23 20:20:51,693 INFO L226 Difference]: Without dead ends: 0 [2024-10-23 20:20:51,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-23 20:20:51,712 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 58 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 20:20:51,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 327 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 20:20:51,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-23 20:20:51,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-23 20:20:51,712 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-23 20:20:51,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-23 20:20:51,713 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 302 [2024-10-23 20:20:51,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:20:51,713 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-23 20:20:51,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 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-23 20:20:51,714 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-23 20:20:51,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-23 20:20:51,716 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-23 20:20:51,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-23 20:20:51,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:20:51,920 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:20:51,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-23 20:20:52,715 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-23 20:20:52,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 08:20:52 BoogieIcfgContainer [2024-10-23 20:20:52,727 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-23 20:20:52,728 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-23 20:20:52,728 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-23 20:20:52,728 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-23 20:20:52,729 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:20:33" (3/4) ... [2024-10-23 20:20:52,730 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-23 20:20:52,756 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-23 20:20:52,757 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-23 20:20:52,759 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-23 20:20:52,760 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-23 20:20:52,951 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-23 20:20:52,952 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-23 20:20:52,952 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-23 20:20:52,952 INFO L158 Benchmark]: Toolchain (without parser) took 22295.09ms. Allocated memory was 155.2MB in the beginning and 847.2MB in the end (delta: 692.1MB). Free memory was 76.7MB in the beginning and 705.4MB in the end (delta: -628.6MB). Peak memory consumption was 64.8MB. Max. memory is 16.1GB. [2024-10-23 20:20:52,953 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 106.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-23 20:20:52,953 INFO L158 Benchmark]: CACSL2BoogieTranslator took 770.93ms. Allocated memory was 155.2MB in the beginning and 213.9MB in the end (delta: 58.7MB). Free memory was 76.6MB in the beginning and 139.1MB in the end (delta: -62.6MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. [2024-10-23 20:20:52,954 INFO L158 Benchmark]: Boogie Procedure Inliner took 123.47ms. Allocated memory is still 213.9MB. Free memory was 139.1MB in the beginning and 124.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-23 20:20:52,954 INFO L158 Benchmark]: Boogie Preprocessor took 131.56ms. Allocated memory is still 213.9MB. Free memory was 124.5MB in the beginning and 111.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-23 20:20:52,954 INFO L158 Benchmark]: RCFGBuilder took 1673.52ms. Allocated memory is still 213.9MB. Free memory was 110.8MB in the beginning and 158.3MB in the end (delta: -47.5MB). Peak memory consumption was 82.7MB. Max. memory is 16.1GB. [2024-10-23 20:20:52,954 INFO L158 Benchmark]: TraceAbstraction took 19364.21ms. Allocated memory was 213.9MB in the beginning and 847.2MB in the end (delta: 633.3MB). Free memory was 157.3MB in the beginning and 731.6MB in the end (delta: -574.3MB). Peak memory consumption was 539.5MB. Max. memory is 16.1GB. [2024-10-23 20:20:52,955 INFO L158 Benchmark]: Witness Printer took 223.99ms. Allocated memory is still 847.2MB. Free memory was 731.6MB in the beginning and 705.4MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-23 20:20:52,958 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.15ms. Allocated memory is still 155.2MB. Free memory is still 106.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 770.93ms. Allocated memory was 155.2MB in the beginning and 213.9MB in the end (delta: 58.7MB). Free memory was 76.6MB in the beginning and 139.1MB in the end (delta: -62.6MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 123.47ms. Allocated memory is still 213.9MB. Free memory was 139.1MB in the beginning and 124.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 131.56ms. Allocated memory is still 213.9MB. Free memory was 124.5MB in the beginning and 111.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1673.52ms. Allocated memory is still 213.9MB. Free memory was 110.8MB in the beginning and 158.3MB in the end (delta: -47.5MB). Peak memory consumption was 82.7MB. Max. memory is 16.1GB. * TraceAbstraction took 19364.21ms. Allocated memory was 213.9MB in the beginning and 847.2MB in the end (delta: 633.3MB). Free memory was 157.3MB in the beginning and 731.6MB in the end (delta: -574.3MB). Peak memory consumption was 539.5MB. Max. memory is 16.1GB. * Witness Printer took 223.99ms. Allocated memory is still 847.2MB. Free memory was 731.6MB in the beginning and 705.4MB 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: 1555]: 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, 240 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.5s, OverallIterations: 15, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 9.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3041 SdHoareTripleChecker+Valid, 8.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3041 mSDsluCounter, 3156 SdHoareTripleChecker+Invalid, 6.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 311 mSDsCounter, 1466 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8810 IncrementalHoareTripleChecker+Invalid, 10276 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1466 mSolverCounterUnsat, 2845 mSDtfsCounter, 8810 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 775 GetRequests, 752 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23430occurred in iteration=14, InterpolantAutomatonStates: 46, 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, 15 MinimizatonAttempts, 2329 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 4018 NumberOfCodeBlocks, 4018 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 4000 ConstructedInterpolants, 0 QuantifiedInterpolants, 8498 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1358 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 18 InterpolantComputations, 15 PerfectInterpolantSequences, 1134/1152 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: 1668]: Loop Invariant Derived loop invariant: (((((a5 == 1) && (1 <= a3)) || (((a5 == 1) && (a12 == 1)) && (a3 == 0))) || (((a26 == 1) && (a5 == 1)) && (a3 == 0))) || (((a5 == 1) && (a27 == 1)) && (a3 == 0))) RESULT: Ultimate proved your program to be correct! [2024-10-23 20:20:52,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE