./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-98.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-while_file-98.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 c9772336b4f5bbc4418fabef46aa66f1fadeb5e29c51f3493f820d65f03963e5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:05:36,989 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:05:37,029 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:05:37,036 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:05:37,036 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:05:37,061 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:05:37,063 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:05:37,063 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:05:37,063 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:05:37,063 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:05:37,063 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:05:37,063 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:05:37,063 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:05:37,064 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:05:37,064 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:05:37,064 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:05:37,064 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:05:37,064 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:05:37,064 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:05:37,064 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:05:37,064 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:05:37,064 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:05:37,064 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:05:37,064 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:05:37,064 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:05:37,064 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:05:37,064 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:05:37,064 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:05:37,064 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:05:37,064 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:05:37,064 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:05:37,064 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:05:37,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:05:37,065 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:05:37,065 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:05:37,065 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:05:37,065 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:05:37,065 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:05:37,065 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:05:37,065 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:05:37,065 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:05:37,065 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:05:37,065 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:05:37,065 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 -> c9772336b4f5bbc4418fabef46aa66f1fadeb5e29c51f3493f820d65f03963e5 [2025-03-03 23:05:37,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:05:37,308 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:05:37,311 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:05:37,312 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:05:37,312 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:05:37,314 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-98.i [2025-03-03 23:05:38,492 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/459112b41/cc5cf21ff7c04ac1adc1579073fe7e1b/FLAGdd65ad67b [2025-03-03 23:05:38,782 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:05:38,782 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-98.i [2025-03-03 23:05:38,793 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/459112b41/cc5cf21ff7c04ac1adc1579073fe7e1b/FLAGdd65ad67b [2025-03-03 23:05:38,811 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/459112b41/cc5cf21ff7c04ac1adc1579073fe7e1b [2025-03-03 23:05:38,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:05:38,815 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:05:38,816 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:05:38,817 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:05:38,820 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:05:38,821 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:05:38" (1/1) ... [2025-03-03 23:05:38,821 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@598b5085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:38, skipping insertion in model container [2025-03-03 23:05:38,822 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:05:38" (1/1) ... [2025-03-03 23:05:38,840 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:05:38,944 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-while_file-98.i[916,929] [2025-03-03 23:05:39,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:05:39,029 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:05:39,037 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-while_file-98.i[916,929] [2025-03-03 23:05:39,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:05:39,093 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:05:39,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:39 WrapperNode [2025-03-03 23:05:39,094 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:05:39,096 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:05:39,096 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:05:39,096 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:05:39,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:39" (1/1) ... [2025-03-03 23:05:39,111 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:39" (1/1) ... [2025-03-03 23:05:39,127 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 176 [2025-03-03 23:05:39,128 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:05:39,128 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:05:39,128 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:05:39,129 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:05:39,134 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:39" (1/1) ... [2025-03-03 23:05:39,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:39" (1/1) ... [2025-03-03 23:05:39,136 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:39" (1/1) ... [2025-03-03 23:05:39,145 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 23:05:39,146 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:39" (1/1) ... [2025-03-03 23:05:39,146 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:39" (1/1) ... [2025-03-03 23:05:39,150 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:39" (1/1) ... [2025-03-03 23:05:39,151 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:39" (1/1) ... [2025-03-03 23:05:39,152 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:39" (1/1) ... [2025-03-03 23:05:39,153 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:39" (1/1) ... [2025-03-03 23:05:39,155 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:05:39,155 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:05:39,155 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:05:39,155 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:05:39,156 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:39" (1/1) ... [2025-03-03 23:05:39,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:05:39,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:05:39,184 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 23:05:39,190 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 23:05:39,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:05:39,205 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:05:39,205 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:05:39,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:05:39,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:05:39,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:05:39,270 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:05:39,272 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:05:39,538 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 23:05:39,538 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:05:39,548 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:05:39,548 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:05:39,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:05:39 BoogieIcfgContainer [2025-03-03 23:05:39,550 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:05:39,552 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:05:39,552 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:05:39,555 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:05:39,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:05:38" (1/3) ... [2025-03-03 23:05:39,556 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cd19889 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:05:39, skipping insertion in model container [2025-03-03 23:05:39,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:05:39" (2/3) ... [2025-03-03 23:05:39,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cd19889 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:05:39, skipping insertion in model container [2025-03-03 23:05:39,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:05:39" (3/3) ... [2025-03-03 23:05:39,558 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-98.i [2025-03-03 23:05:39,568 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:05:39,569 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-98.i that has 2 procedures, 76 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:05:39,610 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:05:39,620 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;@4b753dbc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:05:39,621 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:05:39,624 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 50 states have (on average 1.42) internal successors, (71), 51 states have internal predecessors, (71), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 23:05:39,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 23:05:39,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:05:39,635 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:05:39,635 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:05:39,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:05:39,640 INFO L85 PathProgramCache]: Analyzing trace with hash -928673234, now seen corresponding path program 1 times [2025-03-03 23:05:39,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:05:39,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892783813] [2025-03-03 23:05:39,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:05:39,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:05:39,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 23:05:39,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 23:05:39,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:05:39,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:05:39,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-03 23:05:39,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:05:39,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892783813] [2025-03-03 23:05:39,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892783813] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:05:39,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886605928] [2025-03-03 23:05:39,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:05:39,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:05:39,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:05:39,938 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 23:05:39,940 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 23:05:40,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 23:05:40,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 23:05:40,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:05:40,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:05:40,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:05:40,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:05:40,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-03 23:05:40,116 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:05:40,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886605928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:05:40,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:05:40,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:05:40,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533337572] [2025-03-03 23:05:40,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:05:40,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:05:40,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:05:40,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:05:40,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:05:40,138 INFO L87 Difference]: Start difference. First operand has 76 states, 50 states have (on average 1.42) internal successors, (71), 51 states have internal predecessors, (71), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 23:05:40,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:05:40,155 INFO L93 Difference]: Finished difference Result 146 states and 252 transitions. [2025-03-03 23:05:40,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:05:40,157 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 152 [2025-03-03 23:05:40,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:05:40,161 INFO L225 Difference]: With dead ends: 146 [2025-03-03 23:05:40,162 INFO L226 Difference]: Without dead ends: 73 [2025-03-03 23:05:40,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 153 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 23:05:40,167 INFO L435 NwaCegarLoop]: 112 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, 112 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 23:05:40,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:05:40,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-03 23:05:40,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-03-03 23:05:40,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 48 states have (on average 1.375) internal successors, (66), 48 states have internal predecessors, (66), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 23:05:40,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 112 transitions. [2025-03-03 23:05:40,199 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 112 transitions. Word has length 152 [2025-03-03 23:05:40,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:05:40,199 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 112 transitions. [2025-03-03 23:05:40,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 23:05:40,199 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 112 transitions. [2025-03-03 23:05:40,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 23:05:40,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:05:40,203 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:05:40,211 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 23:05:40,408 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 23:05:40,408 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:05:40,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:05:40,410 INFO L85 PathProgramCache]: Analyzing trace with hash -2105851659, now seen corresponding path program 1 times [2025-03-03 23:05:40,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:05:40,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772747950] [2025-03-03 23:05:40,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:05:40,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:05:40,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 23:05:40,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 23:05:40,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:05:40,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:05:40,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-03 23:05:40,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:05:40,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772747950] [2025-03-03 23:05:40,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772747950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:05:40,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:05:40,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:05:40,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527120279] [2025-03-03 23:05:40,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:05:40,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:05:40,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:05:40,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:05:40,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:05:40,619 INFO L87 Difference]: Start difference. First operand 73 states and 112 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 23:05:40,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:05:40,672 INFO L93 Difference]: Finished difference Result 211 states and 326 transitions. [2025-03-03 23:05:40,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:05:40,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 152 [2025-03-03 23:05:40,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:05:40,674 INFO L225 Difference]: With dead ends: 211 [2025-03-03 23:05:40,676 INFO L226 Difference]: Without dead ends: 141 [2025-03-03 23:05:40,677 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-03 23:05:40,677 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 99 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:05:40,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 293 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:05:40,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-03 23:05:40,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2025-03-03 23:05:40,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 90 states have (on average 1.3444444444444446) internal successors, (121), 90 states have internal predecessors, (121), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-03 23:05:40,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 213 transitions. [2025-03-03 23:05:40,704 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 213 transitions. Word has length 152 [2025-03-03 23:05:40,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:05:40,706 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 213 transitions. [2025-03-03 23:05:40,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 23:05:40,707 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 213 transitions. [2025-03-03 23:05:40,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 23:05:40,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:05:40,708 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:05:40,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 23:05:40,709 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:05:40,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:05:40,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1218347978, now seen corresponding path program 1 times [2025-03-03 23:05:40,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:05:40,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141406993] [2025-03-03 23:05:40,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:05:40,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:05:40,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 23:05:40,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 23:05:40,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:05:40,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:05:41,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-03 23:05:41,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:05:41,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141406993] [2025-03-03 23:05:41,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141406993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:05:41,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:05:41,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 23:05:41,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363901004] [2025-03-03 23:05:41,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:05:41,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 23:05:41,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:05:41,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 23:05:41,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:05:41,446 INFO L87 Difference]: Start difference. First operand 139 states and 213 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 23:05:41,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:05:41,714 INFO L93 Difference]: Finished difference Result 373 states and 569 transitions. [2025-03-03 23:05:41,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 23:05:41,714 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 152 [2025-03-03 23:05:41,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:05:41,718 INFO L225 Difference]: With dead ends: 373 [2025-03-03 23:05:41,720 INFO L226 Difference]: Without dead ends: 237 [2025-03-03 23:05:41,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 23:05:41,722 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 166 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:05:41,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 393 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 23:05:41,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-03 23:05:41,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 211. [2025-03-03 23:05:41,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 137 states have (on average 1.3503649635036497) internal successors, (185), 137 states have internal predecessors, (185), 69 states have call successors, (69), 4 states have call predecessors, (69), 4 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-03 23:05:41,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 323 transitions. [2025-03-03 23:05:41,761 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 323 transitions. Word has length 152 [2025-03-03 23:05:41,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:05:41,762 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 323 transitions. [2025-03-03 23:05:41,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 23:05:41,762 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 323 transitions. [2025-03-03 23:05:41,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 23:05:41,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:05:41,763 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:05:41,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 23:05:41,764 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:05:41,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:05:41,765 INFO L85 PathProgramCache]: Analyzing trace with hash 134961719, now seen corresponding path program 1 times [2025-03-03 23:05:41,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:05:41,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351167832] [2025-03-03 23:05:41,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:05:41,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:05:41,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 23:05:41,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 23:05:41,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:05:41,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:05:42,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-03 23:05:42,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:05:42,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351167832] [2025-03-03 23:05:42,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351167832] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:05:42,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58239353] [2025-03-03 23:05:42,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:05:42,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:05:42,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:05:42,187 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 23:05:42,189 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 23:05:42,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 23:05:42,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 23:05:42,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:05:42,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:05:42,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 23:05:42,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:05:42,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 498 proven. 24 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-03-03 23:05:42,402 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:05:42,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-03 23:05:42,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58239353] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:05:42,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 23:05:42,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-03 23:05:42,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324477476] [2025-03-03 23:05:42,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 23:05:42,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 23:05:42,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:05:42,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 23:05:42,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:05:42,579 INFO L87 Difference]: Start difference. First operand 211 states and 323 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-03 23:05:42,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:05:42,781 INFO L93 Difference]: Finished difference Result 445 states and 666 transitions. [2025-03-03 23:05:42,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 23:05:42,783 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 152 [2025-03-03 23:05:42,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:05:42,785 INFO L225 Difference]: With dead ends: 445 [2025-03-03 23:05:42,786 INFO L226 Difference]: Without dead ends: 237 [2025-03-03 23:05:42,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 301 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-03 23:05:42,788 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 168 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:05:42,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 197 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 23:05:42,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-03 23:05:42,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 223. [2025-03-03 23:05:42,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 146 states have (on average 1.2945205479452055) internal successors, (189), 146 states have internal predecessors, (189), 69 states have call successors, (69), 7 states have call predecessors, (69), 7 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-03 23:05:42,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 327 transitions. [2025-03-03 23:05:42,825 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 327 transitions. Word has length 152 [2025-03-03 23:05:42,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:05:42,826 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 327 transitions. [2025-03-03 23:05:42,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-03 23:05:42,826 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 327 transitions. [2025-03-03 23:05:42,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-03 23:05:42,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:05:42,830 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 23:05:42,836 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-03 23:05:43,034 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,SelfDestructingSolverStorable3 [2025-03-03 23:05:43,034 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:05:43,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:05:43,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1978653990, now seen corresponding path program 1 times [2025-03-03 23:05:43,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:05:43,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80043537] [2025-03-03 23:05:43,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:05:43,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:05:43,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 23:05:43,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 23:05:43,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:05:43,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:05:55,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 141 proven. 87 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2025-03-03 23:05:55,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:05:55,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80043537] [2025-03-03 23:05:55,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80043537] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:05:55,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815656562] [2025-03-03 23:05:55,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:05:55,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:05:55,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:05:55,754 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 23:05:55,756 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 23:05:55,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 23:05:55,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 23:05:55,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:05:55,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:05:55,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-03-03 23:05:55,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:05:59,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 495 proven. 228 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2025-03-03 23:05:59,723 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:06:16,963 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 23:06:43,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815656562] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:06:43,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 23:06:43,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 30] total 49 [2025-03-03 23:06:43,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20557215] [2025-03-03 23:06:43,470 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 23:06:43,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-03 23:06:43,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:06:43,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-03 23:06:43,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=3134, Unknown=2, NotChecked=0, Total=3540 [2025-03-03 23:06:43,474 INFO L87 Difference]: Start difference. First operand 223 states and 327 transitions. Second operand has 49 states, 45 states have (on average 2.3777777777777778) internal successors, (107), 44 states have internal predecessors, (107), 15 states have call successors, (46), 8 states have call predecessors, (46), 12 states have return successors, (46), 14 states have call predecessors, (46), 15 states have call successors, (46) [2025-03-03 23:07:10,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.17s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0]