./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label34.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem10_label34.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 550f3a62df7d5eada5d2aa8dd32299382207e40f85198cb35440276faa9cf7d3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 01:40:33,048 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 01:40:33,100 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 01:40:33,103 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 01:40:33,103 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 01:40:33,116 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 01:40:33,116 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 01:40:33,116 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 01:40:33,117 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 01:40:33,117 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 01:40:33,117 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 01:40:33,117 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 01:40:33,117 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 01:40:33,117 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 01:40:33,117 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 01:40:33,117 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 01:40:33,117 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 01:40:33,118 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 01:40:33,118 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 01:40:33,118 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 01:40:33,118 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 01:40:33,118 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 01:40:33,118 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 01:40:33,118 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 01:40:33,118 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 01:40:33,118 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 01:40:33,118 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 01:40:33,118 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 01:40:33,118 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 01:40:33,119 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 01:40:33,119 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 01:40:33,119 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 01:40:33,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:40:33,119 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 01:40:33,119 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 01:40:33,119 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 01:40:33,119 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 01:40:33,119 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 01:40:33,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 01:40:33,119 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 01:40:33,120 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 01:40:33,120 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 01:40:33,120 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 01:40:33,120 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 550f3a62df7d5eada5d2aa8dd32299382207e40f85198cb35440276faa9cf7d3 [2025-03-08 01:40:33,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 01:40:33,328 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 01:40:33,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 01:40:33,331 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 01:40:33,331 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 01:40:33,333 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label34.c [2025-03-08 01:40:34,474 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d67eb5928/337f7b91cc444bee8d1aa3fac8deb81e/FLAG204d61abe [2025-03-08 01:40:34,738 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 01:40:34,739 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label34.c [2025-03-08 01:40:34,751 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d67eb5928/337f7b91cc444bee8d1aa3fac8deb81e/FLAG204d61abe [2025-03-08 01:40:35,039 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d67eb5928/337f7b91cc444bee8d1aa3fac8deb81e [2025-03-08 01:40:35,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 01:40:35,042 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 01:40:35,043 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 01:40:35,043 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 01:40:35,045 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 01:40:35,046 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:40:35" (1/1) ... [2025-03-08 01:40:35,046 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17ee63c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:35, skipping insertion in model container [2025-03-08 01:40:35,046 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:40:35" (1/1) ... [2025-03-08 01:40:35,064 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 01:40:35,209 WARN L250 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/Problem10_label34.c[7166,7179] [2025-03-08 01:40:35,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:40:35,328 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 01:40:35,349 WARN L250 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/Problem10_label34.c[7166,7179] [2025-03-08 01:40:35,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:40:35,402 INFO L204 MainTranslator]: Completed translation [2025-03-08 01:40:35,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:35 WrapperNode [2025-03-08 01:40:35,403 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 01:40:35,404 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 01:40:35,404 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 01:40:35,404 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 01:40:35,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:35" (1/1) ... [2025-03-08 01:40:35,424 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:35" (1/1) ... [2025-03-08 01:40:35,457 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 595 [2025-03-08 01:40:35,457 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 01:40:35,458 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 01:40:35,458 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 01:40:35,458 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 01:40:35,465 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:35" (1/1) ... [2025-03-08 01:40:35,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:35" (1/1) ... [2025-03-08 01:40:35,470 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:35" (1/1) ... [2025-03-08 01:40:35,490 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]. [2025-03-08 01:40:35,490 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:35" (1/1) ... [2025-03-08 01:40:35,490 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:35" (1/1) ... [2025-03-08 01:40:35,509 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:35" (1/1) ... [2025-03-08 01:40:35,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:35" (1/1) ... [2025-03-08 01:40:35,518 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:35" (1/1) ... [2025-03-08 01:40:35,520 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:35" (1/1) ... [2025-03-08 01:40:35,529 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 01:40:35,530 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 01:40:35,531 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 01:40:35,531 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 01:40:35,531 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:35" (1/1) ... [2025-03-08 01:40:35,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:40:35,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:40:35,561 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) [2025-03-08 01:40:35,565 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 [2025-03-08 01:40:35,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 01:40:35,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 01:40:35,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 01:40:35,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 01:40:35,633 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 01:40:35,635 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 01:40:36,405 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-03-08 01:40:36,405 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 01:40:36,419 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 01:40:36,420 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 01:40:36,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:40:36 BoogieIcfgContainer [2025-03-08 01:40:36,420 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 01:40:36,422 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 01:40:36,422 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 01:40:36,425 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 01:40:36,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:40:35" (1/3) ... [2025-03-08 01:40:36,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c3e7d17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:40:36, skipping insertion in model container [2025-03-08 01:40:36,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:35" (2/3) ... [2025-03-08 01:40:36,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c3e7d17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:40:36, skipping insertion in model container [2025-03-08 01:40:36,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:40:36" (3/3) ... [2025-03-08 01:40:36,427 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem10_label34.c [2025-03-08 01:40:36,437 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 01:40:36,439 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem10_label34.c that has 1 procedures, 206 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 01:40:36,482 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 01:40:36,489 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;@738a10d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 01:40:36,490 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 01:40:36,492 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 204 states have (on average 1.6813725490196079) internal successors, (343), 205 states have internal predecessors, (343), 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) [2025-03-08 01:40:36,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 01:40:36,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:40:36,498 INFO L218 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] [2025-03-08 01:40:36,498 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:40:36,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:40:36,501 INFO L85 PathProgramCache]: Analyzing trace with hash 755930345, now seen corresponding path program 1 times [2025-03-08 01:40:36,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:40:36,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478171571] [2025-03-08 01:40:36,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:40:36,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:40:36,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 01:40:36,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 01:40:36,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:40:36,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:40:36,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:40:36,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:40:36,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478171571] [2025-03-08 01:40:36,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478171571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:40:36,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:40:36,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:40:36,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728690321] [2025-03-08 01:40:36,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:40:36,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:40:36,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:40:36,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:40:36,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:40:36,985 INFO L87 Difference]: Start difference. First operand has 206 states, 204 states have (on average 1.6813725490196079) internal successors, (343), 205 states have internal predecessors, (343), 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 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 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) [2025-03-08 01:40:37,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:40:37,978 INFO L93 Difference]: Finished difference Result 696 states and 1244 transitions. [2025-03-08 01:40:37,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:40:37,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 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 63 [2025-03-08 01:40:37,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:40:37,991 INFO L225 Difference]: With dead ends: 696 [2025-03-08 01:40:37,991 INFO L226 Difference]: Without dead ends: 421 [2025-03-08 01:40:37,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:40:37,998 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 426 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 287 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 287 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 01:40:38,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 44 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [287 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 01:40:38,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-03-08 01:40:38,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2025-03-08 01:40:38,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.3833333333333333) internal successors, (581), 420 states have internal predecessors, (581), 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) [2025-03-08 01:40:38,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 581 transitions. [2025-03-08 01:40:38,041 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 581 transitions. Word has length 63 [2025-03-08 01:40:38,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:40:38,041 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 581 transitions. [2025-03-08 01:40:38,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 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) [2025-03-08 01:40:38,041 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 581 transitions. [2025-03-08 01:40:38,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-08 01:40:38,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:40:38,045 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:40:38,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 01:40:38,045 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:40:38,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:40:38,046 INFO L85 PathProgramCache]: Analyzing trace with hash -320224048, now seen corresponding path program 1 times [2025-03-08 01:40:38,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:40:38,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55469975] [2025-03-08 01:40:38,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:40:38,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:40:38,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 01:40:38,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 01:40:38,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:40:38,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:40:38,510 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:40:38,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:40:38,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55469975] [2025-03-08 01:40:38,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55469975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:40:38,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:40:38,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:40:38,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466139109] [2025-03-08 01:40:38,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:40:38,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:40:38,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:40:38,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:40:38,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:40:38,514 INFO L87 Difference]: Start difference. First operand 421 states and 581 transitions. Second operand has 4 states, 4 states have (on average 45.25) internal successors, (181), 3 states have internal predecessors, (181), 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) [2025-03-08 01:40:38,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:40:38,902 INFO L93 Difference]: Finished difference Result 701 states and 1011 transitions. [2025-03-08 01:40:38,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:40:38,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 3 states have internal predecessors, (181), 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 181 [2025-03-08 01:40:38,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:40:38,905 INFO L225 Difference]: With dead ends: 701 [2025-03-08 01:40:38,905 INFO L226 Difference]: Without dead ends: 421 [2025-03-08 01:40:38,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:40:38,906 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 87 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:40:38,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 87 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 01:40:38,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-03-08 01:40:38,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2025-03-08 01:40:38,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.3714285714285714) internal successors, (576), 420 states have internal predecessors, (576), 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) [2025-03-08 01:40:38,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 576 transitions. [2025-03-08 01:40:38,926 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 576 transitions. Word has length 181 [2025-03-08 01:40:38,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:40:38,926 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 576 transitions. [2025-03-08 01:40:38,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 3 states have internal predecessors, (181), 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) [2025-03-08 01:40:38,927 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 576 transitions. [2025-03-08 01:40:38,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-08 01:40:38,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:40:38,929 INFO L218 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:40:38,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 01:40:38,929 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:40:38,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:40:38,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1458338543, now seen corresponding path program 1 times [2025-03-08 01:40:38,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:40:38,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905914197] [2025-03-08 01:40:38,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:40:38,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:40:38,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-08 01:40:38,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-08 01:40:38,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:40:38,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:40:39,270 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:40:39,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:40:39,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905914197] [2025-03-08 01:40:39,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905914197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:40:39,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:40:39,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:40:39,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222195477] [2025-03-08 01:40:39,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:40:39,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:40:39,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:40:39,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:40:39,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:40:39,272 INFO L87 Difference]: Start difference. First operand 421 states and 576 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 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) [2025-03-08 01:40:39,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:40:39,659 INFO L93 Difference]: Finished difference Result 840 states and 1220 transitions. [2025-03-08 01:40:39,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:40:39,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 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 207 [2025-03-08 01:40:39,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:40:39,662 INFO L225 Difference]: With dead ends: 840 [2025-03-08 01:40:39,663 INFO L226 Difference]: Without dead ends: 560 [2025-03-08 01:40:39,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:40:39,664 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 87 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:40:39,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 19 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 01:40:39,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-03-08 01:40:39,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2025-03-08 01:40:39,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.3774597495527727) internal successors, (770), 559 states have internal predecessors, (770), 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) [2025-03-08 01:40:39,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 770 transitions. [2025-03-08 01:40:39,677 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 770 transitions. Word has length 207 [2025-03-08 01:40:39,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:40:39,677 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 770 transitions. [2025-03-08 01:40:39,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 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) [2025-03-08 01:40:39,677 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 770 transitions. [2025-03-08 01:40:39,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-03-08 01:40:39,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:40:39,681 INFO L218 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 01:40:39,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 01:40:39,681 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:40:39,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:40:39,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1305005255, now seen corresponding path program 1 times [2025-03-08 01:40:39,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:40:39,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918732611] [2025-03-08 01:40:39,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:40:39,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:40:39,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-08 01:40:39,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-08 01:40:39,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:40:39,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:40:39,864 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:40:39,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:40:39,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918732611] [2025-03-08 01:40:39,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918732611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:40:39,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:40:39,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:40:39,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021718510] [2025-03-08 01:40:39,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:40:39,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:40:39,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:40:39,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:40:39,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:40:39,867 INFO L87 Difference]: Start difference. First operand 560 states and 770 transitions. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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) [2025-03-08 01:40:40,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:40:40,235 INFO L93 Difference]: Finished difference Result 1257 states and 1803 transitions. [2025-03-08 01:40:40,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:40:40,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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 223 [2025-03-08 01:40:40,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:40:40,240 INFO L225 Difference]: With dead ends: 1257 [2025-03-08 01:40:40,240 INFO L226 Difference]: Without dead ends: 838 [2025-03-08 01:40:40,240 INFO L434 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 [2025-03-08 01:40:40,242 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 50 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 01:40:40,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 215 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 01:40:40,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2025-03-08 01:40:40,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 699. [2025-03-08 01:40:40,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.316618911174785) internal successors, (919), 698 states have internal predecessors, (919), 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) [2025-03-08 01:40:40,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 919 transitions. [2025-03-08 01:40:40,253 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 919 transitions. Word has length 223 [2025-03-08 01:40:40,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:40:40,253 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 919 transitions. [2025-03-08 01:40:40,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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) [2025-03-08 01:40:40,253 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 919 transitions. [2025-03-08 01:40:40,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-03-08 01:40:40,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:40:40,255 INFO L218 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:40:40,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 01:40:40,255 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:40:40,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:40:40,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1498051690, now seen corresponding path program 1 times [2025-03-08 01:40:40,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:40:40,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071277070] [2025-03-08 01:40:40,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:40:40,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:40:40,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-03-08 01:40:40,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-03-08 01:40:40,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:40:40,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:40:40,602 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 01:40:40,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:40:40,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071277070] [2025-03-08 01:40:40,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071277070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:40:40,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:40:40,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 01:40:40,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828287699] [2025-03-08 01:40:40,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:40:40,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 01:40:40,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:40:40,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 01:40:40,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 01:40:40,605 INFO L87 Difference]: Start difference. First operand 699 states and 919 transitions. Second operand has 7 states, 7 states have (on average 35.857142857142854) internal successors, (251), 6 states have internal predecessors, (251), 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) [2025-03-08 01:40:41,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:40:41,013 INFO L93 Difference]: Finished difference Result 1312 states and 1747 transitions. [2025-03-08 01:40:41,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 01:40:41,013 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.857142857142854) internal successors, (251), 6 states have internal predecessors, (251), 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 256 [2025-03-08 01:40:41,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:40:41,016 INFO L225 Difference]: With dead ends: 1312 [2025-03-08 01:40:41,016 INFO L226 Difference]: Without dead ends: 699 [2025-03-08 01:40:41,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 01:40:41,018 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 142 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:40:41,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 25 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 01:40:41,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-03-08 01:40:41,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2025-03-08 01:40:41,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.310888252148997) internal successors, (915), 698 states have internal predecessors, (915), 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) [2025-03-08 01:40:41,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 915 transitions. [2025-03-08 01:40:41,032 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 915 transitions. Word has length 256 [2025-03-08 01:40:41,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:40:41,032 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 915 transitions. [2025-03-08 01:40:41,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.857142857142854) internal successors, (251), 6 states have internal predecessors, (251), 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) [2025-03-08 01:40:41,032 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 915 transitions. [2025-03-08 01:40:41,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-03-08 01:40:41,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:40:41,034 INFO L218 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, 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, 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] [2025-03-08 01:40:41,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 01:40:41,034 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:40:41,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:40:41,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1438168572, now seen corresponding path program 1 times [2025-03-08 01:40:41,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:40:41,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581503373] [2025-03-08 01:40:41,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:40:41,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:40:41,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-08 01:40:41,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-08 01:40:41,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:40:41,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:40:41,240 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 231 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:40:41,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:40:41,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581503373] [2025-03-08 01:40:41,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581503373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:40:41,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:40:41,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:40:41,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084636328] [2025-03-08 01:40:41,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:40:41,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:40:41,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:40:41,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:40:41,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:40:41,242 INFO L87 Difference]: Start difference. First operand 699 states and 915 transitions. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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) [2025-03-08 01:40:41,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:40:41,603 INFO L93 Difference]: Finished difference Result 1394 states and 1887 transitions. [2025-03-08 01:40:41,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:40:41,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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 292 [2025-03-08 01:40:41,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:40:41,604 INFO L225 Difference]: With dead ends: 1394 [2025-03-08 01:40:41,604 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 01:40:41,606 INFO L434 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 [2025-03-08 01:40:41,608 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 35 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 01:40:41,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 187 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 01:40:41,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 01:40:41,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 01:40:41,609 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) [2025-03-08 01:40:41,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 01:40:41,609 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 292 [2025-03-08 01:40:41,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:40:41,609 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 01:40:41,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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) [2025-03-08 01:40:41,609 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 01:40:41,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 01:40:41,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 01:40:41,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 01:40:41,616 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-08 01:40:41,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 01:40:41,667 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 01:40:41,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 01:40:41 BoogieIcfgContainer [2025-03-08 01:40:41,682 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 01:40:41,682 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 01:40:41,682 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 01:40:41,682 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 01:40:41,683 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:40:36" (3/4) ... [2025-03-08 01:40:41,684 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 01:40:41,701 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-08 01:40:41,702 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 01:40:41,702 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 01:40:41,703 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 01:40:41,800 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 01:40:41,801 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 01:40:41,801 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 01:40:41,802 INFO L158 Benchmark]: Toolchain (without parser) took 6759.47ms. Allocated memory was 167.8MB in the beginning and 268.4MB in the end (delta: 100.7MB). Free memory was 131.9MB in the beginning and 116.8MB in the end (delta: 15.1MB). Peak memory consumption was 118.1MB. Max. memory is 16.1GB. [2025-03-08 01:40:41,802 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 01:40:41,802 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.51ms. Allocated memory is still 167.8MB. Free memory was 131.9MB in the beginning and 105.1MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 01:40:41,803 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.92ms. Allocated memory is still 167.8MB. Free memory was 105.1MB in the beginning and 97.5MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 01:40:41,803 INFO L158 Benchmark]: Boogie Preprocessor took 71.34ms. Allocated memory is still 167.8MB. Free memory was 97.5MB in the beginning and 88.6MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 01:40:41,803 INFO L158 Benchmark]: IcfgBuilder took 889.79ms. Allocated memory is still 167.8MB. Free memory was 88.6MB in the beginning and 81.0MB in the end (delta: 7.7MB). Peak memory consumption was 59.6MB. Max. memory is 16.1GB. [2025-03-08 01:40:41,803 INFO L158 Benchmark]: TraceAbstraction took 5260.01ms. Allocated memory was 167.8MB in the beginning and 268.4MB in the end (delta: 100.7MB). Free memory was 80.2MB in the beginning and 129.1MB in the end (delta: -49.0MB). Peak memory consumption was 50.1MB. Max. memory is 16.1GB. [2025-03-08 01:40:41,804 INFO L158 Benchmark]: Witness Printer took 118.55ms. Allocated memory is still 268.4MB. Free memory was 129.1MB in the beginning and 116.8MB in the end (delta: 12.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 01:40:41,806 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.24ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.51ms. Allocated memory is still 167.8MB. Free memory was 131.9MB in the beginning and 105.1MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.92ms. Allocated memory is still 167.8MB. Free memory was 105.1MB in the beginning and 97.5MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.34ms. Allocated memory is still 167.8MB. Free memory was 97.5MB in the beginning and 88.6MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 889.79ms. Allocated memory is still 167.8MB. Free memory was 88.6MB in the beginning and 81.0MB in the end (delta: 7.7MB). Peak memory consumption was 59.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5260.01ms. Allocated memory was 167.8MB in the beginning and 268.4MB in the end (delta: 100.7MB). Free memory was 80.2MB in the beginning and 129.1MB in the end (delta: -49.0MB). Peak memory consumption was 50.1MB. Max. memory is 16.1GB. * Witness Printer took 118.55ms. Allocated memory is still 268.4MB. Free memory was 129.1MB in the beginning and 116.8MB in the end (delta: 12.3MB). Peak memory consumption was 16.8MB. 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: 203]: 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, 206 locations, 343 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 827 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 827 mSDsluCounter, 577 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51 mSDsCounter, 519 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3039 IncrementalHoareTripleChecker+Invalid, 3558 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 519 mSolverCounterUnsat, 526 mSDtfsCounter, 3039 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=699occurred in iteration=4, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 139 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1222 NumberOfCodeBlocks, 1222 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1216 ConstructedInterpolants, 0 QuantifiedInterpolants, 4873 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 858/858 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 592]: Location Invariant Derived location invariant: (((((14 == a4) && (a10 == 2)) && (a12 == 0)) || (((14 == a4) && (7 != a19)) && (a12 == 0))) || (((a10 == 1) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2025-03-08 01:40:41,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE