./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label22.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_label22.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 d1a3abd6c92a6d0d0dc43edf8f70faeb8d7cb6d143fe14753200dcbb4ae12846 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:49:07,042 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:49:07,083 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:49:07,089 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:49:07,089 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:49:07,106 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:49:07,107 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:49:07,107 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:49:07,107 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:49:07,107 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:49:07,107 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:49:07,107 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:49:07,107 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:49:07,107 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:49:07,107 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:49:07,108 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:49:07,108 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:49:07,108 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:49:07,108 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:49:07,108 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:49:07,108 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:49:07,108 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:49:07,108 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:49:07,108 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:49:07,108 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:49:07,108 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:49:07,108 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:49:07,108 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:49:07,108 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:49:07,108 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:49:07,108 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:49:07,108 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:49:07,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:49:07,109 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:49:07,109 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:49:07,109 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:49:07,109 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:49:07,109 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:49:07,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:49:07,109 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:49:07,109 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:49:07,109 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:49:07,109 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:49:07,109 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 -> d1a3abd6c92a6d0d0dc43edf8f70faeb8d7cb6d143fe14753200dcbb4ae12846 [2025-03-16 14:49:07,334 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:49:07,343 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:49:07,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:49:07,346 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:49:07,346 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:49:07,347 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label22.c [2025-03-16 14:49:08,506 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dd895949/f9c21fcca8d64d6c9c629e3d7808df24/FLAGa740b01dc [2025-03-16 14:49:08,765 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:49:08,765 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label22.c [2025-03-16 14:49:08,788 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dd895949/f9c21fcca8d64d6c9c629e3d7808df24/FLAGa740b01dc [2025-03-16 14:49:09,064 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dd895949/f9c21fcca8d64d6c9c629e3d7808df24 [2025-03-16 14:49:09,066 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:49:09,067 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:49:09,068 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:49:09,068 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:49:09,071 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:49:09,071 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:49:09" (1/1) ... [2025-03-16 14:49:09,072 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@110580f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:09, skipping insertion in model container [2025-03-16 14:49:09,072 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:49:09" (1/1) ... [2025-03-16 14:49:09,098 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:49:09,219 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_label22.c[4319,4332] [2025-03-16 14:49:09,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:49:09,313 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:49:09,324 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_label22.c[4319,4332] [2025-03-16 14:49:09,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:49:09,377 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:49:09,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:09 WrapperNode [2025-03-16 14:49:09,377 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:49:09,378 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:49:09,378 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:49:09,378 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:49:09,382 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:09" (1/1) ... [2025-03-16 14:49:09,392 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:09" (1/1) ... [2025-03-16 14:49:09,430 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 595 [2025-03-16 14:49:09,430 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:49:09,431 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:49:09,431 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:49:09,431 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:49:09,437 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:09" (1/1) ... [2025-03-16 14:49:09,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:09" (1/1) ... [2025-03-16 14:49:09,445 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:09" (1/1) ... [2025-03-16 14:49:09,468 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-16 14:49:09,468 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:09" (1/1) ... [2025-03-16 14:49:09,468 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:09" (1/1) ... [2025-03-16 14:49:09,482 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:09" (1/1) ... [2025-03-16 14:49:09,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:09" (1/1) ... [2025-03-16 14:49:09,489 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:09" (1/1) ... [2025-03-16 14:49:09,491 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:09" (1/1) ... [2025-03-16 14:49:09,500 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:49:09,503 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:49:09,503 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:49:09,503 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:49:09,505 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:09" (1/1) ... [2025-03-16 14:49:09,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:49:09,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:49:09,530 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-16 14:49:09,536 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-16 14:49:09,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:49:09,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:49:09,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:49:09,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:49:09,602 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:49:09,603 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:49:10,357 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-03-16 14:49:10,358 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:49:10,386 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:49:10,386 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:49:10,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:49:10 BoogieIcfgContainer [2025-03-16 14:49:10,386 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:49:10,388 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:49:10,388 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:49:10,392 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:49:10,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:49:09" (1/3) ... [2025-03-16 14:49:10,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@324e3766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:49:10, skipping insertion in model container [2025-03-16 14:49:10,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:09" (2/3) ... [2025-03-16 14:49:10,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@324e3766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:49:10, skipping insertion in model container [2025-03-16 14:49:10,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:49:10" (3/3) ... [2025-03-16 14:49:10,394 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem10_label22.c [2025-03-16 14:49:10,404 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:49:10,406 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem10_label22.c that has 1 procedures, 145 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:49:10,448 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:49:10,456 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;@5ff9bd7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:49:10,456 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:49:10,461 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 143 states have (on average 1.972027972027972) internal successors, (282), 144 states have internal predecessors, (282), 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-16 14:49:10,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 14:49:10,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:49:10,466 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] [2025-03-16 14:49:10,467 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:49:10,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:49:10,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1784183226, now seen corresponding path program 1 times [2025-03-16 14:49:10,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:49:10,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428417805] [2025-03-16 14:49:10,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:49:10,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:49:10,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 14:49:10,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 14:49:10,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:49:10,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:49:10,559 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-16 14:49:10,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:49:10,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428417805] [2025-03-16 14:49:10,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428417805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:49:10,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:49:10,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:49:10,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050710955] [2025-03-16 14:49:10,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:49:10,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:49:10,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:49:10,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:49:10,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:49:10,578 INFO L87 Difference]: Start difference. First operand has 145 states, 143 states have (on average 1.972027972027972) internal successors, (282), 144 states have internal predecessors, (282), 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 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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-16 14:49:10,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:49:10,602 INFO L93 Difference]: Finished difference Result 289 states and 563 transitions. [2025-03-16 14:49:10,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:49:10,604 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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 36 [2025-03-16 14:49:10,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:49:10,611 INFO L225 Difference]: With dead ends: 289 [2025-03-16 14:49:10,611 INFO L226 Difference]: Without dead ends: 142 [2025-03-16 14:49:10,612 INFO L434 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 [2025-03-16 14:49:10,614 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:49:10,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:49:10,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-16 14:49:10,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2025-03-16 14:49:10,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.5390070921985815) internal successors, (217), 141 states have internal predecessors, (217), 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-16 14:49:10,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 217 transitions. [2025-03-16 14:49:10,640 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 217 transitions. Word has length 36 [2025-03-16 14:49:10,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:49:10,640 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 217 transitions. [2025-03-16 14:49:10,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 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-16 14:49:10,640 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 217 transitions. [2025-03-16 14:49:10,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 14:49:10,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:49:10,641 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] [2025-03-16 14:49:10,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:49:10,641 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:49:10,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:49:10,641 INFO L85 PathProgramCache]: Analyzing trace with hash -758614117, now seen corresponding path program 1 times [2025-03-16 14:49:10,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:49:10,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939631664] [2025-03-16 14:49:10,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:49:10,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:49:10,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 14:49:10,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 14:49:10,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:49:10,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:49:10,808 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-16 14:49:10,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:49:10,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939631664] [2025-03-16 14:49:10,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939631664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:49:10,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:49:10,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:49:10,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617309786] [2025-03-16 14:49:10,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:49:10,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:49:10,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:49:10,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:49:10,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:49:10,810 INFO L87 Difference]: Start difference. First operand 142 states and 217 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 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-16 14:49:11,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:49:11,298 INFO L93 Difference]: Finished difference Result 422 states and 648 transitions. [2025-03-16 14:49:11,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:49:11,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 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 36 [2025-03-16 14:49:11,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:49:11,300 INFO L225 Difference]: With dead ends: 422 [2025-03-16 14:49:11,300 INFO L226 Difference]: Without dead ends: 281 [2025-03-16 14:49:11,301 INFO L434 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 [2025-03-16 14:49:11,301 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 107 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:49:11,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 30 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:49:11,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-03-16 14:49:11,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2025-03-16 14:49:11,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 1.4678571428571427) internal successors, (411), 280 states have internal predecessors, (411), 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-16 14:49:11,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 411 transitions. [2025-03-16 14:49:11,317 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 411 transitions. Word has length 36 [2025-03-16 14:49:11,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:49:11,317 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 411 transitions. [2025-03-16 14:49:11,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 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-16 14:49:11,318 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 411 transitions. [2025-03-16 14:49:11,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-16 14:49:11,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:49:11,319 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:49:11,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:49:11,320 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:49:11,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:49:11,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1295636491, now seen corresponding path program 1 times [2025-03-16 14:49:11,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:49:11,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267357281] [2025-03-16 14:49:11,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:49:11,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:49:11,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 14:49:11,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 14:49:11,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:49:11,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:49:11,510 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:49:11,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:49:11,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267357281] [2025-03-16 14:49:11,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267357281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:49:11,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:49:11,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:49:11,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214355145] [2025-03-16 14:49:11,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:49:11,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:49:11,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:49:11,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:49:11,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:49:11,512 INFO L87 Difference]: Start difference. First operand 281 states and 411 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 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-16 14:49:11,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:49:11,923 INFO L93 Difference]: Finished difference Result 839 states and 1230 transitions. [2025-03-16 14:49:11,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:49:11,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 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 106 [2025-03-16 14:49:11,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:49:11,926 INFO L225 Difference]: With dead ends: 839 [2025-03-16 14:49:11,926 INFO L226 Difference]: Without dead ends: 559 [2025-03-16 14:49:11,927 INFO L434 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 [2025-03-16 14:49:11,927 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 76 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:49:11,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 65 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:49:11,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-03-16 14:49:11,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2025-03-16 14:49:11,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.3082437275985663) internal successors, (730), 558 states have internal predecessors, (730), 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-16 14:49:11,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 730 transitions. [2025-03-16 14:49:11,958 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 730 transitions. Word has length 106 [2025-03-16 14:49:11,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:49:11,958 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 730 transitions. [2025-03-16 14:49:11,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 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-16 14:49:11,958 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 730 transitions. [2025-03-16 14:49:11,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 14:49:11,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:49:11,960 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:49:11,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:49:11,960 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:49:11,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:49:11,960 INFO L85 PathProgramCache]: Analyzing trace with hash 390198948, now seen corresponding path program 1 times [2025-03-16 14:49:11,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:49:11,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937608784] [2025-03-16 14:49:11,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:49:11,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:49:11,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 14:49:11,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 14:49:11,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:49:11,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:49:12,200 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:49:12,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:49:12,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937608784] [2025-03-16 14:49:12,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937608784] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:49:12,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186083485] [2025-03-16 14:49:12,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:49:12,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:49:12,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:49:12,203 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) [2025-03-16 14:49:12,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 14:49:12,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 14:49:12,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 14:49:12,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:49:12,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:49:12,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:49:12,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:49:12,352 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:49:12,352 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:49:12,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186083485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:49:12,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:49:12,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:49:12,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911751482] [2025-03-16 14:49:12,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:49:12,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:49:12,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:49:12,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:49:12,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:49:12,353 INFO L87 Difference]: Start difference. First operand 559 states and 730 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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-16 14:49:12,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:49:12,699 INFO L93 Difference]: Finished difference Result 1117 states and 1459 transitions. [2025-03-16 14:49:12,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:49:12,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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 111 [2025-03-16 14:49:12,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:49:12,703 INFO L225 Difference]: With dead ends: 1117 [2025-03-16 14:49:12,703 INFO L226 Difference]: Without dead ends: 559 [2025-03-16 14:49:12,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:49:12,704 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 127 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:49:12,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 168 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:49:12,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-03-16 14:49:12,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2025-03-16 14:49:12,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.2706093189964158) internal successors, (709), 558 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) [2025-03-16 14:49:12,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 709 transitions. [2025-03-16 14:49:12,719 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 709 transitions. Word has length 111 [2025-03-16 14:49:12,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:49:12,720 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 709 transitions. [2025-03-16 14:49:12,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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-16 14:49:12,720 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 709 transitions. [2025-03-16 14:49:12,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 14:49:12,721 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:49:12,721 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:49:12,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 14:49:12,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:49:12,922 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:49:12,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:49:12,922 INFO L85 PathProgramCache]: Analyzing trace with hash -197882036, now seen corresponding path program 1 times [2025-03-16 14:49:12,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:49:12,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044161259] [2025-03-16 14:49:12,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:49:12,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:49:12,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 14:49:12,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 14:49:12,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:49:12,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:49:13,078 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:49:13,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:49:13,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044161259] [2025-03-16 14:49:13,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044161259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:49:13,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:49:13,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:49:13,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562969877] [2025-03-16 14:49:13,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:49:13,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:49:13,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:49:13,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:49:13,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:49:13,080 INFO L87 Difference]: Start difference. First operand 559 states and 709 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 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-16 14:49:13,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:49:13,483 INFO L93 Difference]: Finished difference Result 1673 states and 2124 transitions. [2025-03-16 14:49:13,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:49:13,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 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 132 [2025-03-16 14:49:13,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:49:13,487 INFO L225 Difference]: With dead ends: 1673 [2025-03-16 14:49:13,487 INFO L226 Difference]: Without dead ends: 1115 [2025-03-16 14:49:13,488 INFO L434 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 [2025-03-16 14:49:13,488 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 82 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:49:13,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 33 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:49:13,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2025-03-16 14:49:13,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1115. [2025-03-16 14:49:13,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 1114 states have (on average 1.2262118491921006) internal successors, (1366), 1114 states have internal predecessors, (1366), 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-16 14:49:13,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1366 transitions. [2025-03-16 14:49:13,510 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1366 transitions. Word has length 132 [2025-03-16 14:49:13,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:49:13,510 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1366 transitions. [2025-03-16 14:49:13,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 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-16 14:49:13,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1366 transitions. [2025-03-16 14:49:13,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-16 14:49:13,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:49:13,511 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:49:13,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:49:13,512 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:49:13,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:49:13,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1595400029, now seen corresponding path program 1 times [2025-03-16 14:49:13,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:49:13,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138855365] [2025-03-16 14:49:13,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:49:13,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:49:13,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-16 14:49:13,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-16 14:49:13,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:49:13,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:49:13,768 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:49:13,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:49:13,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138855365] [2025-03-16 14:49:13,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138855365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:49:13,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:49:13,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:49:13,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449209302] [2025-03-16 14:49:13,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:49:13,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:49:13,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:49:13,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:49:13,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:49:13,771 INFO L87 Difference]: Start difference. First operand 1115 states and 1366 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 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-16 14:49:14,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:49:14,105 INFO L93 Difference]: Finished difference Result 2368 states and 2880 transitions. [2025-03-16 14:49:14,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:49:14,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 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 149 [2025-03-16 14:49:14,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:49:14,109 INFO L225 Difference]: With dead ends: 2368 [2025-03-16 14:49:14,109 INFO L226 Difference]: Without dead ends: 1254 [2025-03-16 14:49:14,110 INFO L434 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 [2025-03-16 14:49:14,111 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 28 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:49:14,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 81 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:49:14,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2025-03-16 14:49:14,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1254. [2025-03-16 14:49:14,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 1253 states have (on average 1.2051077414205906) internal successors, (1510), 1253 states have internal predecessors, (1510), 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-16 14:49:14,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1510 transitions. [2025-03-16 14:49:14,133 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1510 transitions. Word has length 149 [2025-03-16 14:49:14,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:49:14,133 INFO L471 AbstractCegarLoop]: Abstraction has 1254 states and 1510 transitions. [2025-03-16 14:49:14,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 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-16 14:49:14,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1510 transitions. [2025-03-16 14:49:14,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-16 14:49:14,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:49:14,135 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:49:14,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:49:14,136 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:49:14,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:49:14,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1442777439, now seen corresponding path program 1 times [2025-03-16 14:49:14,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:49:14,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849815981] [2025-03-16 14:49:14,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:49:14,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:49:14,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-16 14:49:14,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-16 14:49:14,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:49:14,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:49:14,348 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 14:49:14,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:49:14,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849815981] [2025-03-16 14:49:14,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849815981] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:49:14,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806033388] [2025-03-16 14:49:14,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:49:14,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:49:14,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:49:14,350 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) [2025-03-16 14:49:14,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 14:49:14,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-16 14:49:14,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-16 14:49:14,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:49:14,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:49:14,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:49:14,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:49:14,588 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-16 14:49:14,588 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:49:14,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806033388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:49:14,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:49:14,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-16 14:49:14,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042285306] [2025-03-16 14:49:14,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:49:14,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:49:14,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:49:14,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:49:14,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:49:14,590 INFO L87 Difference]: Start difference. First operand 1254 states and 1510 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 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-16 14:49:14,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:49:14,922 INFO L93 Difference]: Finished difference Result 1673 states and 2019 transitions. [2025-03-16 14:49:14,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:49:14,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 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 166 [2025-03-16 14:49:14,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:49:14,927 INFO L225 Difference]: With dead ends: 1673 [2025-03-16 14:49:14,928 INFO L226 Difference]: Without dead ends: 1671 [2025-03-16 14:49:14,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:49:14,930 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 45 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:49:14,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 20 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:49:14,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2025-03-16 14:49:14,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1254. [2025-03-16 14:49:14,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 1253 states have (on average 1.2043096568236233) internal successors, (1509), 1253 states have internal predecessors, (1509), 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-16 14:49:14,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1509 transitions. [2025-03-16 14:49:14,954 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1509 transitions. Word has length 166 [2025-03-16 14:49:14,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:49:14,955 INFO L471 AbstractCegarLoop]: Abstraction has 1254 states and 1509 transitions. [2025-03-16 14:49:14,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 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-16 14:49:14,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1509 transitions. [2025-03-16 14:49:14,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-16 14:49:14,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:49:14,957 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, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:49:14,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 14:49:15,157 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,SelfDestructingSolverStorable6 [2025-03-16 14:49:15,157 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:49:15,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:49:15,158 INFO L85 PathProgramCache]: Analyzing trace with hash 434006736, now seen corresponding path program 1 times [2025-03-16 14:49:15,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:49:15,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4052709] [2025-03-16 14:49:15,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:49:15,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:49:15,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-16 14:49:15,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-16 14:49:15,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:49:15,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:49:15,381 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 29 proven. 40 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-16 14:49:15,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:49:15,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4052709] [2025-03-16 14:49:15,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4052709] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:49:15,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588391776] [2025-03-16 14:49:15,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:49:15,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:49:15,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:49:15,386 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) [2025-03-16 14:49:15,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 14:49:15,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-16 14:49:15,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-16 14:49:15,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:49:15,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:49:15,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:49:15,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:49:15,501 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-16 14:49:15,501 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:49:15,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588391776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:49:15,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:49:15,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:49:15,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229941824] [2025-03-16 14:49:15,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:49:15,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:49:15,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:49:15,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:49:15,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:49:15,502 INFO L87 Difference]: Start difference. First operand 1254 states and 1509 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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-16 14:49:15,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:49:15,841 INFO L93 Difference]: Finished difference Result 1671 states and 2016 transitions. [2025-03-16 14:49:15,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:49:15,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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 [2025-03-16 14:49:15,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:49:15,842 INFO L225 Difference]: With dead ends: 1671 [2025-03-16 14:49:15,842 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 14:49:15,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:49:15,844 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 146 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:49:15,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 7 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:49:15,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 14:49:15,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 14:49:15,845 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-16 14:49:15,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 14:49:15,845 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 210 [2025-03-16 14:49:15,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:49:15,845 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 14:49:15,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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-16 14:49:15,845 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 14:49:15,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 14:49:15,847 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 14:49:15,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 14:49:16,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:49:16,051 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:49:16,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 14:49:16,129 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 14:49:16,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 02:49:16 BoogieIcfgContainer [2025-03-16 14:49:16,138 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 14:49:16,139 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 14:49:16,139 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 14:49:16,139 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 14:49:16,139 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:49:10" (3/4) ... [2025-03-16 14:49:16,141 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 14:49:16,152 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-16 14:49:16,152 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 14:49:16,153 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 14:49:16,153 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 14:49:16,246 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 14:49:16,246 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 14:49:16,246 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 14:49:16,249 INFO L158 Benchmark]: Toolchain (without parser) took 7179.93ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 112.0MB in the beginning and 147.5MB in the end (delta: -35.5MB). Peak memory consumption was 116.4MB. Max. memory is 16.1GB. [2025-03-16 14:49:16,249 INFO L158 Benchmark]: CDTParser took 0.95ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:49:16,249 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.68ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 84.6MB in the end (delta: 27.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-16 14:49:16,249 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.11ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 77.4MB in the end (delta: 7.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:49:16,249 INFO L158 Benchmark]: Boogie Preprocessor took 69.40ms. Allocated memory is still 142.6MB. Free memory was 77.4MB in the beginning and 69.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:49:16,249 INFO L158 Benchmark]: IcfgBuilder took 883.63ms. Allocated memory is still 142.6MB. Free memory was 69.0MB in the beginning and 108.2MB in the end (delta: -39.1MB). Peak memory consumption was 51.3MB. Max. memory is 16.1GB. [2025-03-16 14:49:16,249 INFO L158 Benchmark]: TraceAbstraction took 5750.63ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 107.3MB in the beginning and 159.0MB in the end (delta: -51.7MB). Peak memory consumption was 97.5MB. Max. memory is 16.1GB. [2025-03-16 14:49:16,250 INFO L158 Benchmark]: Witness Printer took 107.84ms. Allocated memory is still 293.6MB. Free memory was 159.0MB in the beginning and 147.5MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:49:16,251 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.95ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 309.68ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 84.6MB in the end (delta: 27.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.11ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 77.4MB in the end (delta: 7.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 69.40ms. Allocated memory is still 142.6MB. Free memory was 77.4MB in the beginning and 69.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 883.63ms. Allocated memory is still 142.6MB. Free memory was 69.0MB in the beginning and 108.2MB in the end (delta: -39.1MB). Peak memory consumption was 51.3MB. Max. memory is 16.1GB. * TraceAbstraction took 5750.63ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 107.3MB in the beginning and 159.0MB in the end (delta: -51.7MB). Peak memory consumption was 97.5MB. Max. memory is 16.1GB. * Witness Printer took 107.84ms. Allocated memory is still 293.6MB. Free memory was 159.0MB in the beginning and 147.5MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. 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: 125]: 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, 145 locations, 282 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 611 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 611 mSDsluCounter, 624 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 422 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2492 IncrementalHoareTripleChecker+Invalid, 2914 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 422 mSolverCounterUnsat, 599 mSDtfsCounter, 2492 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 505 GetRequests, 490 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1254occurred in iteration=6, InterpolantAutomatonStates: 23, 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, 8 MinimizatonAttempts, 417 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1433 NumberOfCodeBlocks, 1433 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1422 ConstructedInterpolants, 0 QuantifiedInterpolants, 5189 SizeOfPredicates, 0 NumberOfNonLiveVariables, 750 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 425/506 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: (((8 <= a19) || (a1 <= 23)) || (1 <= a10)) RESULT: Ultimate proved your program to be correct! [2025-03-16 14:49:16,271 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