./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-93.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-93.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 2d9182cedd229d548c201f82860145814c664e2f98d8085b9b53829346d05f25 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:00:39,326 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:00:39,384 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:00:39,387 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:00:39,387 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:00:39,406 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:00:39,407 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:00:39,408 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:00:39,408 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:00:39,408 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:00:39,408 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:00:39,408 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:00:39,409 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:00:39,409 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:00:39,409 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:00:39,410 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:00:39,410 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:00:39,410 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:00:39,410 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:00:39,410 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:00:39,410 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:00:39,410 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:00:39,410 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:00:39,410 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:00:39,410 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:00:39,410 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:00:39,410 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:00:39,410 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:00:39,410 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:00:39,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:00:39,410 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:00:39,410 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:00:39,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:00:39,410 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:00:39,410 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:00:39,410 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:00:39,410 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:00:39,411 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:00:39,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:00:39,411 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:00:39,411 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:00:39,411 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:00:39,411 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:00:39,411 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 -> 2d9182cedd229d548c201f82860145814c664e2f98d8085b9b53829346d05f25 [2025-03-04 01:00:39,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:00:39,635 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:00:39,638 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:00:39,639 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:00:39,640 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:00:39,640 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-93.i [2025-03-04 01:00:40,807 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/874c60d6a/27fa9623929f46e682214f188781f58d/FLAG7313779e2 [2025-03-04 01:00:41,095 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:00:41,095 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-93.i [2025-03-04 01:00:41,106 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/874c60d6a/27fa9623929f46e682214f188781f58d/FLAG7313779e2 [2025-03-04 01:00:41,124 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/874c60d6a/27fa9623929f46e682214f188781f58d [2025-03-04 01:00:41,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:00:41,131 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:00:41,133 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:00:41,133 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:00:41,136 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:00:41,137 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:00:41" (1/1) ... [2025-03-04 01:00:41,138 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3867afc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:41, skipping insertion in model container [2025-03-04 01:00:41,138 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:00:41" (1/1) ... [2025-03-04 01:00:41,153 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:00:41,251 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-93.i[913,926] [2025-03-04 01:00:41,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:00:41,304 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:00:41,313 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-93.i[913,926] [2025-03-04 01:00:41,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:00:41,342 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:00:41,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:41 WrapperNode [2025-03-04 01:00:41,344 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:00:41,345 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:00:41,345 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:00:41,345 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:00:41,349 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:41" (1/1) ... [2025-03-04 01:00:41,356 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:41" (1/1) ... [2025-03-04 01:00:41,374 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 98 [2025-03-04 01:00:41,378 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:00:41,378 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:00:41,379 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:00:41,379 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:00:41,385 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:41" (1/1) ... [2025-03-04 01:00:41,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:41" (1/1) ... [2025-03-04 01:00:41,392 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:41" (1/1) ... [2025-03-04 01:00:41,406 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-04 01:00:41,406 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:41" (1/1) ... [2025-03-04 01:00:41,406 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:41" (1/1) ... [2025-03-04 01:00:41,409 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:41" (1/1) ... [2025-03-04 01:00:41,410 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:41" (1/1) ... [2025-03-04 01:00:41,410 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:41" (1/1) ... [2025-03-04 01:00:41,411 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:41" (1/1) ... [2025-03-04 01:00:41,412 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:00:41,412 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:00:41,413 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:00:41,413 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:00:41,413 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:41" (1/1) ... [2025-03-04 01:00:41,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:00:41,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:00:41,446 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-04 01:00:41,452 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-04 01:00:41,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:00:41,468 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:00:41,468 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:00:41,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:00:41,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:00:41,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:00:41,519 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:00:41,521 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:00:41,693 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-04 01:00:41,693 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:00:41,700 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:00:41,700 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:00:41,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:00:41 BoogieIcfgContainer [2025-03-04 01:00:41,701 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:00:41,702 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:00:41,702 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:00:41,706 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:00:41,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:00:41" (1/3) ... [2025-03-04 01:00:41,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d1046ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:00:41, skipping insertion in model container [2025-03-04 01:00:41,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:41" (2/3) ... [2025-03-04 01:00:41,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d1046ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:00:41, skipping insertion in model container [2025-03-04 01:00:41,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:00:41" (3/3) ... [2025-03-04 01:00:41,708 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-93.i [2025-03-04 01:00:41,718 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:00:41,719 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-93.i that has 2 procedures, 46 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:00:41,765 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:00:41,775 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;@2c7103c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:00:41,775 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:00:41,779 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 30 states have internal predecessors, (38), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:00:41,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 01:00:41,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:00:41,788 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:00:41,789 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:00:41,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:00:41,794 INFO L85 PathProgramCache]: Analyzing trace with hash 950165967, now seen corresponding path program 1 times [2025-03-04 01:00:41,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:00:41,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091986411] [2025-03-04 01:00:41,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:00:41,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:00:41,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 01:00:41,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 01:00:41,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:00:41,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:00:42,017 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-04 01:00:42,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:00:42,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091986411] [2025-03-04 01:00:42,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091986411] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:00:42,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063358601] [2025-03-04 01:00:42,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:00:42,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:00:42,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:00:42,021 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-04 01:00:42,022 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-04 01:00:42,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 01:00:42,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 01:00:42,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:00:42,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:00:42,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:00:42,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:00:42,173 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-04 01:00:42,174 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:00:42,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063358601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:00:42,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:00:42,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:00:42,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983810575] [2025-03-04 01:00:42,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:00:42,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:00:42,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:00:42,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:00:42,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:00:42,199 INFO L87 Difference]: Start difference. First operand has 46 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 30 states have internal predecessors, (38), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:00:42,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:00:42,217 INFO L93 Difference]: Finished difference Result 86 states and 141 transitions. [2025-03-04 01:00:42,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:00:42,218 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 91 [2025-03-04 01:00:42,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:00:42,223 INFO L225 Difference]: With dead ends: 86 [2025-03-04 01:00:42,223 INFO L226 Difference]: Without dead ends: 43 [2025-03-04 01:00:42,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 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-04 01:00:42,229 INFO L435 NwaCegarLoop]: 61 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, 61 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-04 01:00:42,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:00:42,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-04 01:00:42,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-04 01:00:42,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:00:42,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2025-03-04 01:00:42,260 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 91 [2025-03-04 01:00:42,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:00:42,261 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2025-03-04 01:00:42,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:00:42,261 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2025-03-04 01:00:42,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 01:00:42,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:00:42,266 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:00:42,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 01:00:42,467 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-04 01:00:42,467 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:00:42,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:00:42,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1254558827, now seen corresponding path program 1 times [2025-03-04 01:00:42,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:00:42,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516585799] [2025-03-04 01:00:42,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:00:42,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:00:42,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 01:00:42,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 01:00:42,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:00:42,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:00:42,547 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:00:42,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 01:00:42,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 01:00:42,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:00:42,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:00:42,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:00:42,644 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:00:42,645 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:00:42,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:00:42,649 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 01:00:42,696 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:00:42,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:00:42 BoogieIcfgContainer [2025-03-04 01:00:42,702 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:00:42,702 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:00:42,703 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:00:42,703 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:00:42,703 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:00:41" (3/4) ... [2025-03-04 01:00:42,705 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:00:42,706 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:00:42,707 INFO L158 Benchmark]: Toolchain (without parser) took 1575.43ms. Allocated memory is still 142.6MB. Free memory was 106.8MB in the beginning and 96.1MB in the end (delta: 10.8MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2025-03-04 01:00:42,708 INFO L158 Benchmark]: CDTParser took 0.76ms. Allocated memory is still 201.3MB. Free memory is still 128.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:00:42,708 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.79ms. Allocated memory is still 142.6MB. Free memory was 106.8MB in the beginning and 94.3MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:00:42,708 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.98ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 92.6MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:00:42,709 INFO L158 Benchmark]: Boogie Preprocessor took 33.52ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 90.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:00:42,709 INFO L158 Benchmark]: IcfgBuilder took 288.18ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 76.8MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:00:42,710 INFO L158 Benchmark]: TraceAbstraction took 999.56ms. Allocated memory is still 142.6MB. Free memory was 75.9MB in the beginning and 96.1MB in the end (delta: -20.2MB). Peak memory consumption was 47.0MB. Max. memory is 16.1GB. [2025-03-04 01:00:42,711 INFO L158 Benchmark]: Witness Printer took 3.71ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 96.1MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:00:42,713 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.76ms. Allocated memory is still 201.3MB. Free memory is still 128.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 211.79ms. Allocated memory is still 142.6MB. Free memory was 106.8MB in the beginning and 94.3MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.98ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 92.6MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.52ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 90.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 288.18ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 76.8MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 999.56ms. Allocated memory is still 142.6MB. Free memory was 75.9MB in the beginning and 96.1MB in the end (delta: -20.2MB). Peak memory consumption was 47.0MB. Max. memory is 16.1GB. * Witness Printer took 3.71ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 96.1MB in the end (delta: 41.6kB). 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 74, overapproximation of someBinaryFLOATComparisonOperation at line 89, overapproximation of someUnaryDOUBLEoperation at line 23, overapproximation of someBinaryDOUBLEComparisonOperation at line 52, overapproximation of someBinaryDOUBLEComparisonOperation at line 63, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 38, overapproximation of someBinaryDOUBLEComparisonOperation at line 65, overapproximation of someBinaryDOUBLEComparisonOperation at line 62, overapproximation of someBinaryDOUBLEComparisonOperation at line 66, overapproximation of someBinaryDOUBLEComparisonOperation at line 70, overapproximation of someBinaryDOUBLEComparisonOperation at line 47. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 255.3; [L23] double var_1_3 = -0.9; [L24] double var_1_5 = 128.5; [L25] double var_1_6 = 9.186; [L26] double var_1_7 = 31.75; [L27] double var_1_8 = 9.6; [L28] float var_1_9 = 499.2; [L29] float var_1_10 = 1.5; [L30] unsigned char var_1_11 = 0; [L31] unsigned char var_1_12 = 1; [L32] unsigned char var_1_13 = 0; [L33] unsigned char var_1_14 = 1; [L34] float last_1_var_1_10 = 1.5; VAL [isInitial=0, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10, var_1_5=257/2, var_1_6=4593/500, var_1_7=127/4, var_1_8=48/5, var_1_9=2496/5] [L93] isInitial = 1 [L94] FCALL initially() [L95] COND TRUE 1 [L96] CALL updateLastVariables() [L86] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10, var_1_5=257/2, var_1_6=4593/500, var_1_7=127/4, var_1_8=48/5, var_1_9=2496/5] [L96] RET updateLastVariables() [L97] CALL updateVariables() [L61] var_1_3 = __VERIFIER_nondet_double() [L62] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10, var_1_5=257/2, var_1_6=4593/500, var_1_7=127/4, var_1_8=48/5, var_1_9=2496/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10, var_1_5=257/2, var_1_6=4593/500, var_1_7=127/4, var_1_8=48/5, var_1_9=2496/5] [L62] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10, var_1_5=257/2, var_1_6=4593/500, var_1_7=127/4, var_1_8=48/5, var_1_9=2496/5] [L63] CALL assume_abort_if_not(var_1_3 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10, var_1_5=257/2, var_1_6=4593/500, var_1_7=127/4, var_1_8=48/5, var_1_9=2496/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10, var_1_5=257/2, var_1_6=4593/500, var_1_7=127/4, var_1_8=48/5, var_1_9=2496/5] [L63] RET assume_abort_if_not(var_1_3 != 0.0F) VAL [isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10, var_1_5=257/2, var_1_6=4593/500, var_1_7=127/4, var_1_8=48/5, var_1_9=2496/5] [L64] var_1_5 = __VERIFIER_nondet_double() [L65] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10, var_1_6=4593/500, var_1_7=127/4, var_1_8=48/5, var_1_9=2496/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10, var_1_6=4593/500, var_1_7=127/4, var_1_8=48/5, var_1_9=2496/5] [L65] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10, var_1_6=4593/500, var_1_7=127/4, var_1_8=48/5, var_1_9=2496/5] [L66] CALL assume_abort_if_not(var_1_5 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10, var_1_6=4593/500, var_1_7=127/4, var_1_8=48/5, var_1_9=2496/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10, var_1_6=4593/500, var_1_7=127/4, var_1_8=48/5, var_1_9=2496/5] [L66] RET assume_abort_if_not(var_1_5 != 0.0F) VAL [isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10, var_1_6=4593/500, var_1_7=127/4, var_1_8=48/5, var_1_9=2496/5] [L67] var_1_6 = __VERIFIER_nondet_double() [L68] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10, var_1_7=127/4, var_1_8=48/5, var_1_9=2496/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10, var_1_7=127/4, var_1_8=48/5, var_1_9=2496/5] [L68] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10, var_1_7=127/4, var_1_8=48/5, var_1_9=2496/5] [L69] var_1_7 = __VERIFIER_nondet_double() [L70] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10, var_1_8=48/5, var_1_9=2496/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10, var_1_8=48/5, var_1_9=2496/5] [L70] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10, var_1_8=48/5, var_1_9=2496/5] [L71] var_1_8 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10, var_1_9=2496/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10, var_1_9=2496/5] [L72] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10, var_1_9=2496/5] [L73] var_1_9 = __VERIFIER_nondet_float() [L74] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10] [L74] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10] [L75] var_1_12 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_13=0, var_1_14=1, var_1_1=2553/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_13=0, var_1_14=1, var_1_1=2553/10] [L76] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_13=0, var_1_14=1, var_1_1=2553/10] [L77] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10] [L77] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10] [L78] var_1_13 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_14=1, var_1_1=2553/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_14=1, var_1_1=2553/10] [L79] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_14=1, var_1_1=2553/10] [L80] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10] [L80] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10] [L81] var_1_14 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10] [L82] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10] [L83] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10] [L83] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=2553/10] [L97] RET updateVariables() [L98] CALL step() [L38] COND FALSE !(((- last_1_var_1_10) / var_1_3) != (last_1_var_1_10 / var_1_5)) [L45] var_1_1 = 64.51f VAL [isInitial=1, last_1_var_1_10=3/2, var_1_10=3/2, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=6451/100] [L47] COND TRUE var_1_1 > (((((var_1_9 * 128.4)) > ((var_1_5 * var_1_1))) ? ((var_1_9 * 128.4)) : ((var_1_5 * var_1_1)))) [L48] var_1_10 = 1.00000000000004E13f VAL [isInitial=1, last_1_var_1_10=3/2, var_1_10=50000000000002/5, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=6451/100] [L52] COND TRUE ! (var_1_3 <= var_1_10) [L53] var_1_11 = (var_1_12 && var_1_13) VAL [isInitial=1, last_1_var_1_10=3/2, var_1_10=50000000000002/5, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=6451/100] [L98] RET step() [L99] CALL, EXPR property() [L89-L90] return (((((- last_1_var_1_10) / var_1_3) != (last_1_var_1_10 / var_1_5)) ? ((last_1_var_1_10 != (((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))) - var_1_8)) ? (var_1_1 == ((float) var_1_9)) : (var_1_1 == ((float) var_1_9))) : (var_1_1 == ((float) 64.51f))) && ((var_1_1 > (((((var_1_9 * 128.4)) > ((var_1_5 * var_1_1))) ? ((var_1_9 * 128.4)) : ((var_1_5 * var_1_1))))) ? (var_1_10 == ((float) 1.00000000000004E13f)) : (var_1_10 == ((float) var_1_9)))) && ((! (var_1_3 <= var_1_10)) ? (var_1_11 == ((unsigned char) (var_1_12 && var_1_13))) : (((var_1_7 / var_1_3) < ((((((((var_1_8) > (var_1_6)) ? (var_1_8) : (var_1_6)))) < (var_1_5)) ? (((((var_1_8) > (var_1_6)) ? (var_1_8) : (var_1_6)))) : (var_1_5)))) ? (var_1_11 == ((unsigned char) var_1_14)) : 1)) ; VAL [\result=0, isInitial=1, last_1_var_1_10=3/2, var_1_10=50000000000002/5, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=6451/100] [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=3/2, var_1_10=50000000000002/5, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=6451/100] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=3/2, var_1_10=50000000000002/5, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=6451/100] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 61 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 61 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 273 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 180 SizeOfPredicates, 0 NumberOfNonLiveVariables, 210 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 702/728 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-04 01:00:42,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-93.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 2d9182cedd229d548c201f82860145814c664e2f98d8085b9b53829346d05f25 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:00:44,605 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:00:44,690 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:00:44,696 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:00:44,697 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:00:44,712 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:00:44,713 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:00:44,713 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:00:44,713 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:00:44,713 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:00:44,713 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:00:44,713 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:00:44,713 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:00:44,713 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:00:44,714 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:00:44,714 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:00:44,714 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:00:44,714 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:00:44,714 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:00:44,714 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:00:44,714 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:00:44,714 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:00:44,714 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:00:44,714 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:00:44,714 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:00:44,714 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:00:44,714 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:00:44,714 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:00:44,714 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:00:44,714 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:00:44,714 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:00:44,714 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:00:44,715 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:00:44,715 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:00:44,715 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:00:44,715 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:00:44,715 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:00:44,715 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:00:44,715 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:00:44,715 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:00:44,715 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:00:44,715 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:00:44,715 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:00:44,715 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:00:44,715 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:00:44,715 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 -> 2d9182cedd229d548c201f82860145814c664e2f98d8085b9b53829346d05f25 [2025-03-04 01:00:44,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:00:44,970 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:00:44,973 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:00:44,974 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:00:44,974 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:00:44,975 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-93.i [2025-03-04 01:00:46,139 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf653f71c/ecf948e8112347228ddb306595dd89e4/FLAG9a1285eba [2025-03-04 01:00:46,340 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:00:46,341 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-93.i [2025-03-04 01:00:46,349 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf653f71c/ecf948e8112347228ddb306595dd89e4/FLAG9a1285eba [2025-03-04 01:00:46,362 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf653f71c/ecf948e8112347228ddb306595dd89e4 [2025-03-04 01:00:46,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:00:46,365 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:00:46,366 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:00:46,366 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:00:46,370 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:00:46,370 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:00:46" (1/1) ... [2025-03-04 01:00:46,371 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dcef432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:46, skipping insertion in model container [2025-03-04 01:00:46,371 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:00:46" (1/1) ... [2025-03-04 01:00:46,387 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:00:46,501 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-93.i[913,926] [2025-03-04 01:00:46,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:00:46,563 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:00:46,572 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-93.i[913,926] [2025-03-04 01:00:46,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:00:46,605 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:00:46,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:46 WrapperNode [2025-03-04 01:00:46,607 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:00:46,607 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:00:46,608 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:00:46,608 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:00:46,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:46" (1/1) ... [2025-03-04 01:00:46,624 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:46" (1/1) ... [2025-03-04 01:00:46,641 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 98 [2025-03-04 01:00:46,642 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:00:46,643 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:00:46,643 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:00:46,643 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:00:46,648 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:46" (1/1) ... [2025-03-04 01:00:46,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:46" (1/1) ... [2025-03-04 01:00:46,650 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:46" (1/1) ... [2025-03-04 01:00:46,658 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-04 01:00:46,658 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:46" (1/1) ... [2025-03-04 01:00:46,658 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:46" (1/1) ... [2025-03-04 01:00:46,664 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:46" (1/1) ... [2025-03-04 01:00:46,664 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:46" (1/1) ... [2025-03-04 01:00:46,666 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:46" (1/1) ... [2025-03-04 01:00:46,666 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:46" (1/1) ... [2025-03-04 01:00:46,668 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:00:46,668 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:00:46,668 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:00:46,669 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:00:46,669 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:46" (1/1) ... [2025-03-04 01:00:46,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:00:46,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:00:46,703 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-04 01:00:46,706 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-04 01:00:46,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:00:46,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:00:46,722 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:00:46,722 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:00:46,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:00:46,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:00:46,773 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:00:46,775 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:01:20,840 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-04 01:01:20,841 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:01:20,849 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:01:20,849 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:01:20,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:01:20 BoogieIcfgContainer [2025-03-04 01:01:20,850 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:01:20,852 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:01:20,852 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:01:20,856 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:01:20,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:00:46" (1/3) ... [2025-03-04 01:01:20,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75cfac81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:01:20, skipping insertion in model container [2025-03-04 01:01:20,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:00:46" (2/3) ... [2025-03-04 01:01:20,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75cfac81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:01:20, skipping insertion in model container [2025-03-04 01:01:20,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:01:20" (3/3) ... [2025-03-04 01:01:20,858 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-93.i [2025-03-04 01:01:20,868 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:01:20,869 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-93.i that has 2 procedures, 46 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:01:20,903 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:01:20,913 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;@3274bfbe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:01:20,913 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:01:20,918 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 30 states have internal predecessors, (38), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:01:20,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 01:01:20,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:01:20,925 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:01:20,926 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:01:20,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:01:20,931 INFO L85 PathProgramCache]: Analyzing trace with hash 950165967, now seen corresponding path program 1 times [2025-03-04 01:01:20,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:01:20,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1557110230] [2025-03-04 01:01:20,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:01:20,943 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-04 01:01:20,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:01:20,948 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-04 01:01:20,950 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-04 01:01:21,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 01:01:23,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 01:01:23,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:01:23,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:01:23,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:01:23,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:01:23,305 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2025-03-04 01:01:23,305 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:01:23,306 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:01:23,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1557110230] [2025-03-04 01:01:23,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1557110230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:01:23,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:01:23,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:01:23,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494188119] [2025-03-04 01:01:23,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:01:23,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:01:23,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:01:23,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:01:23,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:01:23,327 INFO L87 Difference]: Start difference. First operand has 46 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 30 states have internal predecessors, (38), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:01:23,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:01:23,346 INFO L93 Difference]: Finished difference Result 86 states and 141 transitions. [2025-03-04 01:01:23,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:01:23,348 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 91 [2025-03-04 01:01:23,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:01:23,352 INFO L225 Difference]: With dead ends: 86 [2025-03-04 01:01:23,352 INFO L226 Difference]: Without dead ends: 43 [2025-03-04 01:01:23,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 90 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-04 01:01:23,358 INFO L435 NwaCegarLoop]: 61 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, 61 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-04 01:01:23,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:01:23,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-04 01:01:23,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-04 01:01:23,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:01:23,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2025-03-04 01:01:23,408 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 91 [2025-03-04 01:01:23,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:01:23,409 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2025-03-04 01:01:23,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:01:23,409 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2025-03-04 01:01:23,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 01:01:23,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:01:23,412 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:01:23,471 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-04 01:01:23,612 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-04 01:01:23,613 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:01:23,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:01:23,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1254558827, now seen corresponding path program 1 times [2025-03-04 01:01:23,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:01:23,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1444796605] [2025-03-04 01:01:23,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:01:23,614 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-04 01:01:23,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:01:23,618 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-04 01:01:23,619 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-04 01:01:23,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 01:01:25,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 01:01:25,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:01:25,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:01:26,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 01:01:26,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:01:43,089 WARN L286 SmtUtils]: Spent 8.40s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 01:01:51,707 WARN L286 SmtUtils]: Spent 8.62s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 01:02:00,821 WARN L286 SmtUtils]: Spent 9.11s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 01:02:05,020 WARN L851 $PredicateComparison]: unable to prove that (and (fp.eq (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (fp.neg c_~last_1_var_1_10~0)) c_~var_1_3~0) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~last_1_var_1_10~0) c_~var_1_5~0)) (= c_~var_1_1~0 ((_ to_fp 8 24) c_currentRoundingMode (/ 6451.0 100.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2025-03-04 01:02:09,331 WARN L873 $PredicateComparison]: unable to prove that (and (fp.eq (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (fp.neg c_~last_1_var_1_10~0)) c_~var_1_3~0) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~last_1_var_1_10~0) c_~var_1_5~0)) (= c_~var_1_1~0 ((_ to_fp 8 24) c_currentRoundingMode (/ 6451.0 100.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2025-03-04 01:02:17,780 WARN L286 SmtUtils]: Spent 8.44s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 01:02:26,516 WARN L286 SmtUtils]: Spent 8.73s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)