./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem14_label05.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 e02cb01095391f043ac338e051aad38ada321e317716e1cbc4cb781d100f4706 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 01:56:18,947 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 01:56:18,999 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 01:56:19,004 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 01:56:19,004 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 01:56:19,021 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 01:56:19,023 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 01:56:19,023 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 01:56:19,024 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 01:56:19,024 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 01:56:19,025 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 01:56:19,025 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 01:56:19,025 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 01:56:19,025 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 01:56:19,025 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 01:56:19,025 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 01:56:19,026 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 01:56:19,026 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 01:56:19,026 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 01:56:19,026 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 01:56:19,026 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 01:56:19,026 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 01:56:19,026 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 01:56:19,026 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 01:56:19,026 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 01:56:19,026 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 01:56:19,026 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 01:56:19,026 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 01:56:19,026 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 01:56:19,027 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 01:56:19,027 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 01:56:19,027 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 01:56:19,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:56:19,027 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 01:56:19,027 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 01:56:19,027 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 01:56:19,027 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 01:56:19,027 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 01:56:19,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 01:56:19,027 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 01:56:19,027 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 01:56:19,028 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 01:56:19,028 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 01:56:19,028 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 -> e02cb01095391f043ac338e051aad38ada321e317716e1cbc4cb781d100f4706 [2025-03-08 01:56:19,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 01:56:19,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 01:56:19,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 01:56:19,259 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 01:56:19,259 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 01:56:19,260 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label05.c [2025-03-08 01:56:20,433 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98ffde2f4/4586d08874004f4fb304ec2c2384f49f/FLAG0faeb6282 [2025-03-08 01:56:20,709 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 01:56:20,710 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label05.c [2025-03-08 01:56:20,722 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98ffde2f4/4586d08874004f4fb304ec2c2384f49f/FLAG0faeb6282 [2025-03-08 01:56:21,004 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98ffde2f4/4586d08874004f4fb304ec2c2384f49f [2025-03-08 01:56:21,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 01:56:21,007 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 01:56:21,008 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 01:56:21,008 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 01:56:21,011 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 01:56:21,012 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:56:21" (1/1) ... [2025-03-08 01:56:21,012 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d9a7604 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:56:21, skipping insertion in model container [2025-03-08 01:56:21,012 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:56:21" (1/1) ... [2025-03-08 01:56:21,040 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 01:56:21,187 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/Problem14_label05.c[6428,6441] [2025-03-08 01:56:21,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:56:21,323 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 01:56:21,344 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/Problem14_label05.c[6428,6441] [2025-03-08 01:56:21,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:56:21,430 INFO L204 MainTranslator]: Completed translation [2025-03-08 01:56:21,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:56:21 WrapperNode [2025-03-08 01:56:21,432 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 01:56:21,432 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 01:56:21,432 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 01:56:21,433 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 01:56:21,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:56:21" (1/1) ... [2025-03-08 01:56:21,448 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:56:21" (1/1) ... [2025-03-08 01:56:21,494 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 856 [2025-03-08 01:56:21,494 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 01:56:21,495 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 01:56:21,495 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 01:56:21,495 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 01:56:21,502 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:56:21" (1/1) ... [2025-03-08 01:56:21,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:56:21" (1/1) ... [2025-03-08 01:56:21,510 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:56:21" (1/1) ... [2025-03-08 01:56:21,535 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 01:56:21,539 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:56:21" (1/1) ... [2025-03-08 01:56:21,540 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:56:21" (1/1) ... [2025-03-08 01:56:21,555 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:56:21" (1/1) ... [2025-03-08 01:56:21,557 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:56:21" (1/1) ... [2025-03-08 01:56:21,564 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:56:21" (1/1) ... [2025-03-08 01:56:21,568 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:56:21" (1/1) ... [2025-03-08 01:56:21,575 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 01:56:21,577 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 01:56:21,577 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 01:56:21,577 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 01:56:21,578 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:56:21" (1/1) ... [2025-03-08 01:56:21,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:56:21,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:56:21,605 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 01:56:21,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 01:56:21,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 01:56:21,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 01:56:21,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 01:56:21,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 01:56:21,665 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 01:56:21,666 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 01:56:22,652 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-03-08 01:56:22,653 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 01:56:22,667 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 01:56:22,670 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 01:56:22,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:56:22 BoogieIcfgContainer [2025-03-08 01:56:22,670 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 01:56:22,672 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 01:56:22,672 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 01:56:22,675 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 01:56:22,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:56:21" (1/3) ... [2025-03-08 01:56:22,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b800885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:56:22, skipping insertion in model container [2025-03-08 01:56:22,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:56:21" (2/3) ... [2025-03-08 01:56:22,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b800885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:56:22, skipping insertion in model container [2025-03-08 01:56:22,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:56:22" (3/3) ... [2025-03-08 01:56:22,678 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem14_label05.c [2025-03-08 01:56:22,690 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 01:56:22,692 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem14_label05.c that has 1 procedures, 245 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 01:56:22,741 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 01:56:22,751 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;@342af541, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 01:56:22,752 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 01:56:22,755 INFO L276 IsEmpty]: Start isEmpty. Operand has 245 states, 243 states have (on average 1.7325102880658436) internal successors, (421), 244 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:56:22,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 01:56:22,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:56:22,762 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:56:22,763 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:56:22,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:56:22,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1723606014, now seen corresponding path program 1 times [2025-03-08 01:56:22,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:56:22,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558365223] [2025-03-08 01:56:22,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:56:22,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:56:22,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 01:56:22,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 01:56:22,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:56:22,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:56:23,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:56:23,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:56:23,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558365223] [2025-03-08 01:56:23,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558365223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:56:23,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:56:23,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:56:23,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153071171] [2025-03-08 01:56:23,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:56:23,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:56:23,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:56:23,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:56:23,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:56:23,085 INFO L87 Difference]: Start difference. First operand has 245 states, 243 states have (on average 1.7325102880658436) internal successors, (421), 244 states have internal predecessors, (421), 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 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:56:23,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:56:23,826 INFO L93 Difference]: Finished difference Result 685 states and 1213 transitions. [2025-03-08 01:56:23,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:56:23,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-08 01:56:23,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:56:23,834 INFO L225 Difference]: With dead ends: 685 [2025-03-08 01:56:23,834 INFO L226 Difference]: Without dead ends: 360 [2025-03-08 01:56:23,836 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-08 01:56:23,838 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 155 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 01:56:23,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 139 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 01:56:23,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-08 01:56:23,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2025-03-08 01:56:23,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.4206128133704736) internal successors, (510), 359 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:56:23,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 510 transitions. [2025-03-08 01:56:23,873 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 510 transitions. Word has length 63 [2025-03-08 01:56:23,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:56:23,873 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 510 transitions. [2025-03-08 01:56:23,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:56:23,873 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 510 transitions. [2025-03-08 01:56:23,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 01:56:23,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:56:23,876 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:56:23,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 01:56:23,877 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:56:23,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:56:23,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1949451213, now seen corresponding path program 1 times [2025-03-08 01:56:23,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:56:23,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302458549] [2025-03-08 01:56:23,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:56:23,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:56:23,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 01:56:23,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 01:56:23,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:56:23,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:56:24,284 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:56:24,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:56:24,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302458549] [2025-03-08 01:56:24,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302458549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:56:24,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:56:24,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:56:24,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208238975] [2025-03-08 01:56:24,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:56:24,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:56:24,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:56:24,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:56:24,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:56:24,287 INFO L87 Difference]: Start difference. First operand 360 states and 510 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:56:25,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:56:25,064 INFO L93 Difference]: Finished difference Result 1074 states and 1446 transitions. [2025-03-08 01:56:25,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:56:25,064 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 3 states have internal predecessors, (142), 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 142 [2025-03-08 01:56:25,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:56:25,067 INFO L225 Difference]: With dead ends: 1074 [2025-03-08 01:56:25,067 INFO L226 Difference]: Without dead ends: 716 [2025-03-08 01:56:25,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:56:25,069 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 419 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 01:56:25,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 121 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 01:56:25,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2025-03-08 01:56:25,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2025-03-08 01:56:25,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 715 states have (on average 1.2615384615384615) internal successors, (902), 715 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:56:25,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 902 transitions. [2025-03-08 01:56:25,103 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 902 transitions. Word has length 142 [2025-03-08 01:56:25,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:56:25,104 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 902 transitions. [2025-03-08 01:56:25,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:56:25,104 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 902 transitions. [2025-03-08 01:56:25,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-08 01:56:25,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:56:25,107 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:56:25,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 01:56:25,107 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:56:25,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:56:25,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1836674034, now seen corresponding path program 1 times [2025-03-08 01:56:25,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:56:25,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961887568] [2025-03-08 01:56:25,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:56:25,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:56:25,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 01:56:25,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 01:56:25,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:56:25,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:56:25,362 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 01:56:25,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:56:25,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961887568] [2025-03-08 01:56:25,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961887568] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:56:25,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256799604] [2025-03-08 01:56:25,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:56:25,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:56:25,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:56:25,369 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-08 01:56:25,370 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-08 01:56:25,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 01:56:25,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 01:56:25,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:56:25,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:56:25,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:56:25,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:56:25,645 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 01:56:25,645 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:56:25,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256799604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:56:25,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:56:25,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-08 01:56:25,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736504589] [2025-03-08 01:56:25,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:56:25,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:56:25,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:56:25,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:56:25,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:56:25,648 INFO L87 Difference]: Start difference. First operand 716 states and 902 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:56:26,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:56:26,134 INFO L93 Difference]: Finished difference Result 1252 states and 1612 transitions. [2025-03-08 01:56:26,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:56:26,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 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 168 [2025-03-08 01:56:26,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:56:26,142 INFO L225 Difference]: With dead ends: 1252 [2025-03-08 01:56:26,143 INFO L226 Difference]: Without dead ends: 1250 [2025-03-08 01:56:26,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 167 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-08 01:56:26,145 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 91 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 01:56:26,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 36 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 01:56:26,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2025-03-08 01:56:26,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 894. [2025-03-08 01:56:26,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 893 states have (on average 1.3370660694288914) internal successors, (1194), 893 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:56:26,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1194 transitions. [2025-03-08 01:56:26,164 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1194 transitions. Word has length 168 [2025-03-08 01:56:26,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:56:26,164 INFO L471 AbstractCegarLoop]: Abstraction has 894 states and 1194 transitions. [2025-03-08 01:56:26,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:56:26,165 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1194 transitions. [2025-03-08 01:56:26,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-03-08 01:56:26,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:56:26,167 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:56:26,173 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-08 01:56:26,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:56:26,371 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:56:26,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:56:26,372 INFO L85 PathProgramCache]: Analyzing trace with hash 327979173, now seen corresponding path program 1 times [2025-03-08 01:56:26,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:56:26,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473485470] [2025-03-08 01:56:26,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:56:26,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:56:26,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-08 01:56:26,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-08 01:56:26,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:56:26,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:56:26,588 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-08 01:56:26,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:56:26,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473485470] [2025-03-08 01:56:26,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473485470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:56:26,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:56:26,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:56:26,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120971751] [2025-03-08 01:56:26,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:56:26,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:56:26,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:56:26,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:56:26,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:56:26,590 INFO L87 Difference]: Start difference. First operand 894 states and 1194 transitions. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:56:27,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:56:27,177 INFO L93 Difference]: Finished difference Result 1993 states and 2629 transitions. [2025-03-08 01:56:27,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:56:27,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 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 222 [2025-03-08 01:56:27,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:56:27,181 INFO L225 Difference]: With dead ends: 1993 [2025-03-08 01:56:27,181 INFO L226 Difference]: Without dead ends: 1072 [2025-03-08 01:56:27,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:56:27,182 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 102 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:56:27,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 121 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:56:27,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2025-03-08 01:56:27,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 1072. [2025-03-08 01:56:27,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 1071 states have (on average 1.1802054154995332) internal successors, (1264), 1071 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:56:27,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1264 transitions. [2025-03-08 01:56:27,198 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1264 transitions. Word has length 222 [2025-03-08 01:56:27,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:56:27,198 INFO L471 AbstractCegarLoop]: Abstraction has 1072 states and 1264 transitions. [2025-03-08 01:56:27,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:56:27,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1264 transitions. [2025-03-08 01:56:27,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-08 01:56:27,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:56:27,200 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:56:27,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 01:56:27,201 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:56:27,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:56:27,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1185579661, now seen corresponding path program 1 times [2025-03-08 01:56:27,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:56:27,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636441660] [2025-03-08 01:56:27,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:56:27,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:56:27,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-08 01:56:27,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-08 01:56:27,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:56:27,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:56:27,492 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 121 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:56:27,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:56:27,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636441660] [2025-03-08 01:56:27,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636441660] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:56:27,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669400923] [2025-03-08 01:56:27,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:56:27,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:56:27,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:56:27,495 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-08 01:56:27,497 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-08 01:56:27,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-08 01:56:27,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-08 01:56:27,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:56:27,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:56:27,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:56:27,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:56:27,635 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-08 01:56:27,635 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:56:27,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669400923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:56:27,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:56:27,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-08 01:56:27,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485288885] [2025-03-08 01:56:27,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:56:27,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:56:27,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:56:27,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:56:27,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 01:56:27,637 INFO L87 Difference]: Start difference. First operand 1072 states and 1264 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:56:28,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:56:28,061 INFO L93 Difference]: Finished difference Result 2498 states and 3033 transitions. [2025-03-08 01:56:28,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:56:28,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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 234 [2025-03-08 01:56:28,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:56:28,066 INFO L225 Difference]: With dead ends: 2498 [2025-03-08 01:56:28,066 INFO L226 Difference]: Without dead ends: 1428 [2025-03-08 01:56:28,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 01:56:28,067 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 120 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:56:28,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 85 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 01:56:28,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2025-03-08 01:56:28,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1072. [2025-03-08 01:56:28,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 1071 states have (on average 1.1802054154995332) internal successors, (1264), 1071 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:56:28,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1264 transitions. [2025-03-08 01:56:28,103 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1264 transitions. Word has length 234 [2025-03-08 01:56:28,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:56:28,103 INFO L471 AbstractCegarLoop]: Abstraction has 1072 states and 1264 transitions. [2025-03-08 01:56:28,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:56:28,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1264 transitions. [2025-03-08 01:56:28,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-03-08 01:56:28,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:56:28,105 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:56:28,112 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-08 01:56:28,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:56:28,310 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:56:28,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:56:28,310 INFO L85 PathProgramCache]: Analyzing trace with hash -232691292, now seen corresponding path program 1 times [2025-03-08 01:56:28,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:56:28,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655926837] [2025-03-08 01:56:28,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:56:28,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:56:28,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-08 01:56:28,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-08 01:56:28,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:56:28,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:56:28,483 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:56:28,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:56:28,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655926837] [2025-03-08 01:56:28,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655926837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:56:28,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:56:28,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:56:28,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027446835] [2025-03-08 01:56:28,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:56:28,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:56:28,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:56:28,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:56:28,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:56:28,485 INFO L87 Difference]: Start difference. First operand 1072 states and 1264 transitions. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:56:28,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:56:28,882 INFO L93 Difference]: Finished difference Result 2676 states and 3213 transitions. [2025-03-08 01:56:28,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:56:28,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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 237 [2025-03-08 01:56:28,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:56:28,886 INFO L225 Difference]: With dead ends: 2676 [2025-03-08 01:56:28,886 INFO L226 Difference]: Without dead ends: 1606 [2025-03-08 01:56:28,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:56:28,888 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 112 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:56:28,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 57 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 01:56:28,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2025-03-08 01:56:28,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1606. [2025-03-08 01:56:28,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1605 states have (on average 1.1576323987538941) internal successors, (1858), 1605 states have internal predecessors, (1858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:56:28,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1858 transitions. [2025-03-08 01:56:28,911 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 1858 transitions. Word has length 237 [2025-03-08 01:56:28,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:56:28,911 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 1858 transitions. [2025-03-08 01:56:28,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:56:28,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1858 transitions. [2025-03-08 01:56:28,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2025-03-08 01:56:28,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:56:28,914 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 01:56:28,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 01:56:28,914 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:56:28,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:56:28,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1470797390, now seen corresponding path program 1 times [2025-03-08 01:56:28,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:56:28,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847166591] [2025-03-08 01:56:28,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:56:28,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:56:28,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-03-08 01:56:28,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-03-08 01:56:28,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:56:28,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:56:29,226 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 237 proven. 130 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-08 01:56:29,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:56:29,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847166591] [2025-03-08 01:56:29,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847166591] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:56:29,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877012210] [2025-03-08 01:56:29,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:56:29,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:56:29,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:56:29,229 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-08 01:56:29,242 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-08 01:56:29,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-03-08 01:56:29,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-03-08 01:56:29,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:56:29,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:56:29,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:56:29,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:56:29,597 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2025-03-08 01:56:29,600 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:56:29,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877012210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:56:29,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:56:29,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-08 01:56:29,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99021222] [2025-03-08 01:56:29,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:56:29,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:56:29,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:56:29,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:56:29,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 01:56:29,601 INFO L87 Difference]: Start difference. First operand 1606 states and 1858 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 2 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:56:30,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:56:30,011 INFO L93 Difference]: Finished difference Result 3566 states and 4204 transitions. [2025-03-08 01:56:30,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:56:30,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 2 states have internal predecessors, (172), 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 356 [2025-03-08 01:56:30,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:56:30,018 INFO L225 Difference]: With dead ends: 3566 [2025-03-08 01:56:30,018 INFO L226 Difference]: Without dead ends: 2140 [2025-03-08 01:56:30,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 01:56:30,020 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 82 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:56:30,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 47 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 01:56:30,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2025-03-08 01:56:30,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1962. [2025-03-08 01:56:30,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1962 states, 1961 states have (on average 1.1330953595104538) internal successors, (2222), 1961 states have internal predecessors, (2222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:56:30,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2222 transitions. [2025-03-08 01:56:30,049 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2222 transitions. Word has length 356 [2025-03-08 01:56:30,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:56:30,049 INFO L471 AbstractCegarLoop]: Abstraction has 1962 states and 2222 transitions. [2025-03-08 01:56:30,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 2 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:56:30,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2222 transitions. [2025-03-08 01:56:30,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-03-08 01:56:30,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:56:30,053 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:56:30,060 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-08 01:56:30,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:56:30,254 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:56:30,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:56:30,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1303374558, now seen corresponding path program 1 times [2025-03-08 01:56:30,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:56:30,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112596271] [2025-03-08 01:56:30,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:56:30,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:56:30,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-03-08 01:56:30,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-03-08 01:56:30,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:56:30,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:56:30,531 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 447 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2025-03-08 01:56:30,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:56:30,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112596271] [2025-03-08 01:56:30,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112596271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:56:30,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:56:30,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:56:30,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199503212] [2025-03-08 01:56:30,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:56:30,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:56:30,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:56:30,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:56:30,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:56:30,533 INFO L87 Difference]: Start difference. First operand 1962 states and 2222 transitions. Second operand has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:56:31,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:56:31,014 INFO L93 Difference]: Finished difference Result 3951 states and 4494 transitions. [2025-03-08 01:56:31,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:56:31,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 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 433 [2025-03-08 01:56:31,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:56:31,020 INFO L225 Difference]: With dead ends: 3951 [2025-03-08 01:56:31,021 INFO L226 Difference]: Without dead ends: 2140 [2025-03-08 01:56:31,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:56:31,023 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 124 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 01:56:31,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 17 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 01:56:31,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2025-03-08 01:56:31,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1962. [2025-03-08 01:56:31,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1962 states, 1961 states have (on average 1.084140744518103) internal successors, (2126), 1961 states have internal predecessors, (2126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:56:31,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2126 transitions. [2025-03-08 01:56:31,051 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2126 transitions. Word has length 433 [2025-03-08 01:56:31,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:56:31,051 INFO L471 AbstractCegarLoop]: Abstraction has 1962 states and 2126 transitions. [2025-03-08 01:56:31,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:56:31,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2126 transitions. [2025-03-08 01:56:31,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-08 01:56:31,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:56:31,056 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:56:31,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 01:56:31,057 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:56:31,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:56:31,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1384393801, now seen corresponding path program 1 times [2025-03-08 01:56:31,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:56:31,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568168338] [2025-03-08 01:56:31,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:56:31,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:56:31,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-08 01:56:31,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-08 01:56:31,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:56:31,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:56:31,290 INFO L134 CoverageAnalysis]: Checked inductivity of 763 backedges. 449 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-08 01:56:31,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:56:31,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568168338] [2025-03-08 01:56:31,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568168338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:56:31,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:56:31,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:56:31,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947481744] [2025-03-08 01:56:31,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:56:31,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:56:31,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:56:31,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:56:31,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:56:31,292 INFO L87 Difference]: Start difference. First operand 1962 states and 2126 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:56:31,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:56:31,669 INFO L93 Difference]: Finished difference Result 4634 states and 5081 transitions. [2025-03-08 01:56:31,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:56:31,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 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 456 [2025-03-08 01:56:31,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:56:31,675 INFO L225 Difference]: With dead ends: 4634 [2025-03-08 01:56:31,676 INFO L226 Difference]: Without dead ends: 2852 [2025-03-08 01:56:31,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:56:31,678 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 113 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:56:31,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 220 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 01:56:31,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2025-03-08 01:56:31,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2496. [2025-03-08 01:56:31,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2496 states, 2495 states have (on average 1.0813627254509017) internal successors, (2698), 2495 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:56:31,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 2698 transitions. [2025-03-08 01:56:31,709 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 2698 transitions. Word has length 456 [2025-03-08 01:56:31,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:56:31,710 INFO L471 AbstractCegarLoop]: Abstraction has 2496 states and 2698 transitions. [2025-03-08 01:56:31,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:56:31,710 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 2698 transitions. [2025-03-08 01:56:31,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-03-08 01:56:31,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:56:31,725 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2025-03-08 01:56:31,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 01:56:31,725 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:56:31,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:56:31,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1976565853, now seen corresponding path program 1 times [2025-03-08 01:56:31,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:56:31,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583450042] [2025-03-08 01:56:31,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:56:31,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:56:31,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-08 01:56:31,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-08 01:56:31,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:56:31,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:56:32,136 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 493 proven. 195 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-08 01:56:32,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:56:32,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583450042] [2025-03-08 01:56:32,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583450042] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:56:32,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762984966] [2025-03-08 01:56:32,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:56:32,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:56:32,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:56:32,139 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:56:32,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 01:56:32,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-08 01:56:32,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-08 01:56:32,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:56:32,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:56:32,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:56:32,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:56:32,308 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2025-03-08 01:56:32,308 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:56:32,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762984966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:56:32,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:56:32,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-08 01:56:32,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953869505] [2025-03-08 01:56:32,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:56:32,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:56:32,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:56:32,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:56:32,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 01:56:32,310 INFO L87 Difference]: Start difference. First operand 2496 states and 2698 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:56:32,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:56:32,667 INFO L93 Difference]: Finished difference Result 3388 states and 3641 transitions. [2025-03-08 01:56:32,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:56:32,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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 459 [2025-03-08 01:56:32,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:56:32,674 INFO L225 Difference]: With dead ends: 3388 [2025-03-08 01:56:32,675 INFO L226 Difference]: Without dead ends: 3386 [2025-03-08 01:56:32,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 458 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 01:56:32,676 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 139 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 01:56:32,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 11 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 01:56:32,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2025-03-08 01:56:32,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 2496. [2025-03-08 01:56:32,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2496 states, 2495 states have (on average 1.0813627254509017) internal successors, (2698), 2495 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:56:32,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 2698 transitions. [2025-03-08 01:56:32,716 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 2698 transitions. Word has length 459 [2025-03-08 01:56:32,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:56:32,717 INFO L471 AbstractCegarLoop]: Abstraction has 2496 states and 2698 transitions. [2025-03-08 01:56:32,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:56:32,717 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 2698 transitions. [2025-03-08 01:56:32,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2025-03-08 01:56:32,721 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:56:32,721 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:56:32,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 01:56:32,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:56:32,922 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:56:32,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:56:32,923 INFO L85 PathProgramCache]: Analyzing trace with hash -576297618, now seen corresponding path program 1 times [2025-03-08 01:56:32,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:56:32,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969034883] [2025-03-08 01:56:32,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:56:32,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:56:32,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 497 statements into 1 equivalence classes. [2025-03-08 01:56:32,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 497 of 497 statements. [2025-03-08 01:56:32,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:56:32,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:56:33,099 INFO L134 CoverageAnalysis]: Checked inductivity of 877 backedges. 563 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-08 01:56:33,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:56:33,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969034883] [2025-03-08 01:56:33,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969034883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:56:33,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:56:33,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:56:33,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830113917] [2025-03-08 01:56:33,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:56:33,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:56:33,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:56:33,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:56:33,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:56:33,101 INFO L87 Difference]: Start difference. First operand 2496 states and 2698 transitions. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:56:33,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:56:33,468 INFO L93 Difference]: Finished difference Result 5524 states and 6044 transitions. [2025-03-08 01:56:33,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:56:33,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 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 497 [2025-03-08 01:56:33,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:56:33,476 INFO L225 Difference]: With dead ends: 5524 [2025-03-08 01:56:33,476 INFO L226 Difference]: Without dead ends: 3386 [2025-03-08 01:56:33,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:56:33,478 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 74 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 01:56:33,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 50 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 01:56:33,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2025-03-08 01:56:33,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 3386. [2025-03-08 01:56:33,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3386 states, 3385 states have (on average 1.0785819793205318) internal successors, (3651), 3385 states have internal predecessors, (3651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:56:33,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 3651 transitions. [2025-03-08 01:56:33,514 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 3651 transitions. Word has length 497 [2025-03-08 01:56:33,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:56:33,514 INFO L471 AbstractCegarLoop]: Abstraction has 3386 states and 3651 transitions. [2025-03-08 01:56:33,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:56:33,515 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 3651 transitions. [2025-03-08 01:56:33,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2025-03-08 01:56:33,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:56:33,518 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:56:33,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 01:56:33,518 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:56:33,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:56:33,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1300672843, now seen corresponding path program 1 times [2025-03-08 01:56:33,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:56:33,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678909162] [2025-03-08 01:56:33,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:56:33,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:56:33,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 528 statements into 1 equivalence classes. [2025-03-08 01:56:33,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 528 of 528 statements. [2025-03-08 01:56:33,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:56:33,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:56:33,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1129 backedges. 768 proven. 195 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2025-03-08 01:56:33,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:56:33,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678909162] [2025-03-08 01:56:33,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678909162] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:56:33,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805386108] [2025-03-08 01:56:33,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:56:33,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:56:33,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:56:33,948 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:56:33,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 01:56:33,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 528 statements into 1 equivalence classes. [2025-03-08 01:56:34,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 528 of 528 statements. [2025-03-08 01:56:34,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:56:34,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:56:34,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:56:34,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:56:34,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1129 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2025-03-08 01:56:34,128 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:56:34,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805386108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:56:34,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:56:34,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-08 01:56:34,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829374751] [2025-03-08 01:56:34,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:56:34,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:56:34,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:56:34,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:56:34,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 01:56:34,129 INFO L87 Difference]: Start difference. First operand 3386 states and 3651 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:56:34,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:56:34,464 INFO L93 Difference]: Finished difference Result 7482 states and 8160 transitions. [2025-03-08 01:56:34,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:56:34,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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 528 [2025-03-08 01:56:34,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:56:34,474 INFO L225 Difference]: With dead ends: 7482 [2025-03-08 01:56:34,474 INFO L226 Difference]: Without dead ends: 4454 [2025-03-08 01:56:34,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 527 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 01:56:34,477 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 118 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 01:56:34,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 247 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 01:56:34,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4454 states. [2025-03-08 01:56:34,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4454 to 4098. [2025-03-08 01:56:34,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4098 states, 4097 states have (on average 1.079326336343666) internal successors, (4422), 4097 states have internal predecessors, (4422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:56:34,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4422 transitions. [2025-03-08 01:56:34,525 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4422 transitions. Word has length 528 [2025-03-08 01:56:34,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:56:34,527 INFO L471 AbstractCegarLoop]: Abstraction has 4098 states and 4422 transitions. [2025-03-08 01:56:34,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:56:34,527 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4422 transitions. [2025-03-08 01:56:34,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2025-03-08 01:56:34,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:56:34,550 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:56:34,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 01:56:34,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 01:56:34,751 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:56:34,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:56:34,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1452901398, now seen corresponding path program 1 times [2025-03-08 01:56:34,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:56:34,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611743268] [2025-03-08 01:56:34,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:56:34,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:56:34,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 601 statements into 1 equivalence classes. [2025-03-08 01:56:34,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 601 of 601 statements. [2025-03-08 01:56:34,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:56:34,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:56:35,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 936 proven. 2 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2025-03-08 01:56:35,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:56:35,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611743268] [2025-03-08 01:56:35,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611743268] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:56:35,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421413916] [2025-03-08 01:56:35,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:56:35,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:56:35,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:56:35,100 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:56:35,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 01:56:35,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 601 statements into 1 equivalence classes. [2025-03-08 01:56:35,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 601 of 601 statements. [2025-03-08 01:56:35,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:56:35,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:56:35,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:56:35,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:56:35,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 1009 trivial. 0 not checked. [2025-03-08 01:56:35,301 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:56:35,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421413916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:56:35,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:56:35,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-08 01:56:35,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452043773] [2025-03-08 01:56:35,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:56:35,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:56:35,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:56:35,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:56:35,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 01:56:35,302 INFO L87 Difference]: Start difference. First operand 4098 states and 4422 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:56:35,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:56:35,699 INFO L93 Difference]: Finished difference Result 8372 states and 9111 transitions. [2025-03-08 01:56:35,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:56:35,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 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 601 [2025-03-08 01:56:35,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:56:35,711 INFO L225 Difference]: With dead ends: 8372 [2025-03-08 01:56:35,711 INFO L226 Difference]: Without dead ends: 4632 [2025-03-08 01:56:35,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 600 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 01:56:35,716 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 128 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:56:35,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 215 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 01:56:35,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2025-03-08 01:56:35,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4454. [2025-03-08 01:56:35,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4454 states, 4453 states have (on average 1.0790478329216258) internal successors, (4805), 4453 states have internal predecessors, (4805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:56:35,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4805 transitions. [2025-03-08 01:56:35,766 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4805 transitions. Word has length 601 [2025-03-08 01:56:35,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:56:35,766 INFO L471 AbstractCegarLoop]: Abstraction has 4454 states and 4805 transitions. [2025-03-08 01:56:35,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:56:35,767 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4805 transitions. [2025-03-08 01:56:35,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-03-08 01:56:35,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:56:35,772 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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] [2025-03-08 01:56:35,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 01:56:35,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:56:35,973 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:56:35,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:56:35,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1802462581, now seen corresponding path program 1 times [2025-03-08 01:56:35,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:56:35,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942698643] [2025-03-08 01:56:35,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:56:35,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:56:36,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-03-08 01:56:36,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-03-08 01:56:36,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:56:36,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:56:36,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1375 backedges. 998 proven. 2 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2025-03-08 01:56:36,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:56:36,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942698643] [2025-03-08 01:56:36,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942698643] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:56:36,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210571193] [2025-03-08 01:56:36,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:56:36,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:56:36,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:56:36,379 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:56:36,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 01:56:36,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-03-08 01:56:36,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-03-08 01:56:36,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:56:36,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:56:36,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 788 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:56:36,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:56:36,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1375 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 1071 trivial. 0 not checked. [2025-03-08 01:56:36,592 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:56:36,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210571193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:56:36,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:56:36,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-08 01:56:36,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087485398] [2025-03-08 01:56:36,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:56:36,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:56:36,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:56:36,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:56:36,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 01:56:36,594 INFO L87 Difference]: Start difference. First operand 4454 states and 4805 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:56:36,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:56:36,906 INFO L93 Difference]: Finished difference Result 9438 states and 10251 transitions. [2025-03-08 01:56:36,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:56:36,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 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 631 [2025-03-08 01:56:36,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:56:36,907 INFO L225 Difference]: With dead ends: 9438 [2025-03-08 01:56:36,907 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 01:56:36,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 635 GetRequests, 630 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 01:56:36,912 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 118 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 01:56:36,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 231 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 01:56:36,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 01:56:36,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 01:56:36,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:56:36,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 01:56:36,913 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 631 [2025-03-08 01:56:36,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:56:36,913 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 01:56:36,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:56:36,914 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 01:56:36,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 01:56:36,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 01:56:36,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 01:56:37,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:56:37,122 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:56:37,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 01:56:37,495 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 01:56:37,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 01:56:37 BoogieIcfgContainer [2025-03-08 01:56:37,509 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 01:56:37,509 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 01:56:37,509 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 01:56:37,509 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 01:56:37,510 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:56:22" (3/4) ... [2025-03-08 01:56:37,512 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 01:56:37,534 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-08 01:56:37,535 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 01:56:37,536 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 01:56:37,536 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 01:56:37,636 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 01:56:37,637 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 01:56:37,637 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 01:56:37,637 INFO L158 Benchmark]: Toolchain (without parser) took 16630.76ms. Allocated memory was 142.6MB in the beginning and 578.8MB in the end (delta: 436.2MB). Free memory was 103.7MB in the beginning and 299.8MB in the end (delta: -196.1MB). Peak memory consumption was 242.3MB. Max. memory is 16.1GB. [2025-03-08 01:56:37,638 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 01:56:37,638 INFO L158 Benchmark]: CACSL2BoogieTranslator took 423.60ms. Allocated memory is still 142.6MB. Free memory was 102.8MB in the beginning and 71.9MB in the end (delta: 30.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 01:56:37,639 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.99ms. Allocated memory is still 142.6MB. Free memory was 71.9MB in the beginning and 62.6MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 01:56:37,639 INFO L158 Benchmark]: Boogie Preprocessor took 80.73ms. Allocated memory is still 142.6MB. Free memory was 62.6MB in the beginning and 51.4MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 01:56:37,639 INFO L158 Benchmark]: IcfgBuilder took 1093.39ms. Allocated memory is still 142.6MB. Free memory was 51.4MB in the beginning and 69.6MB in the end (delta: -18.2MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. [2025-03-08 01:56:37,640 INFO L158 Benchmark]: TraceAbstraction took 14836.95ms. Allocated memory was 142.6MB in the beginning and 578.8MB in the end (delta: 436.2MB). Free memory was 68.7MB in the beginning and 316.2MB in the end (delta: -247.6MB). Peak memory consumption was 187.6MB. Max. memory is 16.1GB. [2025-03-08 01:56:37,640 INFO L158 Benchmark]: Witness Printer took 127.55ms. Allocated memory is still 578.8MB. Free memory was 312.4MB in the beginning and 299.8MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 01:56:37,641 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 423.60ms. Allocated memory is still 142.6MB. Free memory was 102.8MB in the beginning and 71.9MB in the end (delta: 30.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.99ms. Allocated memory is still 142.6MB. Free memory was 71.9MB in the beginning and 62.6MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.73ms. Allocated memory is still 142.6MB. Free memory was 62.6MB in the beginning and 51.4MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1093.39ms. Allocated memory is still 142.6MB. Free memory was 51.4MB in the beginning and 69.6MB in the end (delta: -18.2MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. * TraceAbstraction took 14836.95ms. Allocated memory was 142.6MB in the beginning and 578.8MB in the end (delta: 436.2MB). Free memory was 68.7MB in the beginning and 316.2MB in the end (delta: -247.6MB). Peak memory consumption was 187.6MB. Max. memory is 16.1GB. * Witness Printer took 127.55ms. Allocated memory is still 578.8MB. Free memory was 312.4MB in the beginning and 299.8MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 203]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 421 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.4s, OverallIterations: 14, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1895 SdHoareTripleChecker+Valid, 6.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1895 mSDsluCounter, 1597 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 876 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7368 IncrementalHoareTripleChecker+Invalid, 8244 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 876 mSolverCounterUnsat, 1521 mSDtfsCounter, 7368 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3023 GetRequests, 2980 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4454occurred in iteration=13, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 2848 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 8004 NumberOfCodeBlocks, 8004 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 7983 ConstructedInterpolants, 0 QuantifiedInterpolants, 28930 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3864 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 21 InterpolantComputations, 14 PerfectInterpolantSequences, 12801/13440 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: 890]: Location Invariant Derived location invariant: (((((((((a24 == 1) && (10 <= a21)) || (((((long long) a12 + 43) <= 0) && (a15 <= 8)) && (10 <= a21))) || ((a24 == 1) && (12 <= a12))) || (((((long long) a12 + 43) <= 0) && (a15 <= 8)) && (a21 == 9))) || ((6 <= a15) && (a24 == 1))) || ((a24 == 1) && (a21 <= 6))) || (((((long long) a12 + 43) <= 0) && (a15 <= 8)) && (a21 <= 6))) || ((a24 == 1) && (a21 == 9))) RESULT: Ultimate proved your program to be correct! [2025-03-08 01:56:37,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE