./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-53.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 59c9e2a56212f756d7a327fbbde699477ef0467f6f8e097651003bbcb4a09b39 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:33:31,050 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:33:31,104 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 14:33:31,110 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:33:31,110 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:33:31,124 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:33:31,125 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:33:31,125 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:33:31,126 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:33:31,126 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:33:31,126 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:33:31,127 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:33:31,127 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:33:31,127 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:33:31,127 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:33:31,127 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:33:31,128 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:33:31,128 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:33:31,128 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 14:33:31,128 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:33:31,128 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:33:31,128 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:33:31,128 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:33:31,129 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:33:31,129 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:33:31,129 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:33:31,129 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:33:31,129 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:33:31,129 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:33:31,129 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:33:31,129 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:33:31,129 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:33:31,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:33:31,130 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:33:31,130 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:33:31,130 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:33:31,130 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:33:31,131 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 14:33:31,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 14:33:31,131 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:33:31,131 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:33:31,131 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:33:31,131 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:33:31,131 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 -> 59c9e2a56212f756d7a327fbbde699477ef0467f6f8e097651003bbcb4a09b39 [2025-03-08 14:33:31,356 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:33:31,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:33:31,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:33:31,364 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:33:31,364 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:33:31,365 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-53.i [2025-03-08 14:33:32,524 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0df98ca7/ab565e523228492a874226556c90b37e/FLAGc251c74a2 [2025-03-08 14:33:32,744 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:33:32,745 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-53.i [2025-03-08 14:33:32,750 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0df98ca7/ab565e523228492a874226556c90b37e/FLAGc251c74a2 [2025-03-08 14:33:32,761 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0df98ca7/ab565e523228492a874226556c90b37e [2025-03-08 14:33:32,763 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:33:32,764 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:33:32,765 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:33:32,765 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:33:32,768 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:33:32,769 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:33:32" (1/1) ... [2025-03-08 14:33:32,769 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f910bd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:33:32, skipping insertion in model container [2025-03-08 14:33:32,770 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:33:32" (1/1) ... [2025-03-08 14:33:32,784 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:33:32,881 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-53.i[915,928] [2025-03-08 14:33:32,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:33:32,929 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:33:32,939 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-53.i[915,928] [2025-03-08 14:33:32,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:33:32,974 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:33:32,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:33:32 WrapperNode [2025-03-08 14:33:32,975 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:33:32,975 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:33:32,976 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:33:32,976 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:33:32,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:33:32" (1/1) ... [2025-03-08 14:33:32,984 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:33:32" (1/1) ... [2025-03-08 14:33:33,003 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 105 [2025-03-08 14:33:33,004 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:33:33,005 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:33:33,005 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:33:33,005 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:33:33,011 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:33:32" (1/1) ... [2025-03-08 14:33:33,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:33:32" (1/1) ... [2025-03-08 14:33:33,013 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:33:32" (1/1) ... [2025-03-08 14:33:33,028 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 14:33:33,031 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:33:32" (1/1) ... [2025-03-08 14:33:33,031 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:33:32" (1/1) ... [2025-03-08 14:33:33,035 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:33:32" (1/1) ... [2025-03-08 14:33:33,039 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:33:32" (1/1) ... [2025-03-08 14:33:33,040 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:33:32" (1/1) ... [2025-03-08 14:33:33,041 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:33:32" (1/1) ... [2025-03-08 14:33:33,042 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:33:33,042 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:33:33,046 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:33:33,047 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:33:33,047 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:33:32" (1/1) ... [2025-03-08 14:33:33,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:33:33,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:33:33,077 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 14:33:33,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 14:33:33,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:33:33,100 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:33:33,100 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:33:33,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 14:33:33,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:33:33,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:33:33,160 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:33:33,161 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:33:33,304 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 14:33:33,304 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:33:33,311 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:33:33,311 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:33:33,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:33:33 BoogieIcfgContainer [2025-03-08 14:33:33,311 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:33:33,313 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:33:33,313 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:33:33,316 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:33:33,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:33:32" (1/3) ... [2025-03-08 14:33:33,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75ebcb4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:33:33, skipping insertion in model container [2025-03-08 14:33:33,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:33:32" (2/3) ... [2025-03-08 14:33:33,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75ebcb4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:33:33, skipping insertion in model container [2025-03-08 14:33:33,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:33:33" (3/3) ... [2025-03-08 14:33:33,318 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-53.i [2025-03-08 14:33:33,328 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:33:33,329 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-53.i that has 2 procedures, 49 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:33:33,371 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:33:33,379 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;@65858304, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:33:33,379 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:33:33,382 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 14:33:33,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 14:33:33,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:33:33,388 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:33:33,388 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:33:33,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:33:33,392 INFO L85 PathProgramCache]: Analyzing trace with hash 877161795, now seen corresponding path program 1 times [2025-03-08 14:33:33,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:33:33,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498611048] [2025-03-08 14:33:33,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:33:33,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:33:33,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 14:33:33,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 14:33:33,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:33:33,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:33:33,603 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-08 14:33:33,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:33:33,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498611048] [2025-03-08 14:33:33,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498611048] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:33:33,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093105505] [2025-03-08 14:33:33,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:33:33,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:33:33,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:33:33,607 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:33:33,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 14:33:33,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 14:33:33,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 14:33:33,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:33:33,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:33:33,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:33:33,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:33:33,744 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-08 14:33:33,744 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:33:33,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093105505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:33:33,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:33:33,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 14:33:33,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498493518] [2025-03-08 14:33:33,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:33:33,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:33:33,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:33:33,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:33:33,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:33:33,762 INFO L87 Difference]: Start difference. First operand has 49 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 14:33:33,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:33:33,779 INFO L93 Difference]: Finished difference Result 92 states and 151 transitions. [2025-03-08 14:33:33,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:33:33,780 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 102 [2025-03-08 14:33:33,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:33:33,787 INFO L225 Difference]: With dead ends: 92 [2025-03-08 14:33:33,787 INFO L226 Difference]: Without dead ends: 46 [2025-03-08 14:33:33,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 103 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-08 14:33:33,792 INFO L435 NwaCegarLoop]: 65 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, 65 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-08 14:33:33,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:33:33,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-08 14:33:33,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-08 14:33:33,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 14:33:33,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 65 transitions. [2025-03-08 14:33:33,822 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 65 transitions. Word has length 102 [2025-03-08 14:33:33,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:33:33,822 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 65 transitions. [2025-03-08 14:33:33,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 14:33:33,822 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2025-03-08 14:33:33,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 14:33:33,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:33:33,825 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:33:33,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 14:33:34,027 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-08 14:33:34,027 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:33:34,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:33:34,028 INFO L85 PathProgramCache]: Analyzing trace with hash 352161735, now seen corresponding path program 1 times [2025-03-08 14:33:34,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:33:34,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112759861] [2025-03-08 14:33:34,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:33:34,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:33:34,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 14:33:34,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 14:33:34,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:33:34,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:33:37,099 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 21 proven. 159 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-03-08 14:33:37,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:33:37,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112759861] [2025-03-08 14:33:37,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112759861] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:33:37,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142551365] [2025-03-08 14:33:37,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:33:37,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:33:37,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:33:37,102 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:33:37,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 14:33:37,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 14:33:37,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 14:33:37,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:33:37,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:33:37,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-08 14:33:37,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:33:39,505 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 207 proven. 159 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-08 14:33:39,505 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:33:46,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142551365] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:33:46,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 14:33:46,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 23] total 30 [2025-03-08 14:33:46,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118196784] [2025-03-08 14:33:46,776 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 14:33:46,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 14:33:46,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:33:46,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 14:33:46,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=1306, Unknown=0, NotChecked=0, Total=1640 [2025-03-08 14:33:46,780 INFO L87 Difference]: Start difference. First operand 46 states and 65 transitions. Second operand has 30 states, 29 states have (on average 2.103448275862069) internal successors, (61), 27 states have internal predecessors, (61), 11 states have call successors, (30), 7 states have call predecessors, (30), 9 states have return successors, (30), 11 states have call predecessors, (30), 11 states have call successors, (30) [2025-03-08 14:33:48,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:33:48,015 INFO L93 Difference]: Finished difference Result 142 states and 178 transitions. [2025-03-08 14:33:48,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-08 14:33:48,019 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.103448275862069) internal successors, (61), 27 states have internal predecessors, (61), 11 states have call successors, (30), 7 states have call predecessors, (30), 9 states have return successors, (30), 11 states have call predecessors, (30), 11 states have call successors, (30) Word has length 102 [2025-03-08 14:33:48,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:33:48,020 INFO L225 Difference]: With dead ends: 142 [2025-03-08 14:33:48,020 INFO L226 Difference]: Without dead ends: 99 [2025-03-08 14:33:48,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=584, Invalid=2068, Unknown=0, NotChecked=0, Total=2652 [2025-03-08 14:33:48,022 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 112 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 14:33:48,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 456 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 14:33:48,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-08 14:33:48,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 72. [2025-03-08 14:33:48,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 48 states have internal predecessors, (53), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 14:33:48,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 85 transitions. [2025-03-08 14:33:48,031 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 85 transitions. Word has length 102 [2025-03-08 14:33:48,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:33:48,031 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 85 transitions. [2025-03-08 14:33:48,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.103448275862069) internal successors, (61), 27 states have internal predecessors, (61), 11 states have call successors, (30), 7 states have call predecessors, (30), 9 states have return successors, (30), 11 states have call predecessors, (30), 11 states have call successors, (30) [2025-03-08 14:33:48,032 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2025-03-08 14:33:48,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 14:33:48,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:33:48,033 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:33:48,041 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-08 14:33:48,237 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-08 14:33:48,237 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:33:48,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:33:48,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1239665416, now seen corresponding path program 1 times [2025-03-08 14:33:48,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:33:48,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472572393] [2025-03-08 14:33:48,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:33:48,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:33:48,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 14:33:48,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 14:33:48,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:33:48,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:33:48,285 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 14:33:48,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 14:33:48,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 14:33:48,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:33:48,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:33:48,358 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 14:33:48,359 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 14:33:48,360 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 14:33:48,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 14:33:48,364 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 14:33:48,429 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 14:33:48,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:33:48 BoogieIcfgContainer [2025-03-08 14:33:48,432 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 14:33:48,433 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 14:33:48,433 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 14:33:48,433 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 14:33:48,434 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:33:33" (3/4) ... [2025-03-08 14:33:48,435 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 14:33:48,436 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 14:33:48,437 INFO L158 Benchmark]: Toolchain (without parser) took 15672.11ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 105.4MB in the beginning and 204.6MB in the end (delta: -99.2MB). Peak memory consumption was 135.7MB. Max. memory is 16.1GB. [2025-03-08 14:33:48,437 INFO L158 Benchmark]: CDTParser took 0.74ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:33:48,437 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.79ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 92.9MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:33:48,438 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.88ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 91.1MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 14:33:48,438 INFO L158 Benchmark]: Boogie Preprocessor took 37.08ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 89.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:33:48,438 INFO L158 Benchmark]: IcfgBuilder took 269.14ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 74.3MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 14:33:48,438 INFO L158 Benchmark]: TraceAbstraction took 15119.20ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 73.4MB in the beginning and 204.7MB in the end (delta: -131.4MB). Peak memory consumption was 102.1MB. Max. memory is 16.1GB. [2025-03-08 14:33:48,439 INFO L158 Benchmark]: Witness Printer took 3.13ms. Allocated memory is still 377.5MB. Free memory was 204.7MB in the beginning and 204.6MB in the end (delta: 120.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:33:48,439 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.74ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.79ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 92.9MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.88ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 91.1MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.08ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 89.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 269.14ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 74.3MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 15119.20ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 73.4MB in the beginning and 204.7MB in the end (delta: -131.4MB). Peak memory consumption was 102.1MB. Max. memory is 16.1GB. * Witness Printer took 3.13ms. Allocated memory is still 377.5MB. Free memory was 204.7MB in the beginning and 204.6MB in the end (delta: 120.0kB). 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 81, overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of someBinaryFLOATComparisonOperation at line 85, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of someBinaryDOUBLEComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 44, overapproximation of someBinaryArithmeticFLOAToperation at line 43. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 5; [L23] unsigned long int var_1_2 = 500; [L24] unsigned long int var_1_3 = 1456677701; [L25] unsigned long int var_1_4 = 1000000000; [L26] unsigned long int var_1_5 = 1; [L27] unsigned char var_1_6 = 0; [L28] unsigned char var_1_7 = 0; [L29] unsigned char var_1_8 = 0; [L30] unsigned char var_1_11 = 0; [L31] float var_1_12 = 128.6; [L32] float var_1_13 = 500.4; [L33] float var_1_14 = 8.5; [L34] double var_1_15 = 255.8; [L35] double var_1_16 = 25.75; [L36] float var_1_17 = 1.2; [L37] float var_1_18 = 9.6; VAL [isInitial=0, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=500, var_1_3=1456677701, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] FCALL updateLastVariables() [L98] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_ulong() [L61] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_3=1456677701, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_3=1456677701, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L61] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_3=1456677701, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L62] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1456677701, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1456677701, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L62] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1456677701, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L63] var_1_3 = __VERIFIER_nondet_ulong() [L64] CALL assume_abort_if_not(var_1_3 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L64] RET assume_abort_if_not(var_1_3 >= 1073741823) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L65] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L65] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=1000000000, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L66] var_1_4 = __VERIFIER_nondet_ulong() [L67] CALL assume_abort_if_not(var_1_4 >= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L67] RET assume_abort_if_not(var_1_4 >= 536870911) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L68] CALL assume_abort_if_not(var_1_4 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L68] RET assume_abort_if_not(var_1_4 <= 1073741823) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=0] [L69] var_1_5 = __VERIFIER_nondet_ulong() [L70] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_6=0, var_1_7=0, var_1_8=0] [L70] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_6=0, var_1_7=0, var_1_8=0] [L71] CALL assume_abort_if_not(var_1_5 <= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0] [L71] RET assume_abort_if_not(var_1_5 <= 536870911) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=0, var_1_8=0] [L72] var_1_7 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_8=0] [L73] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_8=0] [L74] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L74] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, var_1_11=0, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L75] var_1_11 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L76] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L77] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L77] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_13=2502/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L78] var_1_13 = __VERIFIER_nondet_float() [L79] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L79] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_14=17/2, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L80] var_1_14 = __VERIFIER_nondet_float() [L81] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L81] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_15=1279/5, var_1_16=103/4, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L82] var_1_16 = __VERIFIER_nondet_double() [L83] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_15=1279/5, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_15=1279/5, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L83] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_15=1279/5, var_1_17=6/5, var_1_18=48/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L84] var_1_18 = __VERIFIER_nondet_float() [L85] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_15=1279/5, var_1_17=6/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_15=1279/5, var_1_17=6/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L85] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-255, var_1_12=643/5, var_1_15=1279/5, var_1_17=6/5, var_1_1=5, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=0, var_1_7=-256, var_1_8=0] [L98] RET updateVariables() [L99] CALL step() [L41] var_1_1 = (var_1_2 + (var_1_3 - (var_1_4 - var_1_5))) [L42] var_1_6 = var_1_7 [L43] var_1_12 = ((2.55f + var_1_13) - var_1_14) [L44] var_1_15 = ((((var_1_13) > (((((var_1_14) < (var_1_16)) ? (var_1_14) : (var_1_16))))) ? (var_1_13) : (((((var_1_14) < (var_1_16)) ? (var_1_14) : (var_1_16)))))) VAL [isInitial=1, var_1_11=-255, var_1_13=1456677706, var_1_14=1456677706, var_1_15=1456677706, var_1_16=1456677706, var_1_17=6/5, var_1_1=1073741823, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L45] COND FALSE !(var_1_2 >= var_1_1) VAL [isInitial=1, var_1_11=-255, var_1_13=1456677706, var_1_14=1456677706, var_1_15=1456677706, var_1_16=1456677706, var_1_17=6/5, var_1_1=1073741823, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L48] unsigned long int stepLocal_0 = (((var_1_4) < (var_1_3)) ? (var_1_4) : (var_1_3)); VAL [isInitial=1, stepLocal_0=536870911, var_1_11=-255, var_1_13=1456677706, var_1_14=1456677706, var_1_15=1456677706, var_1_16=1456677706, var_1_17=6/5, var_1_1=1073741823, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=0] [L49] COND FALSE !(((((var_1_1) < (var_1_5)) ? (var_1_1) : (var_1_5))) != stepLocal_0) [L56] var_1_8 = var_1_11 VAL [isInitial=1, var_1_11=-255, var_1_13=1456677706, var_1_14=1456677706, var_1_15=1456677706, var_1_16=1456677706, var_1_17=6/5, var_1_1=1073741823, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=-255] [L99] RET step() [L100] CALL, EXPR property() [L90-L91] return (((((var_1_1 == ((unsigned long int) (var_1_2 + (var_1_3 - (var_1_4 - var_1_5))))) && (var_1_6 == ((unsigned char) var_1_7))) && ((((((var_1_1) < (var_1_5)) ? (var_1_1) : (var_1_5))) != ((((var_1_4) < (var_1_3)) ? (var_1_4) : (var_1_3)))) ? ((var_1_17 == var_1_12) ? (var_1_6 ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1) : (var_1_8 == ((unsigned char) var_1_11)))) && (var_1_12 == ((float) ((2.55f + var_1_13) - var_1_14)))) && (var_1_15 == ((double) ((((var_1_13) > (((((var_1_14) < (var_1_16)) ? (var_1_14) : (var_1_16))))) ? (var_1_13) : (((((var_1_14) < (var_1_16)) ? (var_1_14) : (var_1_16))))))))) && ((var_1_2 >= var_1_1) ? (var_1_17 == ((float) (var_1_14 - ((((var_1_13) > (var_1_18)) ? (var_1_13) : (var_1_18)))))) : 1) ; VAL [\result=0, isInitial=1, var_1_11=-255, var_1_13=1456677706, var_1_14=1456677706, var_1_15=1456677706, var_1_16=1456677706, var_1_17=6/5, var_1_1=1073741823, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=-255] [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=-255, var_1_13=1456677706, var_1_14=1456677706, var_1_15=1456677706, var_1_16=1456677706, var_1_17=6/5, var_1_1=1073741823, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=-255] [L19] reach_error() VAL [isInitial=1, var_1_11=-255, var_1_13=1456677706, var_1_14=1456677706, var_1_15=1456677706, var_1_16=1456677706, var_1_17=6/5, var_1_1=1073741823, var_1_2=0, var_1_3=1073741823, var_1_4=536870911, var_1_5=536870911, var_1_6=-256, var_1_7=-256, var_1_8=-255] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 49 locations, 86 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.0s, OverallIterations: 3, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 114 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 112 mSDsluCounter, 521 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 393 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 716 IncrementalHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 128 mSDtfsCounter, 716 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 311 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=2, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 27 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 510 NumberOfCodeBlocks, 510 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 404 ConstructedInterpolants, 0 QuantifiedInterpolants, 4478 SizeOfPredicates, 5 NumberOfNonLiveVariables, 478 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 1572/1920 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-08 14:33:48,458 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_loopvsstraightlinecode_25-while_file-53.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 59c9e2a56212f756d7a327fbbde699477ef0467f6f8e097651003bbcb4a09b39 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:33:50,295 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:33:50,383 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 14:33:50,390 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:33:50,391 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:33:50,411 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:33:50,413 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:33:50,413 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:33:50,414 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:33:50,414 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:33:50,415 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:33:50,415 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:33:50,415 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:33:50,415 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:33:50,415 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:33:50,416 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:33:50,416 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:33:50,416 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:33:50,416 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:33:50,416 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:33:50,416 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:33:50,416 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:33:50,416 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:33:50,417 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 14:33:50,417 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 14:33:50,417 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 14:33:50,417 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:33:50,417 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:33:50,417 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:33:50,417 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:33:50,417 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:33:50,417 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:33:50,417 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:33:50,417 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:33:50,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:33:50,418 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:33:50,418 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:33:50,418 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:33:50,418 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:33:50,418 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 14:33:50,418 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 14:33:50,418 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:33:50,418 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:33:50,418 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:33:50,418 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:33:50,418 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 -> 59c9e2a56212f756d7a327fbbde699477ef0467f6f8e097651003bbcb4a09b39 [2025-03-08 14:33:50,779 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:33:50,786 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:33:50,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:33:50,788 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:33:50,788 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:33:50,789 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-53.i [2025-03-08 14:33:51,943 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2d0c704f/2f3b5edf0cd04ebab5991ebb9cf9d7d0/FLAG07f32facb [2025-03-08 14:33:52,154 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:33:52,155 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-53.i [2025-03-08 14:33:52,161 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2d0c704f/2f3b5edf0cd04ebab5991ebb9cf9d7d0/FLAG07f32facb [2025-03-08 14:33:52,535 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2d0c704f/2f3b5edf0cd04ebab5991ebb9cf9d7d0 [2025-03-08 14:33:52,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:33:52,541 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:33:52,544 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:33:52,544 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:33:52,548 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:33:52,549 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:33:52" (1/1) ... [2025-03-08 14:33:52,552 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@639afb4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:33:52, skipping insertion in model container [2025-03-08 14:33:52,552 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:33:52" (1/1) ... [2025-03-08 14:33:52,571 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:33:52,678 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-53.i[915,928] [2025-03-08 14:33:52,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:33:52,716 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:33:52,724 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-53.i[915,928] [2025-03-08 14:33:52,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:33:52,751 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:33:52,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:33:52 WrapperNode [2025-03-08 14:33:52,751 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:33:52,752 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:33:52,752 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:33:52,752 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:33:52,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:33:52" (1/1) ... [2025-03-08 14:33:52,763 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:33:52" (1/1) ... [2025-03-08 14:33:52,784 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 105 [2025-03-08 14:33:52,785 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:33:52,785 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:33:52,786 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:33:52,786 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:33:52,791 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:33:52" (1/1) ... [2025-03-08 14:33:52,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:33:52" (1/1) ... [2025-03-08 14:33:52,793 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:33:52" (1/1) ... [2025-03-08 14:33:52,812 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 14:33:52,812 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:33:52" (1/1) ... [2025-03-08 14:33:52,812 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:33:52" (1/1) ... [2025-03-08 14:33:52,817 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:33:52" (1/1) ... [2025-03-08 14:33:52,821 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:33:52" (1/1) ... [2025-03-08 14:33:52,822 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:33:52" (1/1) ... [2025-03-08 14:33:52,827 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:33:52" (1/1) ... [2025-03-08 14:33:52,829 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:33:52,830 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:33:52,833 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:33:52,834 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:33:52,834 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:33:52" (1/1) ... [2025-03-08 14:33:52,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:33:52,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:33:52,860 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 14:33:52,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 14:33:52,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:33:52,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 14:33:52,882 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:33:52,883 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:33:52,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:33:52,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:33:52,932 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:33:52,933 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:33:55,510 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 14:33:55,510 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:33:55,516 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:33:55,518 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:33:55,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:33:55 BoogieIcfgContainer [2025-03-08 14:33:55,518 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:33:55,521 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:33:55,521 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:33:55,524 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:33:55,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:33:52" (1/3) ... [2025-03-08 14:33:55,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@435553 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:33:55, skipping insertion in model container [2025-03-08 14:33:55,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:33:52" (2/3) ... [2025-03-08 14:33:55,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@435553 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:33:55, skipping insertion in model container [2025-03-08 14:33:55,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:33:55" (3/3) ... [2025-03-08 14:33:55,526 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-53.i [2025-03-08 14:33:55,536 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:33:55,538 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-53.i that has 2 procedures, 49 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:33:55,578 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:33:55,586 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;@31426d01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:33:55,586 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:33:55,588 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 14:33:55,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 14:33:55,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:33:55,595 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:33:55,595 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:33:55,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:33:55,599 INFO L85 PathProgramCache]: Analyzing trace with hash 877161795, now seen corresponding path program 1 times [2025-03-08 14:33:55,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:33:55,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [165167593] [2025-03-08 14:33:55,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:33:55,607 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-08 14:33:55,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:33:55,609 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-08 14:33:55,611 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-08 14:33:55,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 14:33:55,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 14:33:55,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:33:55,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:33:55,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:33:55,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:33:55,931 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-03-08 14:33:55,931 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:33:55,932 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:33:55,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [165167593] [2025-03-08 14:33:55,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [165167593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:33:55,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:33:55,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 14:33:55,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303079693] [2025-03-08 14:33:55,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:33:55,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:33:55,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:33:55,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:33:55,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:33:55,953 INFO L87 Difference]: Start difference. First operand has 49 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 14:33:55,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:33:55,967 INFO L93 Difference]: Finished difference Result 92 states and 151 transitions. [2025-03-08 14:33:55,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:33:55,969 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 102 [2025-03-08 14:33:55,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:33:55,973 INFO L225 Difference]: With dead ends: 92 [2025-03-08 14:33:55,973 INFO L226 Difference]: Without dead ends: 46 [2025-03-08 14:33:55,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 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-08 14:33:55,979 INFO L435 NwaCegarLoop]: 65 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, 65 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-08 14:33:55,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:33:55,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-08 14:33:56,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-08 14:33:56,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 14:33:56,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 65 transitions. [2025-03-08 14:33:56,028 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 65 transitions. Word has length 102 [2025-03-08 14:33:56,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:33:56,028 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 65 transitions. [2025-03-08 14:33:56,029 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 14:33:56,029 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2025-03-08 14:33:56,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 14:33:56,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:33:56,033 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:33:56,043 INFO L552 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)] Ended with exit code 0 [2025-03-08 14:33:56,234 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-08 14:33:56,234 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:33:56,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:33:56,235 INFO L85 PathProgramCache]: Analyzing trace with hash 352161735, now seen corresponding path program 1 times [2025-03-08 14:33:56,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:33:56,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1376245575] [2025-03-08 14:33:56,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:33:56,235 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-08 14:33:56,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:33:56,238 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-08 14:33:56,239 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-08 14:33:56,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 14:33:56,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 14:33:56,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:33:56,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:33:56,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-08 14:33:56,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:34:47,464 WARN L286 SmtUtils]: Spent 15.64s on a formula simplification that was a NOOP. DAG size: 76 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)