./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-51.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-51.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 ba41fad7f72744fe0e42c26f1418f056b21d09a04b2ad100829310a14fd9d787 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:47:22,939 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:47:22,998 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:47:23,001 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:47:23,002 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:47:23,017 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:47:23,017 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:47:23,017 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:47:23,018 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:47:23,018 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:47:23,018 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:47:23,018 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:47:23,018 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:47:23,018 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:47:23,018 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:47:23,019 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:47:23,019 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:47:23,019 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:47:23,019 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:47:23,019 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:47:23,019 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:47:23,019 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:47:23,019 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:47:23,019 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:47:23,019 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:47:23,019 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:47:23,020 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:47:23,020 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:47:23,020 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:47:23,020 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:47:23,020 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:47:23,020 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:47:23,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:47:23,020 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:47:23,020 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:47:23,020 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:47:23,020 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:47:23,020 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:47:23,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:47:23,020 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:47:23,020 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:47:23,020 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:47:23,020 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:47:23,020 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 -> ba41fad7f72744fe0e42c26f1418f056b21d09a04b2ad100829310a14fd9d787 [2025-03-03 22:47:23,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:47:23,228 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:47:23,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:47:23,230 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:47:23,231 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:47:23,232 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-51.i [2025-03-03 22:47:24,334 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38ee43073/ee10ab09c4254556a6dd0b9ff6b5382a/FLAG482b4e6c2 [2025-03-03 22:47:24,603 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:47:24,603 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-51.i [2025-03-03 22:47:24,614 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38ee43073/ee10ab09c4254556a6dd0b9ff6b5382a/FLAG482b4e6c2 [2025-03-03 22:47:24,629 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38ee43073/ee10ab09c4254556a6dd0b9ff6b5382a [2025-03-03 22:47:24,632 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:47:24,633 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:47:24,635 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:47:24,636 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:47:24,638 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:47:24,639 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:47:24" (1/1) ... [2025-03-03 22:47:24,640 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13c3ad89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:24, skipping insertion in model container [2025-03-03 22:47:24,640 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:47:24" (1/1) ... [2025-03-03 22:47:24,661 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:47:24,767 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/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-51.i[916,929] [2025-03-03 22:47:24,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:47:24,839 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:47:24,847 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/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-51.i[916,929] [2025-03-03 22:47:24,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:47:24,888 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:47:24,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:24 WrapperNode [2025-03-03 22:47:24,889 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:47:24,890 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:47:24,890 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:47:24,890 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:47:24,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:24" (1/1) ... [2025-03-03 22:47:24,904 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:24" (1/1) ... [2025-03-03 22:47:24,935 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 211 [2025-03-03 22:47:24,936 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:47:24,936 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:47:24,936 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:47:24,936 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:47:24,944 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:24" (1/1) ... [2025-03-03 22:47:24,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:24" (1/1) ... [2025-03-03 22:47:24,948 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:24" (1/1) ... [2025-03-03 22:47:24,967 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 22:47:24,967 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:24" (1/1) ... [2025-03-03 22:47:24,967 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:24" (1/1) ... [2025-03-03 22:47:24,974 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:24" (1/1) ... [2025-03-03 22:47:24,975 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:24" (1/1) ... [2025-03-03 22:47:24,977 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:24" (1/1) ... [2025-03-03 22:47:24,978 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:24" (1/1) ... [2025-03-03 22:47:24,980 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:47:24,981 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:47:24,981 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:47:24,981 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:47:24,986 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:24" (1/1) ... [2025-03-03 22:47:24,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:47:24,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:47:25,008 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-03 22:47:25,012 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-03 22:47:25,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:47:25,025 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:47:25,025 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:47:25,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:47:25,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:47:25,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:47:25,082 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:47:25,084 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:47:25,460 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-03-03 22:47:25,461 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:47:25,472 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:47:25,472 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:47:25,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:47:25 BoogieIcfgContainer [2025-03-03 22:47:25,472 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:47:25,475 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:47:25,476 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:47:25,479 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:47:25,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:47:24" (1/3) ... [2025-03-03 22:47:25,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23d9acd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:47:25, skipping insertion in model container [2025-03-03 22:47:25,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:24" (2/3) ... [2025-03-03 22:47:25,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23d9acd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:47:25, skipping insertion in model container [2025-03-03 22:47:25,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:47:25" (3/3) ... [2025-03-03 22:47:25,480 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-51.i [2025-03-03 22:47:25,491 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:47:25,492 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-1loop_file-51.i that has 2 procedures, 93 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:47:25,533 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:47:25,543 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;@1b1e9634, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:47:25,544 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:47:25,547 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 59 states have internal predecessors, (82), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 22:47:25,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 22:47:25,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:47:25,557 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:47:25,558 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:47:25,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:47:25,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1570203980, now seen corresponding path program 1 times [2025-03-03 22:47:25,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:47:25,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239941912] [2025-03-03 22:47:25,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:47:25,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:47:25,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 22:47:25,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 22:47:25,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:47:25,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:47:25,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-03-03 22:47:25,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:47:25,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239941912] [2025-03-03 22:47:25,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239941912] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:47:25,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723894335] [2025-03-03 22:47:25,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:47:25,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:47:25,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:47:25,845 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-03 22:47:25,847 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-03 22:47:25,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 22:47:26,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 22:47:26,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:47:26,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:47:26,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:47:26,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:47:26,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-03-03 22:47:26,055 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:47:26,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723894335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:47:26,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:47:26,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:47:26,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906842838] [2025-03-03 22:47:26,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:47:26,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:47:26,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:47:26,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:47:26,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:47:26,077 INFO L87 Difference]: Start difference. First operand has 93 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 59 states have internal predecessors, (82), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-03 22:47:26,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:47:26,101 INFO L93 Difference]: Finished difference Result 183 states and 321 transitions. [2025-03-03 22:47:26,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:47:26,103 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 203 [2025-03-03 22:47:26,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:47:26,107 INFO L225 Difference]: With dead ends: 183 [2025-03-03 22:47:26,108 INFO L226 Difference]: Without dead ends: 90 [2025-03-03 22:47:26,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:47:26,111 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:47:26,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:47:26,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-03 22:47:26,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-03 22:47:26,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 56 states have (on average 1.375) internal successors, (77), 56 states have internal predecessors, (77), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 22:47:26,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 141 transitions. [2025-03-03 22:47:26,143 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 141 transitions. Word has length 203 [2025-03-03 22:47:26,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:47:26,143 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 141 transitions. [2025-03-03 22:47:26,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-03 22:47:26,143 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 141 transitions. [2025-03-03 22:47:26,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 22:47:26,145 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:47:26,145 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:47:26,152 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-03 22:47:26,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 22:47:26,346 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:47:26,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:47:26,348 INFO L85 PathProgramCache]: Analyzing trace with hash -269411350, now seen corresponding path program 1 times [2025-03-03 22:47:26,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:47:26,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764758561] [2025-03-03 22:47:26,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:47:26,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:47:26,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 22:47:26,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 22:47:26,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:47:26,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:47:27,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 42 proven. 51 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-03 22:47:27,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:47:27,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764758561] [2025-03-03 22:47:27,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764758561] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:47:27,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703278126] [2025-03-03 22:47:27,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:47:27,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:47:27,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:47:27,120 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-03 22:47:27,121 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-03 22:47:27,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 22:47:27,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 22:47:27,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:47:27,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:47:27,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 22:47:27,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:47:27,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1011 proven. 51 refuted. 0 times theorem prover too weak. 922 trivial. 0 not checked. [2025-03-03 22:47:27,500 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:47:27,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 42 proven. 51 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-03 22:47:27,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703278126] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 22:47:27,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 22:47:27,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-03 22:47:27,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469000423] [2025-03-03 22:47:27,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 22:47:27,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 22:47:27,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:47:27,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 22:47:27,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:47:27,802 INFO L87 Difference]: Start difference. First operand 90 states and 141 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-03 22:47:28,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:47:28,070 INFO L93 Difference]: Finished difference Result 185 states and 286 transitions. [2025-03-03 22:47:28,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 22:47:28,071 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 203 [2025-03-03 22:47:28,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:47:28,076 INFO L225 Difference]: With dead ends: 185 [2025-03-03 22:47:28,076 INFO L226 Difference]: Without dead ends: 98 [2025-03-03 22:47:28,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 403 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-03 22:47:28,077 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 128 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:47:28,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 242 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:47:28,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-03 22:47:28,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2025-03-03 22:47:28,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 59 states have internal predecessors, (79), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 22:47:28,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 143 transitions. [2025-03-03 22:47:28,100 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 143 transitions. Word has length 203 [2025-03-03 22:47:28,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:47:28,103 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 143 transitions. [2025-03-03 22:47:28,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-03 22:47:28,103 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 143 transitions. [2025-03-03 22:47:28,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 22:47:28,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:47:28,106 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:47:28,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 22:47:28,311 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,SelfDestructingSolverStorable1 [2025-03-03 22:47:28,311 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:47:28,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:47:28,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1238140459, now seen corresponding path program 1 times [2025-03-03 22:47:28,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:47:28,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972122415] [2025-03-03 22:47:28,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:47:28,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:47:28,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 22:47:28,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 22:47:28,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:47:28,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:47:28,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 22:47:28,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:47:28,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972122415] [2025-03-03 22:47:28,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972122415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:47:28,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:47:28,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 22:47:28,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176163681] [2025-03-03 22:47:28,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:47:28,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 22:47:28,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:47:28,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 22:47:28,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 22:47:28,898 INFO L87 Difference]: Start difference. First operand 94 states and 143 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 22:47:29,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:47:29,091 INFO L93 Difference]: Finished difference Result 277 states and 424 transitions. [2025-03-03 22:47:29,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:47:29,092 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2025-03-03 22:47:29,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:47:29,095 INFO L225 Difference]: With dead ends: 277 [2025-03-03 22:47:29,096 INFO L226 Difference]: Without dead ends: 186 [2025-03-03 22:47:29,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 22:47:29,097 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 128 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:47:29,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 616 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:47:29,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-03 22:47:29,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 183. [2025-03-03 22:47:29,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 114 states have (on average 1.3157894736842106) internal successors, (150), 114 states have internal predecessors, (150), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-03 22:47:29,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 278 transitions. [2025-03-03 22:47:29,134 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 278 transitions. Word has length 203 [2025-03-03 22:47:29,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:47:29,135 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 278 transitions. [2025-03-03 22:47:29,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 22:47:29,136 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 278 transitions. [2025-03-03 22:47:29,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-03 22:47:29,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:47:29,138 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:47:29,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 22:47:29,139 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:47:29,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:47:29,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1164331781, now seen corresponding path program 1 times [2025-03-03 22:47:29,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:47:29,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482671736] [2025-03-03 22:47:29,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:47:29,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:47:29,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-03 22:47:29,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-03 22:47:29,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:47:29,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:47:29,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 22:47:29,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:47:29,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482671736] [2025-03-03 22:47:29,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482671736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:47:29,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:47:29,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 22:47:29,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654051213] [2025-03-03 22:47:29,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:47:29,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 22:47:29,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:47:29,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 22:47:29,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 22:47:29,620 INFO L87 Difference]: Start difference. First operand 183 states and 278 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 22:47:29,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:47:29,923 INFO L93 Difference]: Finished difference Result 353 states and 527 transitions. [2025-03-03 22:47:29,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 22:47:29,924 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 204 [2025-03-03 22:47:29,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:47:29,927 INFO L225 Difference]: With dead ends: 353 [2025-03-03 22:47:29,928 INFO L226 Difference]: Without dead ends: 262 [2025-03-03 22:47:29,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-03 22:47:29,929 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 182 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:47:29,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 314 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 22:47:29,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-03-03 22:47:29,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 194. [2025-03-03 22:47:29,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 123 states have (on average 1.2764227642276422) internal successors, (157), 123 states have internal predecessors, (157), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-03 22:47:29,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 285 transitions. [2025-03-03 22:47:29,964 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 285 transitions. Word has length 204 [2025-03-03 22:47:29,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:47:29,965 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 285 transitions. [2025-03-03 22:47:29,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 22:47:29,965 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 285 transitions. [2025-03-03 22:47:29,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-03 22:47:29,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:47:29,967 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:47:29,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 22:47:29,967 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:47:29,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:47:29,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1638274172, now seen corresponding path program 1 times [2025-03-03 22:47:29,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:47:29,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908696910] [2025-03-03 22:47:29,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:47:29,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:47:29,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-03 22:47:30,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-03 22:47:30,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:47:30,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:47:30,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 27 proven. 66 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-03 22:47:30,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:47:30,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908696910] [2025-03-03 22:47:30,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908696910] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:47:30,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473962393] [2025-03-03 22:47:30,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:47:30,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:47:30,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:47:30,616 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-03 22:47:30,618 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-03 22:47:30,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-03 22:47:30,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-03 22:47:30,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:47:30,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:47:30,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-03 22:47:30,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:47:31,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 771 proven. 45 refuted. 0 times theorem prover too weak. 1168 trivial. 0 not checked. [2025-03-03 22:47:31,833 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:48:41,757 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (mod c_~var_1_30~0 65536)) (.cse5 (mod c_~var_1_29~0 65536)) (.cse4 (* c_~last_1_var_1_33~0 65535))) (and (or (let ((.cse1 (mod (+ c_~var_1_29~0 .cse4) 65536))) (and (forall ((~var_1_6~0 Int)) (let ((.cse0 (* c_~var_1_1~0 ~var_1_6~0))) (or (not (= (mod .cse0 64) 0)) (< 0 (+ .cse1 (div .cse0 64)))))) (forall ((~var_1_6~0 Int)) (let ((.cse2 (* c_~var_1_1~0 ~var_1_6~0))) (or (< 0 (+ .cse1 (div .cse2 64) 1)) (= (mod .cse2 64) 0)))) (forall ((~var_1_6~0 Int)) (let ((.cse3 (* c_~var_1_1~0 ~var_1_6~0))) (or (< 0 (+ .cse1 (div .cse3 64))) (< .cse3 0)))))) (< .cse5 (+ .cse6 1))) (or (< .cse6 .cse5) (let ((.cse7 (mod (+ c_~var_1_30~0 .cse4) 65536))) (and (forall ((~var_1_6~0 Int)) (let ((.cse8 (* c_~var_1_1~0 ~var_1_6~0))) (or (< 0 (+ .cse7 (div .cse8 64))) (< .cse8 0)))) (forall ((~var_1_6~0 Int)) (let ((.cse9 (* c_~var_1_1~0 ~var_1_6~0))) (or (< 0 (+ .cse7 (div .cse9 64) 1)) (= (mod .cse9 64) 0)))) (forall ((~var_1_6~0 Int)) (let ((.cse10 (* c_~var_1_1~0 ~var_1_6~0))) (or (< 0 (+ .cse7 (div .cse10 64))) (not (= (mod .cse10 64) 0)))))))))) is different from false [2025-03-03 22:48:42,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473962393] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:48:42,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 22:48:42,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 14] total 20 [2025-03-03 22:48:42,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719882845] [2025-03-03 22:48:42,425 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 22:48:42,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 22:48:42,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:48:42,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 22:48:42,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=376, Unknown=15, NotChecked=40, Total=506 [2025-03-03 22:48:42,427 INFO L87 Difference]: Start difference. First operand 194 states and 285 transitions. Second operand has 20 states, 20 states have (on average 5.15) internal successors, (103), 19 states have internal predecessors, (103), 6 states have call successors, (64), 5 states have call predecessors, (64), 7 states have return successors, (64), 6 states have call predecessors, (64), 6 states have call successors, (64) [2025-03-03 22:48:55,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:48:55,413 INFO L93 Difference]: Finished difference Result 576 states and 824 transitions. [2025-03-03 22:48:55,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 22:48:55,415 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.15) internal successors, (103), 19 states have internal predecessors, (103), 6 states have call successors, (64), 5 states have call predecessors, (64), 7 states have return successors, (64), 6 states have call predecessors, (64), 6 states have call successors, (64) Word has length 204 [2025-03-03 22:48:55,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:48:55,417 INFO L225 Difference]: With dead ends: 576 [2025-03-03 22:48:55,417 INFO L226 Difference]: Without dead ends: 385 [2025-03-03 22:48:55,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 75.9s TimeCoverageRelationStatistics Valid=385, Invalid=1409, Unknown=16, NotChecked=82, Total=1892 [2025-03-03 22:48:55,421 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 369 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 1185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:48:55,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 1060 Invalid, 1185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-03-03 22:48:55,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-03-03 22:48:55,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 287. [2025-03-03 22:48:55,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 177 states have (on average 1.2259887005649717) internal successors, (217), 177 states have internal predecessors, (217), 96 states have call successors, (96), 13 states have call predecessors, (96), 13 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-03 22:48:55,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 409 transitions. [2025-03-03 22:48:55,453 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 409 transitions. Word has length 204 [2025-03-03 22:48:55,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:48:55,453 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 409 transitions. [2025-03-03 22:48:55,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.15) internal successors, (103), 19 states have internal predecessors, (103), 6 states have call successors, (64), 5 states have call predecessors, (64), 7 states have return successors, (64), 6 states have call predecessors, (64), 6 states have call successors, (64) [2025-03-03 22:48:55,454 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 409 transitions. [2025-03-03 22:48:55,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-03 22:48:55,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:48:55,455 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:48:55,463 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-03 22:48:55,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:48:55,656 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:48:55,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:48:55,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1732894806, now seen corresponding path program 1 times [2025-03-03 22:48:55,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:48:55,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203850590] [2025-03-03 22:48:55,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:48:55,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:48:55,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-03 22:48:55,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-03 22:48:55,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:48:55,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:48:55,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [560873723] [2025-03-03 22:48:55,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:48:55,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:48:55,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:48:55,803 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-03 22:48:55,805 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-03 22:48:55,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-03 22:48:55,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-03 22:48:55,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:48:55,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:48:55,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 22:48:55,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:48:58,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-03 22:48:58,910 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:48:58,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:48:58,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203850590] [2025-03-03 22:48:58,910 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 22:48:58,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560873723] [2025-03-03 22:48:58,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560873723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:48:58,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:48:58,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 22:48:58,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313875120] [2025-03-03 22:48:58,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:48:58,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 22:48:58,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:48:58,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 22:48:58,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 22:48:58,912 INFO L87 Difference]: Start difference. First operand 287 states and 409 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 22:49:03,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:49:03,366 INFO L93 Difference]: Finished difference Result 1037 states and 1511 transitions. [2025-03-03 22:49:03,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 22:49:03,368 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 205 [2025-03-03 22:49:03,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:49:03,373 INFO L225 Difference]: With dead ends: 1037 [2025-03-03 22:49:03,374 INFO L226 Difference]: Without dead ends: 846 [2025-03-03 22:49:03,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-03 22:49:03,375 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 253 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-03 22:49:03,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 845 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-03 22:49:03,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2025-03-03 22:49:03,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 517. [2025-03-03 22:49:03,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 337 states have (on average 1.261127596439169) internal successors, (425), 337 states have internal predecessors, (425), 160 states have call successors, (160), 19 states have call predecessors, (160), 19 states have return successors, (160), 160 states have call predecessors, (160), 160 states have call successors, (160) [2025-03-03 22:49:03,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 745 transitions. [2025-03-03 22:49:03,448 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 745 transitions. Word has length 205 [2025-03-03 22:49:03,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:49:03,448 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 745 transitions. [2025-03-03 22:49:03,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-03 22:49:03,449 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 745 transitions. [2025-03-03 22:49:03,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-03 22:49:03,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:49:03,450 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:49:03,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 22:49:03,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:49:03,654 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:49:03,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:49:03,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1861977525, now seen corresponding path program 1 times [2025-03-03 22:49:03,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:49:03,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323687795] [2025-03-03 22:49:03,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:49:03,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:49:03,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-03 22:49:03,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-03 22:49:03,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:49:03,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:49:03,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1210878978] [2025-03-03 22:49:03,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:49:03,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:49:03,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:49:03,756 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-03 22:49:03,757 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-03 22:49:03,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-03 22:49:03,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-03 22:49:03,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:49:03,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:49:03,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-03 22:49:03,891 INFO L279 TraceCheckSpWp]: Computing forward predicates...