./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-43.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-43.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 1b276dadabf1c2167b11901ba656aa9e16f5041ffd48790c84fa96230d4114a3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:12:03,997 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:12:04,047 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:12:04,052 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:12:04,052 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:12:04,070 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:12:04,071 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:12:04,071 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:12:04,071 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:12:04,072 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:12:04,072 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:12:04,072 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:12:04,073 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:12:04,073 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:12:04,073 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:12:04,073 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:12:04,073 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:12:04,073 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:12:04,073 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:12:04,073 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:12:04,073 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:12:04,073 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:12:04,074 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:12:04,074 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:12:04,074 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:12:04,074 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:12:04,074 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:12:04,074 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:12:04,074 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:12:04,074 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:12:04,074 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:12:04,074 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:12:04,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:12:04,075 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:12:04,075 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:12:04,075 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:12:04,075 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:12:04,075 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:12:04,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:12:04,075 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:12:04,075 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:12:04,075 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:12:04,076 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:12:04,076 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 -> 1b276dadabf1c2167b11901ba656aa9e16f5041ffd48790c84fa96230d4114a3 [2025-03-17 05:12:04,282 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:12:04,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:12:04,291 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:12:04,292 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:12:04,292 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:12:04,293 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-43.i [2025-03-17 05:12:05,411 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/285056462/3513f81976c44e9383ff45e2edd942f4/FLAG0baab95ec [2025-03-17 05:12:05,672 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:12:05,673 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-43.i [2025-03-17 05:12:05,683 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/285056462/3513f81976c44e9383ff45e2edd942f4/FLAG0baab95ec [2025-03-17 05:12:05,972 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/285056462/3513f81976c44e9383ff45e2edd942f4 [2025-03-17 05:12:05,974 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:12:05,975 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:12:05,976 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:12:05,976 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:12:05,979 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:12:05,980 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:12:05" (1/1) ... [2025-03-17 05:12:05,980 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47167c96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:12:05, skipping insertion in model container [2025-03-17 05:12:05,980 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:12:05" (1/1) ... [2025-03-17 05:12:05,991 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:12:06,089 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_variablewrapping_normal_file-43.i[913,926] [2025-03-17 05:12:06,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:12:06,147 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:12:06,157 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_variablewrapping_normal_file-43.i[913,926] [2025-03-17 05:12:06,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:12:06,201 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:12:06,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:12:06 WrapperNode [2025-03-17 05:12:06,202 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:12:06,202 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:12:06,203 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:12:06,203 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:12:06,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:12:06" (1/1) ... [2025-03-17 05:12:06,217 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:12:06" (1/1) ... [2025-03-17 05:12:06,246 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 173 [2025-03-17 05:12:06,250 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:12:06,250 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:12:06,250 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:12:06,250 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:12:06,260 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:12:06" (1/1) ... [2025-03-17 05:12:06,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:12:06" (1/1) ... [2025-03-17 05:12:06,263 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:12:06" (1/1) ... [2025-03-17 05:12:06,287 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-17 05:12:06,288 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:12:06" (1/1) ... [2025-03-17 05:12:06,288 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:12:06" (1/1) ... [2025-03-17 05:12:06,294 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:12:06" (1/1) ... [2025-03-17 05:12:06,295 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:12:06" (1/1) ... [2025-03-17 05:12:06,300 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:12:06" (1/1) ... [2025-03-17 05:12:06,301 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:12:06" (1/1) ... [2025-03-17 05:12:06,303 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:12:06,304 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:12:06,304 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:12:06,304 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:12:06,304 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:12:06" (1/1) ... [2025-03-17 05:12:06,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:12:06,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:12:06,333 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-17 05:12:06,336 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-17 05:12:06,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:12:06,355 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:12:06,355 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:12:06,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:12:06,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:12:06,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:12:06,408 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:12:06,409 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:12:06,624 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L108: havoc property_#t~bitwise18#1;havoc property_#t~short19#1;havoc property_#t~bitwise20#1;havoc property_#t~short21#1; [2025-03-17 05:12:06,654 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-17 05:12:06,654 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:12:06,671 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:12:06,671 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:12:06,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:12:06 BoogieIcfgContainer [2025-03-17 05:12:06,672 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:12:06,673 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:12:06,673 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:12:06,677 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:12:06,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:12:05" (1/3) ... [2025-03-17 05:12:06,678 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aa72c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:12:06, skipping insertion in model container [2025-03-17 05:12:06,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:12:06" (2/3) ... [2025-03-17 05:12:06,678 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aa72c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:12:06, skipping insertion in model container [2025-03-17 05:12:06,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:12:06" (3/3) ... [2025-03-17 05:12:06,679 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-43.i [2025-03-17 05:12:06,689 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:12:06,692 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-43.i that has 2 procedures, 71 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:12:06,738 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:12:06,747 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;@7be4d2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:12:06,747 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:12:06,750 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 49 states have internal predecessors, (68), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:12:06,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-17 05:12:06,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:12:06,761 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:12:06,761 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:12:06,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:12:06,765 INFO L85 PathProgramCache]: Analyzing trace with hash 945022480, now seen corresponding path program 1 times [2025-03-17 05:12:06,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:12:06,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984807433] [2025-03-17 05:12:06,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:12:06,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:12:06,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 05:12:06,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 05:12:06,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:12:06,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:12:06,987 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-17 05:12:06,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:12:06,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984807433] [2025-03-17 05:12:06,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984807433] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:12:06,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880076352] [2025-03-17 05:12:06,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:12:06,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:12:06,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:12:06,992 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-17 05:12:06,994 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-17 05:12:07,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 05:12:07,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 05:12:07,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:12:07,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:12:07,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:12:07,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:12:07,166 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-17 05:12:07,170 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:12:07,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880076352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:12:07,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:12:07,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:12:07,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058267761] [2025-03-17 05:12:07,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:12:07,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:12:07,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:12:07,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:12:07,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:12:07,191 INFO L87 Difference]: Start difference. First operand has 71 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 49 states have internal predecessors, (68), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:12:07,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:12:07,215 INFO L93 Difference]: Finished difference Result 139 states and 234 transitions. [2025-03-17 05:12:07,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:12:07,217 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 129 [2025-03-17 05:12:07,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:12:07,221 INFO L225 Difference]: With dead ends: 139 [2025-03-17 05:12:07,222 INFO L226 Difference]: Without dead ends: 69 [2025-03-17 05:12:07,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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-17 05:12:07,231 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:12:07,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:12:07,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-17 05:12:07,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-17 05:12:07,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 47 states have internal predecessors, (64), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:12:07,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 104 transitions. [2025-03-17 05:12:07,261 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 104 transitions. Word has length 129 [2025-03-17 05:12:07,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:12:07,261 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 104 transitions. [2025-03-17 05:12:07,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:12:07,261 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 104 transitions. [2025-03-17 05:12:07,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-17 05:12:07,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:12:07,263 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:12:07,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 05:12:07,463 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-17 05:12:07,464 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:12:07,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:12:07,466 INFO L85 PathProgramCache]: Analyzing trace with hash 376059028, now seen corresponding path program 1 times [2025-03-17 05:12:07,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:12:07,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025959623] [2025-03-17 05:12:07,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:12:07,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:12:07,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 05:12:07,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 05:12:07,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:12:07,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:12:07,869 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 05:12:07,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:12:07,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025959623] [2025-03-17 05:12:07,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025959623] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:12:07,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956002781] [2025-03-17 05:12:07,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:12:07,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:12:07,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:12:07,871 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-17 05:12:07,873 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-17 05:12:07,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 05:12:07,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 05:12:07,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:12:07,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:12:07,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 05:12:07,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:12:08,131 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 267 proven. 45 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2025-03-17 05:12:08,131 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:12:08,265 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 05:12:08,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956002781] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:12:08,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:12:08,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-17 05:12:08,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670563661] [2025-03-17 05:12:08,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:12:08,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:12:08,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:12:08,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:12:08,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:12:08,267 INFO L87 Difference]: Start difference. First operand 69 states and 104 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2025-03-17 05:12:08,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:12:08,424 INFO L93 Difference]: Finished difference Result 143 states and 212 transitions. [2025-03-17 05:12:08,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:12:08,424 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) Word has length 129 [2025-03-17 05:12:08,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:12:08,425 INFO L225 Difference]: With dead ends: 143 [2025-03-17 05:12:08,425 INFO L226 Difference]: Without dead ends: 75 [2025-03-17 05:12:08,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:12:08,426 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 99 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:12:08,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 156 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:12:08,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-17 05:12:08,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2025-03-17 05:12:08,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:12:08,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 105 transitions. [2025-03-17 05:12:08,438 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 105 transitions. Word has length 129 [2025-03-17 05:12:08,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:12:08,439 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 105 transitions. [2025-03-17 05:12:08,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2025-03-17 05:12:08,439 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 105 transitions. [2025-03-17 05:12:08,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 05:12:08,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:12:08,442 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:12:08,450 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-17 05:12:08,642 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-17 05:12:08,642 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:12:08,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:12:08,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1007148437, now seen corresponding path program 1 times [2025-03-17 05:12:08,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:12:08,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333806463] [2025-03-17 05:12:08,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:12:08,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:12:08,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:12:08,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:12:08,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:12:08,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:12:08,898 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 05:12:08,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:12:08,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333806463] [2025-03-17 05:12:08,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333806463] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:12:08,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649447236] [2025-03-17 05:12:08,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:12:08,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:12:08,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:12:08,901 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-17 05:12:08,903 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-17 05:12:08,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:12:08,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:12:08,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:12:08,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:12:08,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:12:08,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:12:09,108 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 267 proven. 45 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2025-03-17 05:12:09,108 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:12:09,293 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 05:12:09,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649447236] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:12:09,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:12:09,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2025-03-17 05:12:09,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565017852] [2025-03-17 05:12:09,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:12:09,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 05:12:09,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:12:09,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 05:12:09,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:12:09,296 INFO L87 Difference]: Start difference. First operand 73 states and 105 transitions. Second operand has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 4 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 4 states have call predecessors, (51), 4 states have call successors, (51) [2025-03-17 05:12:09,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:12:09,570 INFO L93 Difference]: Finished difference Result 149 states and 214 transitions. [2025-03-17 05:12:09,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:12:09,570 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 4 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 4 states have call predecessors, (51), 4 states have call successors, (51) Word has length 130 [2025-03-17 05:12:09,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:12:09,571 INFO L225 Difference]: With dead ends: 149 [2025-03-17 05:12:09,572 INFO L226 Difference]: Without dead ends: 77 [2025-03-17 05:12:09,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:12:09,573 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 145 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:12:09,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 435 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:12:09,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-17 05:12:09,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2025-03-17 05:12:09,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 52 states have internal predecessors, (67), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:12:09,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 107 transitions. [2025-03-17 05:12:09,579 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 107 transitions. Word has length 130 [2025-03-17 05:12:09,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:12:09,579 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 107 transitions. [2025-03-17 05:12:09,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 4 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 4 states have call predecessors, (51), 4 states have call successors, (51) [2025-03-17 05:12:09,580 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 107 transitions. [2025-03-17 05:12:09,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 05:12:09,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:12:09,581 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:12:09,587 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-17 05:12:09,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:12:09,785 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:12:09,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:12:09,786 INFO L85 PathProgramCache]: Analyzing trace with hash -789802922, now seen corresponding path program 1 times [2025-03-17 05:12:09,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:12:09,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102722684] [2025-03-17 05:12:09,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:12:09,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:12:09,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:12:09,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:12:09,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:12:09,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:12:10,009 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 05:12:10,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:12:10,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102722684] [2025-03-17 05:12:10,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102722684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:12:10,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:12:10,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:12:10,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672067917] [2025-03-17 05:12:10,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:12:10,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:12:10,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:12:10,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:12:10,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:12:10,010 INFO L87 Difference]: Start difference. First operand 75 states and 107 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:12:10,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:12:10,202 INFO L93 Difference]: Finished difference Result 157 states and 220 transitions. [2025-03-17 05:12:10,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:12:10,204 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 130 [2025-03-17 05:12:10,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:12:10,205 INFO L225 Difference]: With dead ends: 157 [2025-03-17 05:12:10,205 INFO L226 Difference]: Without dead ends: 83 [2025-03-17 05:12:10,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:12:10,206 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 118 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:12:10,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 169 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:12:10,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-17 05:12:10,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2025-03-17 05:12:10,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 55 states have internal predecessors, (68), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:12:10,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 108 transitions. [2025-03-17 05:12:10,223 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 108 transitions. Word has length 130 [2025-03-17 05:12:10,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:12:10,223 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 108 transitions. [2025-03-17 05:12:10,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:12:10,224 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 108 transitions. [2025-03-17 05:12:10,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 05:12:10,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:12:10,226 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:12:10,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:12:10,226 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:12:10,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:12:10,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1697709911, now seen corresponding path program 1 times [2025-03-17 05:12:10,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:12:10,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348110543] [2025-03-17 05:12:10,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:12:10,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:12:10,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:12:10,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:12:10,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:12:10,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 05:12:10,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [180950138] [2025-03-17 05:12:10,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:12:10,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:12:10,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:12:10,284 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-17 05:12:10,286 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-17 05:12:10,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:12:10,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:12:10,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:12:10,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:12:10,358 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:12:10,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:12:10,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:12:10,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:12:10,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:12:10,447 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:12:10,447 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:12:10,448 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:12:10,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-17 05:12:10,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:12:10,653 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-17 05:12:10,725 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:12:10,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:12:10 BoogieIcfgContainer [2025-03-17 05:12:10,727 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:12:10,728 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:12:10,728 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:12:10,728 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:12:10,729 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:12:06" (3/4) ... [2025-03-17 05:12:10,731 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:12:10,731 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:12:10,733 INFO L158 Benchmark]: Toolchain (without parser) took 4756.94ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 106.5MB in the beginning and 182.1MB in the end (delta: -75.6MB). Peak memory consumption was 78.7MB. Max. memory is 16.1GB. [2025-03-17 05:12:10,733 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:12:10,734 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.01ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 93.2MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:12:10,734 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.26ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 90.3MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:12:10,734 INFO L158 Benchmark]: Boogie Preprocessor took 52.74ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 87.2MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:12:10,735 INFO L158 Benchmark]: IcfgBuilder took 368.06ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 66.7MB in the end (delta: 20.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 05:12:10,735 INFO L158 Benchmark]: TraceAbstraction took 4053.64ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 65.9MB in the beginning and 182.1MB in the end (delta: -116.2MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. [2025-03-17 05:12:10,735 INFO L158 Benchmark]: Witness Printer took 3.82ms. Allocated memory is still 302.0MB. Free memory was 182.1MB in the beginning and 182.1MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:12:10,736 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.01ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 93.2MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.26ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 90.3MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.74ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 87.2MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 368.06ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 66.7MB in the end (delta: 20.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4053.64ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 65.9MB in the beginning and 182.1MB in the end (delta: -116.2MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. * Witness Printer took 3.82ms. Allocated memory is still 302.0MB. Free memory was 182.1MB in the beginning and 182.1MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryFLOATComparisonOperation at line 58, overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of someBinaryFLOATComparisonOperation at line 108. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 64; [L23] float var_1_2 = 4.5; [L24] float var_1_3 = 64.8; [L25] float var_1_4 = 64.4; [L26] float var_1_5 = 0.2; [L27] signed short int var_1_7 = 10000; [L28] signed short int var_1_8 = 1; [L29] signed short int var_1_9 = 50; [L30] signed short int var_1_10 = 8; [L31] unsigned char var_1_13 = 2; [L32] unsigned char var_1_14 = 100; [L33] unsigned short int var_1_15 = 128; [L34] unsigned short int var_1_16 = 23647; [L35] unsigned short int var_1_17 = 32; [L36] signed char var_1_18 = 0; [L37] signed char var_1_19 = -50; [L38] unsigned char var_1_20 = 0; [L39] unsigned char var_1_21 = 0; [L112] isInitial = 1 [L113] FCALL initially() [L114] COND TRUE 1 [L115] FCALL updateLastVariables() [L116] CALL updateVariables() [L72] var_1_2 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_3=324/5, var_1_4=322/5, var_1_5=1/5, var_1_7=10000, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_3=324/5, var_1_4=322/5, var_1_5=1/5, var_1_7=10000, var_1_8=1, var_1_9=50] [L73] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_3=324/5, var_1_4=322/5, var_1_5=1/5, var_1_7=10000, var_1_8=1, var_1_9=50] [L74] var_1_3 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_4=322/5, var_1_5=1/5, var_1_7=10000, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_4=322/5, var_1_5=1/5, var_1_7=10000, var_1_8=1, var_1_9=50] [L75] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_4=322/5, var_1_5=1/5, var_1_7=10000, var_1_8=1, var_1_9=50] [L76] var_1_4 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_5=1/5, var_1_7=10000, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_5=1/5, var_1_7=10000, var_1_8=1, var_1_9=50] [L77] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_5=1/5, var_1_7=10000, var_1_8=1, var_1_9=50] [L78] var_1_5 = __VERIFIER_nondet_float() [L79] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L79] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L80] var_1_7 = __VERIFIER_nondet_short() [L81] CALL assume_abort_if_not(var_1_7 >= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L81] RET assume_abort_if_not(var_1_7 >= 8191) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L82] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L82] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L83] var_1_8 = __VERIFIER_nondet_short() [L84] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=50] [L84] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=50] [L85] CALL assume_abort_if_not(var_1_8 <= 8192) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=50] [L85] RET assume_abort_if_not(var_1_8 <= 8192) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=50] [L86] var_1_9 = __VERIFIER_nondet_short() [L87] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L87] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L88] CALL assume_abort_if_not(var_1_9 <= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L88] RET assume_abort_if_not(var_1_9 <= 8191) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L89] var_1_10 = __VERIFIER_nondet_short() [L90] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L90] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L91] CALL assume_abort_if_not(var_1_10 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L91] RET assume_abort_if_not(var_1_10 <= 32766) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L92] var_1_14 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L93] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L94] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L94] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L95] var_1_16 = __VERIFIER_nondet_ushort() [L96] CALL assume_abort_if_not(var_1_16 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L96] RET assume_abort_if_not(var_1_16 >= 16383) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L97] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L97] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L98] var_1_19 = __VERIFIER_nondet_char() [L99] CALL assume_abort_if_not(var_1_19 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L99] RET assume_abort_if_not(var_1_19 >= -127) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L100] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L100] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L101] var_1_21 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L102] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L103] CALL assume_abort_if_not(var_1_21 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L103] RET assume_abort_if_not(var_1_21 <= 0) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L116] RET updateVariables() [L117] CALL step() [L43] var_1_18 = var_1_19 [L44] var_1_20 = var_1_21 [L45] signed char stepLocal_1 = var_1_18; [L46] signed long int stepLocal_0 = var_1_9 / var_1_7; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L47] EXPR var_1_8 << var_1_10 VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L47] COND FALSE !(stepLocal_1 > (var_1_8 << var_1_10)) [L54] EXPR var_1_7 ^ var_1_18 VAL [isInitial=1, stepLocal_0=0, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L54] signed long int stepLocal_2 = var_1_7 ^ var_1_18; [L55] COND FALSE !(var_1_14 >= stepLocal_2) VAL [isInitial=1, stepLocal_0=0, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L58] COND TRUE var_1_2 != ((((var_1_3) > ((var_1_4 - var_1_5))) ? (var_1_3) : ((var_1_4 - var_1_5)))) VAL [isInitial=1, stepLocal_0=0, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L59] COND FALSE !(\read(var_1_20)) VAL [isInitial=1, stepLocal_0=0, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L69] var_1_17 = var_1_1 [L117] RET step() [L118] CALL, EXPR property() [L108] EXPR ((var_1_2 != ((((var_1_3) > ((var_1_4 - var_1_5))) ? (var_1_3) : ((var_1_4 - var_1_5))))) ? (var_1_20 ? (var_1_1 == ((signed short int) (((var_1_7 - 32) + (var_1_13 + var_1_13)) - var_1_13))) : 1) : (var_1_20 ? (var_1_1 == ((signed short int) var_1_18)) : (var_1_1 == ((signed short int) var_1_13)))) && ((var_1_18 > (var_1_8 << var_1_10)) ? (((var_1_9 / var_1_7) > -25) ? (var_1_13 == ((unsigned char) var_1_14)) : (var_1_13 == ((unsigned char) var_1_14))) : 1) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=64, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L108] EXPR (((var_1_2 != ((((var_1_3) > ((var_1_4 - var_1_5))) ? (var_1_3) : ((var_1_4 - var_1_5))))) ? (var_1_20 ? (var_1_1 == ((signed short int) (((var_1_7 - 32) + (var_1_13 + var_1_13)) - var_1_13))) : 1) : (var_1_20 ? (var_1_1 == ((signed short int) var_1_18)) : (var_1_1 == ((signed short int) var_1_13)))) && ((var_1_18 > (var_1_8 << var_1_10)) ? (((var_1_9 / var_1_7) > -25) ? (var_1_13 == ((unsigned char) var_1_14)) : (var_1_13 == ((unsigned char) var_1_14))) : 1)) && ((var_1_14 >= (var_1_7 ^ var_1_18)) ? (var_1_15 == ((unsigned short int) (var_1_14 + (var_1_16 - var_1_13)))) : 1) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=64, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L108-L109] return ((((((var_1_2 != ((((var_1_3) > ((var_1_4 - var_1_5))) ? (var_1_3) : ((var_1_4 - var_1_5))))) ? (var_1_20 ? (var_1_1 == ((signed short int) (((var_1_7 - 32) + (var_1_13 + var_1_13)) - var_1_13))) : 1) : (var_1_20 ? (var_1_1 == ((signed short int) var_1_18)) : (var_1_1 == ((signed short int) var_1_13)))) && ((var_1_18 > (var_1_8 << var_1_10)) ? (((var_1_9 / var_1_7) > -25) ? (var_1_13 == ((unsigned char) var_1_14)) : (var_1_13 == ((unsigned char) var_1_14))) : 1)) && ((var_1_14 >= (var_1_7 ^ var_1_18)) ? (var_1_15 == ((unsigned short int) (var_1_14 + (var_1_16 - var_1_13)))) : 1)) && (var_1_17 == ((unsigned short int) var_1_1))) && (var_1_18 == ((signed char) var_1_19))) && (var_1_20 == ((unsigned char) var_1_21)) ; [L118] RET, EXPR property() [L118] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=64, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=16383, var_1_17=64, var_1_18=0, var_1_19=0, var_1_1=64, var_1_20=0, var_1_21=0, var_1_7=8191, var_1_8=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 71 locations, 128 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 5, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 372 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 362 mSDsluCounter, 860 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 560 mSDsCounter, 111 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 686 IncrementalHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 111 mSolverCounterUnsat, 300 mSDtfsCounter, 686 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 680 GetRequests, 642 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=4, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1166 NumberOfCodeBlocks, 1166 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1156 ConstructedInterpolants, 0 QuantifiedInterpolants, 1922 SizeOfPredicates, 2 NumberOfNonLiveVariables, 901 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 9 InterpolantComputations, 2 PerfectInterpolantSequences, 6532/6840 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 05:12:10,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_variablewrapping_normal_file-43.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 1b276dadabf1c2167b11901ba656aa9e16f5041ffd48790c84fa96230d4114a3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:12:12,492 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:12:12,579 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:12:12,586 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:12:12,586 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:12:12,602 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:12:12,603 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:12:12,603 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:12:12,603 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:12:12,604 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:12:12,604 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:12:12,604 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:12:12,604 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:12:12,604 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:12:12,604 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:12:12,605 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:12:12,605 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:12:12,605 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:12:12,605 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:12:12,605 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:12:12,605 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:12:12,605 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:12:12,608 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:12:12,608 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:12:12,608 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:12:12,609 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:12:12,609 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:12:12,609 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:12:12,609 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:12:12,609 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:12:12,609 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:12:12,609 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:12:12,609 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:12:12,609 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:12:12,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:12:12,609 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:12:12,609 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:12:12,609 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:12:12,609 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:12:12,609 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:12:12,610 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:12:12,610 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:12:12,610 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:12:12,610 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:12:12,610 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:12:12,610 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 -> 1b276dadabf1c2167b11901ba656aa9e16f5041ffd48790c84fa96230d4114a3 [2025-03-17 05:12:12,836 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:12:12,844 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:12:12,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:12:12,846 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:12:12,847 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:12:12,847 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-43.i [2025-03-17 05:12:13,947 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6104d01ba/2add7aa75882453bb8e87ac89e96c074/FLAG29c7c1690 [2025-03-17 05:12:14,157 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:12:14,158 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-43.i [2025-03-17 05:12:14,165 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6104d01ba/2add7aa75882453bb8e87ac89e96c074/FLAG29c7c1690 [2025-03-17 05:12:14,177 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6104d01ba/2add7aa75882453bb8e87ac89e96c074 [2025-03-17 05:12:14,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:12:14,180 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:12:14,181 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:12:14,181 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:12:14,184 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:12:14,185 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:12:14" (1/1) ... [2025-03-17 05:12:14,185 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ef37a80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:12:14, skipping insertion in model container [2025-03-17 05:12:14,186 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:12:14" (1/1) ... [2025-03-17 05:12:14,198 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:12:14,301 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_variablewrapping_normal_file-43.i[913,926] [2025-03-17 05:12:14,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:12:14,364 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:12:14,372 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_variablewrapping_normal_file-43.i[913,926] [2025-03-17 05:12:14,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:12:14,406 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:12:14,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:12:14 WrapperNode [2025-03-17 05:12:14,407 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:12:14,408 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:12:14,409 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:12:14,409 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:12:14,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:12:14" (1/1) ... [2025-03-17 05:12:14,424 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:12:14" (1/1) ... [2025-03-17 05:12:14,440 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 123 [2025-03-17 05:12:14,440 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:12:14,441 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:12:14,441 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:12:14,441 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:12:14,446 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:12:14" (1/1) ... [2025-03-17 05:12:14,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:12:14" (1/1) ... [2025-03-17 05:12:14,448 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:12:14" (1/1) ... [2025-03-17 05:12:14,455 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-17 05:12:14,455 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:12:14" (1/1) ... [2025-03-17 05:12:14,455 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:12:14" (1/1) ... [2025-03-17 05:12:14,464 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:12:14" (1/1) ... [2025-03-17 05:12:14,465 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:12:14" (1/1) ... [2025-03-17 05:12:14,466 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:12:14" (1/1) ... [2025-03-17 05:12:14,468 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:12:14" (1/1) ... [2025-03-17 05:12:14,470 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:12:14,470 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:12:14,470 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:12:14,470 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:12:14,472 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:12:14" (1/1) ... [2025-03-17 05:12:14,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:12:14,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:12:14,498 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-17 05:12:14,500 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-17 05:12:14,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:12:14,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:12:14,518 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:12:14,518 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:12:14,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:12:14,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:12:14,568 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:12:14,569 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:12:14,884 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-17 05:12:14,884 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:12:14,894 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:12:14,894 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:12:14,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:12:14 BoogieIcfgContainer [2025-03-17 05:12:14,895 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:12:14,896 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:12:14,896 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:12:14,900 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:12:14,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:12:14" (1/3) ... [2025-03-17 05:12:14,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d9e3956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:12:14, skipping insertion in model container [2025-03-17 05:12:14,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:12:14" (2/3) ... [2025-03-17 05:12:14,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d9e3956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:12:14, skipping insertion in model container [2025-03-17 05:12:14,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:12:14" (3/3) ... [2025-03-17 05:12:14,901 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-43.i [2025-03-17 05:12:14,911 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:12:14,912 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-43.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:12:14,969 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:12:14,977 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;@7b9a4d0c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:12:14,977 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:12:14,980 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:12:14,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-17 05:12:14,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:12:14,989 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:12:14,989 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:12:14,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:12:14,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1508401060, now seen corresponding path program 1 times [2025-03-17 05:12:15,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:12:15,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1046505549] [2025-03-17 05:12:15,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:12:15,003 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:12:15,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:12:15,005 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:12:15,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 05:12:15,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 05:12:15,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 05:12:15,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:12:15,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:12:15,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:12:15,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:12:15,261 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2025-03-17 05:12:15,261 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:12:15,262 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:12:15,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1046505549] [2025-03-17 05:12:15,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1046505549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:12:15,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:12:15,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:12:15,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854069941] [2025-03-17 05:12:15,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:12:15,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:12:15,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:12:15,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:12:15,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:12:15,281 INFO L87 Difference]: Start difference. First operand has 52 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:12:15,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:12:15,300 INFO L93 Difference]: Finished difference Result 101 states and 176 transitions. [2025-03-17 05:12:15,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:12:15,302 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 122 [2025-03-17 05:12:15,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:12:15,307 INFO L225 Difference]: With dead ends: 101 [2025-03-17 05:12:15,307 INFO L226 Difference]: Without dead ends: 50 [2025-03-17 05:12:15,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 121 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-17 05:12:15,311 INFO L435 NwaCegarLoop]: 75 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, 75 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-17 05:12:15,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:12:15,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-17 05:12:15,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-17 05:12:15,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:12:15,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 75 transitions. [2025-03-17 05:12:15,348 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 75 transitions. Word has length 122 [2025-03-17 05:12:15,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:12:15,348 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 75 transitions. [2025-03-17 05:12:15,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:12:15,348 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 75 transitions. [2025-03-17 05:12:15,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-17 05:12:15,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:12:15,352 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:12:15,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-17 05:12:15,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:12:15,553 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:12:15,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:12:15,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1882481248, now seen corresponding path program 1 times [2025-03-17 05:12:15,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:12:15,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1433408900] [2025-03-17 05:12:15,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:12:15,554 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:12:15,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:12:15,556 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:12:15,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 05:12:15,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 05:12:15,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 05:12:15,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:12:15,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:12:15,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:12:15,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:12:15,850 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 05:12:15,850 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:12:15,850 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:12:15,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1433408900] [2025-03-17 05:12:15,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1433408900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:12:15,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:12:15,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:12:15,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140027252] [2025-03-17 05:12:15,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:12:15,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:12:15,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:12:15,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:12:15,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:12:15,853 INFO L87 Difference]: Start difference. First operand 50 states and 75 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:12:16,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:12:16,190 INFO L93 Difference]: Finished difference Result 107 states and 156 transitions. [2025-03-17 05:12:16,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:12:16,194 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 122 [2025-03-17 05:12:16,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:12:16,195 INFO L225 Difference]: With dead ends: 107 [2025-03-17 05:12:16,195 INFO L226 Difference]: Without dead ends: 58 [2025-03-17 05:12:16,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:12:16,197 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 67 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:12:16,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 102 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:12:16,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-17 05:12:16,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2025-03-17 05:12:16,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:12:16,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 76 transitions. [2025-03-17 05:12:16,212 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 76 transitions. Word has length 122 [2025-03-17 05:12:16,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:12:16,213 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 76 transitions. [2025-03-17 05:12:16,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:12:16,213 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 76 transitions. [2025-03-17 05:12:16,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-17 05:12:16,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:12:16,216 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:12:16,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-17 05:12:16,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:12:16,416 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:12:16,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:12:16,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1882451457, now seen corresponding path program 1 times [2025-03-17 05:12:16,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:12:16,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1429894576] [2025-03-17 05:12:16,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:12:16,417 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:12:16,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:12:16,419 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:12:16,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 05:12:16,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 05:12:16,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 05:12:16,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:12:16,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:12:16,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-17 05:12:16,616 INFO L279 TraceCheckSpWp]: Computing forward predicates...