./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/reducercommutativity/sum05-2.i --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/reducercommutativity/sum05-2.i -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 11bff2dc480380b1206bedd51506b0437b9af4529e78b5beefb811437146f17f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:23:00,011 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:23:00,074 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:23:00,080 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:23:00,080 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:23:00,102 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:23:00,102 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:23:00,102 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:23:00,102 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:23:00,103 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:23:00,103 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:23:00,103 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:23:00,103 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:23:00,103 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:23:00,104 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:23:00,104 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:23:00,104 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:23:00,105 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:23:00,105 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:23:00,105 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:23:00,105 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:23:00,105 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:23:00,105 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:23:00,105 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:23:00,105 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:23:00,105 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:23:00,105 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:23:00,105 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:23:00,106 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:23:00,106 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:23:00,106 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:23:00,106 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:23:00,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:23:00,106 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:23:00,106 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:23:00,106 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:23:00,106 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:23:00,106 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:23:00,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:23:00,106 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:23:00,107 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:23:00,107 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:23:00,107 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:23:00,107 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 -> 11bff2dc480380b1206bedd51506b0437b9af4529e78b5beefb811437146f17f [2025-03-08 00:23:00,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:23:00,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:23:00,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:23:00,363 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:23:00,364 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:23:00,365 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/sum05-2.i [2025-03-08 00:23:01,530 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/585e7531c/a759fa4583464e168b7f670701952939/FLAGfc8b0348c [2025-03-08 00:23:01,751 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:23:01,751 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sum05-2.i [2025-03-08 00:23:01,758 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/585e7531c/a759fa4583464e168b7f670701952939/FLAGfc8b0348c [2025-03-08 00:23:02,095 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/585e7531c/a759fa4583464e168b7f670701952939 [2025-03-08 00:23:02,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:23:02,098 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:23:02,099 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:23:02,099 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:23:02,101 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:23:02,102 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:23:02" (1/1) ... [2025-03-08 00:23:02,103 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4618bf2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:02, skipping insertion in model container [2025-03-08 00:23:02,103 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:23:02" (1/1) ... [2025-03-08 00:23:02,116 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:23:02,228 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/reducercommutativity/sum05-2.i[1271,1284] [2025-03-08 00:23:02,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:23:02,237 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:23:02,248 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/reducercommutativity/sum05-2.i[1271,1284] [2025-03-08 00:23:02,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:23:02,258 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:23:02,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:02 WrapperNode [2025-03-08 00:23:02,259 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:23:02,259 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:23:02,262 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:23:02,262 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:23:02,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:02" (1/1) ... [2025-03-08 00:23:02,271 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:02" (1/1) ... [2025-03-08 00:23:02,284 INFO L138 Inliner]: procedures = 16, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 63 [2025-03-08 00:23:02,284 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:23:02,285 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:23:02,285 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:23:02,285 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:23:02,289 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:02" (1/1) ... [2025-03-08 00:23:02,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:02" (1/1) ... [2025-03-08 00:23:02,291 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:02" (1/1) ... [2025-03-08 00:23:02,297 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2025-03-08 00:23:02,297 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:02" (1/1) ... [2025-03-08 00:23:02,298 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:02" (1/1) ... [2025-03-08 00:23:02,300 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:02" (1/1) ... [2025-03-08 00:23:02,301 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:02" (1/1) ... [2025-03-08 00:23:02,301 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:02" (1/1) ... [2025-03-08 00:23:02,302 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:02" (1/1) ... [2025-03-08 00:23:02,303 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:23:02,303 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:23:02,303 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:23:02,303 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:23:02,304 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:02" (1/1) ... [2025-03-08 00:23:02,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:23:02,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:23:02,327 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 00:23:02,329 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 00:23:02,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:23:02,346 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2025-03-08 00:23:02,346 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2025-03-08 00:23:02,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:23:02,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:23:02,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 00:23:02,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:23:02,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:23:02,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:23:02,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:23:02,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:23:02,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:23:02,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 00:23:02,401 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:23:02,402 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:23:02,486 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L28: call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset; [2025-03-08 00:23:02,507 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 00:23:02,508 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:23:02,515 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:23:02,515 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:23:02,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:23:02 BoogieIcfgContainer [2025-03-08 00:23:02,516 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:23:02,518 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:23:02,518 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:23:02,522 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:23:02,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:23:02" (1/3) ... [2025-03-08 00:23:02,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7031c2de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:23:02, skipping insertion in model container [2025-03-08 00:23:02,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:23:02" (2/3) ... [2025-03-08 00:23:02,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7031c2de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:23:02, skipping insertion in model container [2025-03-08 00:23:02,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:23:02" (3/3) ... [2025-03-08 00:23:02,525 INFO L128 eAbstractionObserver]: Analyzing ICFG sum05-2.i [2025-03-08 00:23:02,537 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:23:02,538 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sum05-2.i that has 2 procedures, 21 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-08 00:23:02,582 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:23:02,591 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;@3cedaa2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:23:02,593 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:23:02,596 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:23:02,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 00:23:02,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:23:02,600 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:23:02,600 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:23:02,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:23:02,604 INFO L85 PathProgramCache]: Analyzing trace with hash -871894356, now seen corresponding path program 1 times [2025-03-08 00:23:02,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:23:02,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534364985] [2025-03-08 00:23:02,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:23:02,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:23:02,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 00:23:02,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 00:23:02,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:23:02,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:02,844 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:23:02,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:23:02,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534364985] [2025-03-08 00:23:02,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534364985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:23:02,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:23:02,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:23:02,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945821505] [2025-03-08 00:23:02,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:23:02,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:23:02,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:23:02,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:23:02,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:23:02,864 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:23:02,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:23:02,888 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2025-03-08 00:23:02,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:23:02,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2025-03-08 00:23:02,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:23:02,893 INFO L225 Difference]: With dead ends: 40 [2025-03-08 00:23:02,893 INFO L226 Difference]: Without dead ends: 18 [2025-03-08 00:23:02,895 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 00:23:02,897 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:23:02,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:23:02,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-08 00:23:02,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-08 00:23:02,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:23:02,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-03-08 00:23:02,918 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 24 [2025-03-08 00:23:02,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:23:02,918 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-03-08 00:23:02,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:23:02,918 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-03-08 00:23:02,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 00:23:02,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:23:02,919 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:23:02,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:23:02,919 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:23:02,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:23:02,920 INFO L85 PathProgramCache]: Analyzing trace with hash -753694787, now seen corresponding path program 1 times [2025-03-08 00:23:02,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:23:02,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358281582] [2025-03-08 00:23:02,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:23:02,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:23:02,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 00:23:02,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:23:02,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:23:02,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:03,093 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:23:03,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:23:03,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358281582] [2025-03-08 00:23:03,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358281582] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:23:03,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672761423] [2025-03-08 00:23:03,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:23:03,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:23:03,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:23:03,096 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 00:23:03,098 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 00:23:03,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 00:23:03,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:23:03,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:23:03,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:03,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:23:03,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:23:03,199 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 00:23:03,200 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:23:03,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672761423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:23:03,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:23:03,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 00:23:03,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964658023] [2025-03-08 00:23:03,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:23:03,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:23:03,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:23:03,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:23:03,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:23:03,204 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:23:03,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:23:03,212 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2025-03-08 00:23:03,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:23:03,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2025-03-08 00:23:03,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:23:03,214 INFO L225 Difference]: With dead ends: 32 [2025-03-08 00:23:03,214 INFO L226 Difference]: Without dead ends: 19 [2025-03-08 00:23:03,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:23:03,215 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:23:03,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:23:03,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-08 00:23:03,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-03-08 00:23:03,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:23:03,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2025-03-08 00:23:03,222 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 25 [2025-03-08 00:23:03,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:23:03,222 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-03-08 00:23:03,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:23:03,222 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2025-03-08 00:23:03,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 00:23:03,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:23:03,223 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:23:03,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 00:23:03,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:23:03,428 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:23:03,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:23:03,429 INFO L85 PathProgramCache]: Analyzing trace with hash 319447963, now seen corresponding path program 1 times [2025-03-08 00:23:03,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:23:03,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169309463] [2025-03-08 00:23:03,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:23:03,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:23:03,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 00:23:03,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 00:23:03,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:23:03,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:03,525 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 00:23:03,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:23:03,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169309463] [2025-03-08 00:23:03,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169309463] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:23:03,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792847378] [2025-03-08 00:23:03,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:23:03,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:23:03,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:23:03,528 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 00:23:03,530 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 00:23:03,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 00:23:03,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 00:23:03,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:23:03,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:03,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:23:03,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:23:03,612 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 00:23:03,612 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:23:03,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792847378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:23:03,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:23:03,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 00:23:03,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174678276] [2025-03-08 00:23:03,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:23:03,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:23:03,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:23:03,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:23:03,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:23:03,613 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:23:03,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:23:03,625 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2025-03-08 00:23:03,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:23:03,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2025-03-08 00:23:03,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:23:03,626 INFO L225 Difference]: With dead ends: 30 [2025-03-08 00:23:03,626 INFO L226 Difference]: Without dead ends: 20 [2025-03-08 00:23:03,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:23:03,627 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:23:03,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:23:03,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-08 00:23:03,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-08 00:23:03,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:23:03,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2025-03-08 00:23:03,630 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 28 [2025-03-08 00:23:03,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:23:03,632 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2025-03-08 00:23:03,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:23:03,632 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2025-03-08 00:23:03,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 00:23:03,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:23:03,633 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:23:03,639 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 00:23:03,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-08 00:23:03,837 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:23:03,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:23:03,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1391912268, now seen corresponding path program 1 times [2025-03-08 00:23:03,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:23:03,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996072095] [2025-03-08 00:23:03,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:23:03,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:23:03,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 00:23:03,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 00:23:03,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:23:03,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:03,928 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 00:23:03,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:23:03,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996072095] [2025-03-08 00:23:03,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996072095] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:23:03,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710767362] [2025-03-08 00:23:03,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:23:03,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:23:03,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:23:03,931 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 00:23:03,933 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 00:23:03,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 00:23:03,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 00:23:03,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:23:03,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:03,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:23:03,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:23:04,020 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 00:23:04,020 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:23:04,050 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 00:23:04,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710767362] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:23:04,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:23:04,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 00:23:04,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783583318] [2025-03-08 00:23:04,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:23:04,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 00:23:04,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:23:04,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 00:23:04,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 00:23:04,053 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:23:04,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:23:04,064 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2025-03-08 00:23:04,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:23:04,065 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 29 [2025-03-08 00:23:04,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:23:04,065 INFO L225 Difference]: With dead ends: 39 [2025-03-08 00:23:04,065 INFO L226 Difference]: Without dead ends: 23 [2025-03-08 00:23:04,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 00:23:04,066 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:23:04,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:23:04,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-08 00:23:04,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-08 00:23:04,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:23:04,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2025-03-08 00:23:04,070 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 29 [2025-03-08 00:23:04,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:23:04,070 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2025-03-08 00:23:04,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:23:04,070 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2025-03-08 00:23:04,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-08 00:23:04,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:23:04,070 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:23:04,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 00:23:04,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:23:04,271 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:23:04,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:23:04,271 INFO L85 PathProgramCache]: Analyzing trace with hash 739990779, now seen corresponding path program 2 times [2025-03-08 00:23:04,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:23:04,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908608520] [2025-03-08 00:23:04,272 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:23:04,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:23:04,284 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-08 00:23:04,303 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 00:23:04,305 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:23:04,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:04,371 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 00:23:04,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:23:04,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908608520] [2025-03-08 00:23:04,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908608520] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:23:04,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431851553] [2025-03-08 00:23:04,371 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:23:04,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:23:04,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:23:04,373 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 00:23:04,375 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 00:23:04,415 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-08 00:23:04,436 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 00:23:04,436 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:23:04,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:04,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:23:04,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:23:04,478 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 00:23:04,481 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:23:04,531 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 00:23:04,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431851553] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:23:04,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:23:04,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 9 [2025-03-08 00:23:04,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133141657] [2025-03-08 00:23:04,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:23:04,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 00:23:04,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:23:04,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 00:23:04,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-08 00:23:04,532 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 00:23:04,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:23:04,555 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2025-03-08 00:23:04,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 00:23:04,555 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 32 [2025-03-08 00:23:04,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:23:04,556 INFO L225 Difference]: With dead ends: 41 [2025-03-08 00:23:04,556 INFO L226 Difference]: Without dead ends: 25 [2025-03-08 00:23:04,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-08 00:23:04,557 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:23:04,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:23:04,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-08 00:23:04,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-08 00:23:04,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:23:04,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2025-03-08 00:23:04,571 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 32 [2025-03-08 00:23:04,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:23:04,571 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-03-08 00:23:04,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 00:23:04,571 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2025-03-08 00:23:04,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-08 00:23:04,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:23:04,575 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:23:04,580 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 00:23:04,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:23:04,775 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:23:04,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:23:04,776 INFO L85 PathProgramCache]: Analyzing trace with hash -311683096, now seen corresponding path program 3 times [2025-03-08 00:23:04,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:23:04,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547373576] [2025-03-08 00:23:04,776 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:23:04,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:23:04,789 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 5 equivalence classes. [2025-03-08 00:23:04,800 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 36 statements. [2025-03-08 00:23:04,803 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 00:23:04,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:04,856 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 00:23:04,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:23:04,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547373576] [2025-03-08 00:23:04,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547373576] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:23:04,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645799813] [2025-03-08 00:23:04,857 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:23:04,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:23:04,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:23:04,859 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 00:23:04,861 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 00:23:04,902 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 5 equivalence classes. [2025-03-08 00:23:04,915 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 36 statements. [2025-03-08 00:23:04,915 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 00:23:04,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:04,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 00:23:04,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:23:04,927 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 00:23:04,927 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:23:04,962 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 00:23:04,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645799813] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:23:04,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:23:04,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-08 00:23:04,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665459151] [2025-03-08 00:23:04,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:23:04,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 00:23:04,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:23:04,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 00:23:04,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-08 00:23:04,963 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:23:04,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:23:04,976 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2025-03-08 00:23:04,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 00:23:04,978 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2025-03-08 00:23:04,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:23:04,978 INFO L225 Difference]: With dead ends: 44 [2025-03-08 00:23:04,978 INFO L226 Difference]: Without dead ends: 28 [2025-03-08 00:23:04,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-08 00:23:04,979 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:23:04,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:23:04,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-08 00:23:04,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-08 00:23:04,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:23:04,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2025-03-08 00:23:04,982 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 36 [2025-03-08 00:23:04,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:23:04,982 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-03-08 00:23:04,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:23:04,982 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2025-03-08 00:23:04,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 00:23:04,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:23:04,983 INFO L218 NwaCegarLoop]: trace histogram [15, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:23:04,989 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 00:23:05,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:23:05,183 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:23:05,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:23:05,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1282353396, now seen corresponding path program 4 times [2025-03-08 00:23:05,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:23:05,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666308088] [2025-03-08 00:23:05,184 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:23:05,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:23:05,197 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-03-08 00:23:05,216 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 00:23:05,216 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:23:05,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:05,282 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2025-03-08 00:23:05,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:23:05,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666308088] [2025-03-08 00:23:05,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666308088] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:23:05,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374590372] [2025-03-08 00:23:05,283 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:23:05,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:23:05,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:23:05,284 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 00:23:05,286 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 00:23:05,333 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-03-08 00:23:05,361 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 00:23:05,361 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:23:05,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:05,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:23:05,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:23:05,372 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 78 proven. 1 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-08 00:23:05,373 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:23:05,398 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2025-03-08 00:23:05,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374590372] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:23:05,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:23:05,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-08 00:23:05,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793305292] [2025-03-08 00:23:05,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:23:05,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 00:23:05,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:23:05,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 00:23:05,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:23:05,401 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:23:05,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:23:05,415 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2025-03-08 00:23:05,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:23:05,415 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2025-03-08 00:23:05,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:23:05,416 INFO L225 Difference]: With dead ends: 45 [2025-03-08 00:23:05,416 INFO L226 Difference]: Without dead ends: 31 [2025-03-08 00:23:05,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:23:05,417 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:23:05,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:23:05,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-08 00:23:05,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-08 00:23:05,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:23:05,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2025-03-08 00:23:05,420 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 45 [2025-03-08 00:23:05,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:23:05,420 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2025-03-08 00:23:05,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:23:05,421 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2025-03-08 00:23:05,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 00:23:05,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:23:05,421 INFO L218 NwaCegarLoop]: trace histogram [15, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:23:05,427 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 00:23:05,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:23:05,626 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:23:05,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:23:05,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1301069211, now seen corresponding path program 5 times [2025-03-08 00:23:05,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:23:05,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221716121] [2025-03-08 00:23:05,627 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:23:05,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:23:05,642 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 48 statements into 8 equivalence classes. [2025-03-08 00:23:05,917 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 00:23:05,917 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-03-08 00:23:05,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:12,036 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 13 proven. 164 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:23:12,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:23:12,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221716121] [2025-03-08 00:23:12,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221716121] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:23:12,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328776976] [2025-03-08 00:23:12,037 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:23:12,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:23:12,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:23:12,039 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 00:23:12,043 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 00:23:12,089 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 48 statements into 8 equivalence classes. [2025-03-08 00:23:12,310 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 00:23:12,311 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-03-08 00:23:12,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:23:12,314 WARN L254 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 152 conjuncts are in the unsatisfiable core [2025-03-08 00:23:12,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:23:12,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:23:12,840 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:23:12,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 184 treesize of output 117 [2025-03-08 00:23:13,749 INFO L349 Elim1Store]: treesize reduction 312, result has 7.1 percent of original size [2025-03-08 00:23:13,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 10 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 50 case distinctions, treesize of input 350 treesize of output 203 [2025-03-08 00:23:14,094 INFO L349 Elim1Store]: treesize reduction 254, result has 6.3 percent of original size [2025-03-08 00:23:14,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 6 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 40 case distinctions, treesize of input 318 treesize of output 196 [2025-03-08 00:23:14,423 INFO L349 Elim1Store]: treesize reduction 256, result has 7.6 percent of original size [2025-03-08 00:23:14,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 6 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 40 case distinctions, treesize of input 320 treesize of output 200 [2025-03-08 00:23:14,786 INFO L349 Elim1Store]: treesize reduction 264, result has 4.7 percent of original size [2025-03-08 00:23:14,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 6 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 40 case distinctions, treesize of input 320 treesize of output 192 [2025-03-08 00:23:15,134 INFO L349 Elim1Store]: treesize reduction 292, result has 6.7 percent of original size [2025-03-08 00:23:15,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 6 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 40 case distinctions, treesize of input 360 treesize of output 231 [2025-03-08 00:23:16,163 INFO L349 Elim1Store]: treesize reduction 205, result has 7.2 percent of original size [2025-03-08 00:23:16,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 10 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 519 treesize of output 230