./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-54.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-54.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 3a25dd997c8fa9a929b53027dc2df9242a939d9c39053d10361ef45987787161 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:55:56,323 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:55:56,384 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:55:56,390 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:55:56,390 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:55:56,411 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:55:56,412 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:55:56,412 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:55:56,412 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:55:56,412 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:55:56,413 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:55:56,413 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:55:56,414 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:55:56,414 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:55:56,414 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:55:56,414 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:55:56,414 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:55:56,414 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:55:56,415 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:55:56,415 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:55:56,415 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:55:56,415 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:55:56,415 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:55:56,415 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:55:56,415 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:55:56,415 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:55:56,415 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:55:56,415 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:55:56,415 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:55:56,415 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:55:56,416 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:55:56,416 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:55:56,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:55:56,416 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:55:56,416 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:55:56,416 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:55:56,416 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:55:56,417 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:55:56,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:55:56,417 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:55:56,417 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:55:56,417 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:55:56,417 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:55:56,417 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 -> 3a25dd997c8fa9a929b53027dc2df9242a939d9c39053d10361ef45987787161 [2025-03-04 00:55:56,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:55:56,686 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:55:56,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:55:56,689 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:55:56,690 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:55:56,691 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-54.i [2025-03-04 00:55:57,939 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddb0a512f/d4b9c56f17c64e9785341a1b778d1cd4/FLAG430a9aec9 [2025-03-04 00:55:58,152 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:55:58,153 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-54.i [2025-03-04 00:55:58,159 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddb0a512f/d4b9c56f17c64e9785341a1b778d1cd4/FLAG430a9aec9 [2025-03-04 00:55:58,170 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddb0a512f/d4b9c56f17c64e9785341a1b778d1cd4 [2025-03-04 00:55:58,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:55:58,173 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:55:58,174 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:55:58,175 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:55:58,179 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:55:58,180 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:55:58" (1/1) ... [2025-03-04 00:55:58,181 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@781d8a73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:58, skipping insertion in model container [2025-03-04 00:55:58,182 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:55:58" (1/1) ... [2025-03-04 00:55:58,194 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:55:58,287 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-54.i[913,926] [2025-03-04 00:55:58,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:55:58,332 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:55:58,341 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-54.i[913,926] [2025-03-04 00:55:58,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:55:58,375 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:55:58,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:58 WrapperNode [2025-03-04 00:55:58,376 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:55:58,377 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:55:58,377 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:55:58,377 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:55:58,382 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:58" (1/1) ... [2025-03-04 00:55:58,392 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:58" (1/1) ... [2025-03-04 00:55:58,418 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 96 [2025-03-04 00:55:58,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:55:58,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:55:58,419 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:55:58,419 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:55:58,432 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:58" (1/1) ... [2025-03-04 00:55:58,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:58" (1/1) ... [2025-03-04 00:55:58,435 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:58" (1/1) ... [2025-03-04 00:55:58,449 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 00:55:58,450 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:58" (1/1) ... [2025-03-04 00:55:58,450 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:58" (1/1) ... [2025-03-04 00:55:58,454 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:58" (1/1) ... [2025-03-04 00:55:58,457 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:58" (1/1) ... [2025-03-04 00:55:58,458 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:58" (1/1) ... [2025-03-04 00:55:58,458 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:58" (1/1) ... [2025-03-04 00:55:58,459 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:55:58,460 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:55:58,460 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:55:58,460 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:55:58,465 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:58" (1/1) ... [2025-03-04 00:55:58,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:55:58,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:55:58,492 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 00:55:58,494 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 00:55:58,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:55:58,513 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:55:58,513 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:55:58,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:55:58,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:55:58,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:55:58,568 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:55:58,570 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:55:58,751 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-04 00:55:58,751 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:55:58,759 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:55:58,759 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:55:58,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:55:58 BoogieIcfgContainer [2025-03-04 00:55:58,760 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:55:58,762 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:55:58,762 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:55:58,765 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:55:58,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:55:58" (1/3) ... [2025-03-04 00:55:58,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4121f956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:55:58, skipping insertion in model container [2025-03-04 00:55:58,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:55:58" (2/3) ... [2025-03-04 00:55:58,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4121f956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:55:58, skipping insertion in model container [2025-03-04 00:55:58,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:55:58" (3/3) ... [2025-03-04 00:55:58,768 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-54.i [2025-03-04 00:55:58,779 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:55:58,781 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-54.i that has 2 procedures, 46 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:55:58,829 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:55:58,837 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;@460b3ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:55:58,838 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:55:58,843 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 00:55:58,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-04 00:55:58,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:55:58,849 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:55:58,850 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:55:58,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:55:58,854 INFO L85 PathProgramCache]: Analyzing trace with hash -2145083144, now seen corresponding path program 1 times [2025-03-04 00:55:58,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:55:58,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071692831] [2025-03-04 00:55:58,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:55:58,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:55:58,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 00:55:58,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 00:55:58,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:55:58,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:55:59,059 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-04 00:55:59,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:55:59,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071692831] [2025-03-04 00:55:59,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071692831] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:55:59,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010714749] [2025-03-04 00:55:59,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:55:59,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:55:59,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:55:59,062 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 00:55:59,064 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 00:55:59,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 00:55:59,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 00:55:59,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:55:59,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:55:59,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:55:59,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:55:59,183 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-04 00:55:59,183 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:55:59,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010714749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:55:59,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:55:59,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:55:59,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541770814] [2025-03-04 00:55:59,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:55:59,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:55:59,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:55:59,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:55:59,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:55:59,204 INFO L87 Difference]: Start difference. First operand has 46 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 00:55:59,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:55:59,218 INFO L93 Difference]: Finished difference Result 86 states and 139 transitions. [2025-03-04 00:55:59,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:55:59,220 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 81 [2025-03-04 00:55:59,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:55:59,224 INFO L225 Difference]: With dead ends: 86 [2025-03-04 00:55:59,224 INFO L226 Difference]: Without dead ends: 43 [2025-03-04 00:55:59,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 82 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 00:55:59,228 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 00:55:59,228 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 00:55:59,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-04 00:55:59,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-04 00:55:59,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 00:55:59,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2025-03-04 00:55:59,252 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 81 [2025-03-04 00:55:59,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:55:59,252 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2025-03-04 00:55:59,253 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 00:55:59,253 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2025-03-04 00:55:59,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-04 00:55:59,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:55:59,255 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:55:59,262 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 00:55:59,459 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 00:55:59,459 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:55:59,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:55:59,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1616448534, now seen corresponding path program 1 times [2025-03-04 00:55:59,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:55:59,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651443654] [2025-03-04 00:55:59,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:55:59,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:55:59,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 00:55:59,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 00:55:59,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:55:59,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:55:59,574 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:55:59,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 00:55:59,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 00:55:59,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:55:59,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:55:59,670 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:55:59,670 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:55:59,671 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:55:59,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:55:59,674 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 00:55:59,720 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:55:59,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:55:59 BoogieIcfgContainer [2025-03-04 00:55:59,723 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:55:59,723 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:55:59,723 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:55:59,723 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:55:59,724 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:55:58" (3/4) ... [2025-03-04 00:55:59,726 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:55:59,726 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:55:59,727 INFO L158 Benchmark]: Toolchain (without parser) took 1553.34ms. Allocated memory is still 167.8MB. Free memory was 133.5MB in the beginning and 46.3MB in the end (delta: 87.3MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. [2025-03-04 00:55:59,727 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:55:59,727 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.95ms. Allocated memory is still 167.8MB. Free memory was 133.5MB in the beginning and 120.8MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:55:59,727 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.26ms. Allocated memory is still 167.8MB. Free memory was 120.8MB in the beginning and 118.7MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:55:59,727 INFO L158 Benchmark]: Boogie Preprocessor took 40.84ms. Allocated memory is still 167.8MB. Free memory was 118.7MB in the beginning and 116.2MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:55:59,728 INFO L158 Benchmark]: IcfgBuilder took 300.08ms. Allocated memory is still 167.8MB. Free memory was 116.2MB in the beginning and 100.2MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:55:59,728 INFO L158 Benchmark]: TraceAbstraction took 961.23ms. Allocated memory is still 167.8MB. Free memory was 99.4MB in the beginning and 46.3MB in the end (delta: 53.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-04 00:55:59,728 INFO L158 Benchmark]: Witness Printer took 2.84ms. Allocated memory is still 167.8MB. Free memory is still 46.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:55:59,729 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 201.95ms. Allocated memory is still 167.8MB. Free memory was 133.5MB in the beginning and 120.8MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.26ms. Allocated memory is still 167.8MB. Free memory was 120.8MB in the beginning and 118.7MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.84ms. Allocated memory is still 167.8MB. Free memory was 118.7MB in the beginning and 116.2MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 300.08ms. Allocated memory is still 167.8MB. Free memory was 116.2MB in the beginning and 100.2MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 961.23ms. Allocated memory is still 167.8MB. Free memory was 99.4MB in the beginning and 46.3MB in the end (delta: 53.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Witness Printer took 2.84ms. Allocated memory is still 167.8MB. Free memory is still 46.3MB. 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 92, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 92, overapproximation of someBinaryDOUBLEComparisonOperation at line 84. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 16; [L23] unsigned char var_1_3 = 10; [L24] unsigned char var_1_4 = 0; [L25] unsigned char var_1_6 = 1; [L26] unsigned char var_1_9 = 0; [L27] unsigned char var_1_10 = 0; [L28] double var_1_11 = 9.75; [L29] double var_1_12 = 5.5; [L30] double var_1_13 = 4.1; [L31] float var_1_14 = 9.8; [L32] signed char var_1_15 = 25; [L33] signed char var_1_16 = 2; VAL [isInitial=0, var_1_10=0, var_1_11=39/4, var_1_12=11/2, var_1_13=41/10, var_1_14=49/5, var_1_15=25, var_1_16=2, var_1_1=16, var_1_3=10, var_1_4=0, var_1_6=1, var_1_9=0] [L96] isInitial = 1 [L97] FCALL initially() [L98] COND TRUE 1 [L99] FCALL updateLastVariables() [L100] CALL updateVariables() [L69] var_1_3 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=39/4, var_1_12=11/2, var_1_13=41/10, var_1_14=49/5, var_1_15=25, var_1_16=2, var_1_1=16, var_1_4=0, var_1_6=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=39/4, var_1_12=11/2, var_1_13=41/10, var_1_14=49/5, var_1_15=25, var_1_16=2, var_1_1=16, var_1_4=0, var_1_6=1, var_1_9=0] [L70] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=39/4, var_1_12=11/2, var_1_13=41/10, var_1_14=49/5, var_1_15=25, var_1_16=2, var_1_1=16, var_1_4=0, var_1_6=1, var_1_9=0] [L71] CALL assume_abort_if_not(var_1_3 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=39/4, var_1_12=11/2, var_1_13=41/10, var_1_14=49/5, var_1_15=25, var_1_16=2, var_1_1=16, var_1_3=-2, var_1_4=0, var_1_6=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=39/4, var_1_12=11/2, var_1_13=41/10, var_1_14=49/5, var_1_15=25, var_1_16=2, var_1_1=16, var_1_3=-2, var_1_4=0, var_1_6=1, var_1_9=0] [L71] RET assume_abort_if_not(var_1_3 <= 254) VAL [isInitial=1, var_1_10=0, var_1_11=39/4, var_1_12=11/2, var_1_13=41/10, var_1_14=49/5, var_1_15=25, var_1_16=2, var_1_1=16, var_1_3=-2, var_1_4=0, var_1_6=1, var_1_9=0] [L72] var_1_6 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=39/4, var_1_12=11/2, var_1_13=41/10, var_1_14=49/5, var_1_15=25, var_1_16=2, var_1_1=16, var_1_3=-2, var_1_4=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=39/4, var_1_12=11/2, var_1_13=41/10, var_1_14=49/5, var_1_15=25, var_1_16=2, var_1_1=16, var_1_3=-2, var_1_4=0, var_1_9=0] [L73] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=39/4, var_1_12=11/2, var_1_13=41/10, var_1_14=49/5, var_1_15=25, var_1_16=2, var_1_1=16, var_1_3=-2, var_1_4=0, var_1_9=0] [L74] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=39/4, var_1_12=11/2, var_1_13=41/10, var_1_14=49/5, var_1_15=25, var_1_16=2, var_1_1=16, var_1_3=-2, var_1_4=0, var_1_6=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=39/4, var_1_12=11/2, var_1_13=41/10, var_1_14=49/5, var_1_15=25, var_1_16=2, var_1_1=16, var_1_3=-2, var_1_4=0, var_1_6=1, var_1_9=0] [L74] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=39/4, var_1_12=11/2, var_1_13=41/10, var_1_14=49/5, var_1_15=25, var_1_16=2, var_1_1=16, var_1_3=-2, var_1_4=0, var_1_6=1, var_1_9=0] [L75] var_1_9 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=39/4, var_1_12=11/2, var_1_13=41/10, var_1_14=49/5, var_1_15=25, var_1_16=2, var_1_1=16, var_1_3=-2, var_1_4=0, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=39/4, var_1_12=11/2, var_1_13=41/10, var_1_14=49/5, var_1_15=25, var_1_16=2, var_1_1=16, var_1_3=-2, var_1_4=0, var_1_6=1] [L76] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=39/4, var_1_12=11/2, var_1_13=41/10, var_1_14=49/5, var_1_15=25, var_1_16=2, var_1_1=16, var_1_3=-2, var_1_4=0, var_1_6=1] [L77] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=39/4, var_1_12=11/2, var_1_13=41/10, var_1_14=49/5, var_1_15=25, var_1_16=2, var_1_1=16, var_1_3=-2, var_1_4=0, var_1_6=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=39/4, var_1_12=11/2, var_1_13=41/10, var_1_14=49/5, var_1_15=25, var_1_16=2, var_1_1=16, var_1_3=-2, var_1_4=0, var_1_6=1, var_1_9=0] [L77] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=39/4, var_1_12=11/2, var_1_13=41/10, var_1_14=49/5, var_1_15=25, var_1_16=2, var_1_1=16, var_1_3=-2, var_1_4=0, var_1_6=1, var_1_9=0] [L78] var_1_10 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_11=39/4, var_1_12=11/2, var_1_13=41/10, var_1_14=49/5, var_1_15=25, var_1_16=2, var_1_1=16, var_1_3=-2, var_1_4=0, var_1_6=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_11=39/4, var_1_12=11/2, var_1_13=41/10, var_1_14=49/5, var_1_15=25, var_1_16=2, var_1_1=16, var_1_3=-2, var_1_4=0, var_1_6=1, var_1_9=0] [L79] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, var_1_10=-255, var_1_11=39/4, var_1_12=11/2, var_1_13=41/10, var_1_14=49/5, var_1_15=25, var_1_16=2, var_1_1=16, var_1_3=-2, var_1_4=0, var_1_6=1, var_1_9=0] [L80] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_11=39/4, var_1_12=11/2, var_1_13=41/10, var_1_14=49/5, var_1_15=25, var_1_16=2, var_1_1=16, var_1_3=-2, var_1_4=0, var_1_6=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_11=39/4, var_1_12=11/2, var_1_13=41/10, var_1_14=49/5, var_1_15=25, var_1_16=2, var_1_1=16, var_1_3=-2, var_1_4=0, var_1_6=1, var_1_9=0] [L80] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=-255, var_1_11=39/4, var_1_12=11/2, var_1_13=41/10, var_1_14=49/5, var_1_15=25, var_1_16=2, var_1_1=16, var_1_3=-2, var_1_4=0, var_1_6=1, var_1_9=0] [L81] var_1_12 = __VERIFIER_nondet_double() [L82] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_11=39/4, var_1_13=41/10, var_1_14=49/5, var_1_15=25, var_1_16=2, var_1_1=16, var_1_3=-2, var_1_4=0, var_1_6=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_11=39/4, var_1_13=41/10, var_1_14=49/5, var_1_15=25, var_1_16=2, var_1_1=16, var_1_3=-2, var_1_4=0, var_1_6=1, var_1_9=0] [L82] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-255, var_1_11=39/4, var_1_13=41/10, var_1_14=49/5, var_1_15=25, var_1_16=2, var_1_1=16, var_1_3=-2, var_1_4=0, var_1_6=1, var_1_9=0] [L83] var_1_13 = __VERIFIER_nondet_double() [L84] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_11=39/4, var_1_14=49/5, var_1_15=25, var_1_16=2, var_1_1=16, var_1_3=-2, var_1_4=0, var_1_6=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_11=39/4, var_1_14=49/5, var_1_15=25, var_1_16=2, var_1_1=16, var_1_3=-2, var_1_4=0, var_1_6=1, var_1_9=0] [L84] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-255, var_1_11=39/4, var_1_14=49/5, var_1_15=25, var_1_16=2, var_1_1=16, var_1_3=-2, var_1_4=0, var_1_6=1, var_1_9=0] [L85] var_1_16 = __VERIFIER_nondet_char() [L86] CALL assume_abort_if_not(var_1_16 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_11=39/4, var_1_14=49/5, var_1_15=25, var_1_16=-4, var_1_1=16, var_1_3=-2, var_1_4=0, var_1_6=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_11=39/4, var_1_14=49/5, var_1_15=25, var_1_16=-4, var_1_1=16, var_1_3=-2, var_1_4=0, var_1_6=1, var_1_9=0] [L86] RET assume_abort_if_not(var_1_16 >= -127) VAL [isInitial=1, var_1_10=-255, var_1_11=39/4, var_1_14=49/5, var_1_15=25, var_1_16=-4, var_1_1=16, var_1_3=-2, var_1_4=0, var_1_6=1, var_1_9=0] [L87] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_11=39/4, var_1_14=49/5, var_1_15=25, var_1_16=-4, var_1_1=16, var_1_3=-2, var_1_4=0, var_1_6=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-255, var_1_11=39/4, var_1_14=49/5, var_1_15=25, var_1_16=-4, var_1_1=16, var_1_3=-2, var_1_4=0, var_1_6=1, var_1_9=0] [L87] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, var_1_10=-255, var_1_11=39/4, var_1_14=49/5, var_1_15=25, var_1_16=-4, var_1_1=16, var_1_3=-2, var_1_4=0, var_1_6=1, var_1_9=0] [L100] RET updateVariables() [L101] CALL step() [L37] var_1_14 = var_1_12 [L38] var_1_15 = var_1_16 [L39] signed long int stepLocal_0 = -4; VAL [isInitial=1, stepLocal_0=-4, var_1_10=-255, var_1_11=39/4, var_1_12=259, var_1_14=259, var_1_15=-4, var_1_16=-4, var_1_1=16, var_1_3=-2, var_1_4=0, var_1_6=1, var_1_9=0] [L40] COND TRUE stepLocal_0 >= var_1_15 [L41] var_1_1 = ((((var_1_3) < (((((1) < 0 ) ? -(1) : (1))))) ? (var_1_3) : (((((1) < 0 ) ? -(1) : (1)))))) VAL [isInitial=1, var_1_10=-255, var_1_11=39/4, var_1_12=259, var_1_14=259, var_1_15=-4, var_1_16=-4, var_1_1=1, var_1_3=-2, var_1_4=0, var_1_6=1, var_1_9=0] [L43] unsigned char stepLocal_2 = var_1_3; VAL [isInitial=1, stepLocal_2=-2, var_1_10=-255, var_1_11=39/4, var_1_12=259, var_1_14=259, var_1_15=-4, var_1_16=-4, var_1_1=1, var_1_3=-2, var_1_4=0, var_1_6=1, var_1_9=0] [L44] COND FALSE !(\read(var_1_9)) VAL [isInitial=1, stepLocal_2=-2, var_1_10=-255, var_1_11=39/4, var_1_12=259, var_1_14=259, var_1_15=-4, var_1_16=-4, var_1_1=1, var_1_3=-2, var_1_4=0, var_1_6=1, var_1_9=0] [L53] signed long int stepLocal_1 = (((10) > (var_1_1)) ? (10) : (var_1_1)); VAL [isInitial=1, stepLocal_1=10, stepLocal_2=-2, var_1_10=-255, var_1_11=39/4, var_1_12=259, var_1_14=259, var_1_15=-4, var_1_16=-4, var_1_1=1, var_1_3=-2, var_1_4=0, var_1_6=1, var_1_9=0] [L54] COND FALSE !((8 * var_1_1) == stepLocal_1) [L65] var_1_4 = var_1_10 VAL [isInitial=1, stepLocal_2=-2, var_1_10=-255, var_1_11=39/4, var_1_12=259, var_1_14=259, var_1_15=-4, var_1_16=-4, var_1_1=1, var_1_3=-2, var_1_4=-255, var_1_6=1, var_1_9=0] [L101] RET step() [L102] CALL, EXPR property() [L92-L93] return (((((-4 >= var_1_15) ? (var_1_1 == ((unsigned char) ((((var_1_3) < (((((1) < 0 ) ? -(1) : (1))))) ? (var_1_3) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * var_1_1) == ((((10) > (var_1_1)) ? (10) : (var_1_1)))) ? (var_1_6 ? (var_1_4 == ((unsigned char) ((var_1_11 < var_1_14) && var_1_9))) : ((var_1_14 >= ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) ? (var_1_4 == ((unsigned char) (! var_1_9))) : (var_1_4 == ((unsigned char) 0)))) : (var_1_4 == ((unsigned char) var_1_10)))) && (var_1_9 ? ((var_1_3 > var_1_15) ? (var_1_11 == ((double) ((((((((var_1_12) > (16.5)) ? (var_1_12) : (16.5)))) > (var_1_13)) ? (((((var_1_12) > (16.5)) ? (var_1_12) : (16.5)))) : (var_1_13))))) : (var_1_10 ? (var_1_11 == ((double) var_1_12)) : 1)) : 1)) && (var_1_14 == ((float) var_1_12))) && (var_1_15 == ((signed char) var_1_16)) ; VAL [\result=0, isInitial=1, var_1_10=-255, var_1_11=39/4, var_1_12=259, var_1_14=259, var_1_15=-4, var_1_16=-4, var_1_1=1, var_1_3=-2, var_1_4=-255, var_1_6=1, var_1_9=0] [L102] RET, EXPR property() [L102] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-255, var_1_11=39/4, var_1_12=259, var_1_14=259, var_1_15=-4, var_1_16=-4, var_1_1=1, var_1_3=-2, var_1_4=-255, var_1_6=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=-255, var_1_11=39/4, var_1_12=259, var_1_14=259, var_1_15=-4, var_1_16=-4, var_1_1=1, var_1_3=-2, var_1_4=-255, var_1_6=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, 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, 82 GetRequests, 82 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.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 243 NumberOfCodeBlocks, 243 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 160 ConstructedInterpolants, 0 QuantifiedInterpolants, 160 SizeOfPredicates, 0 NumberOfNonLiveVariables, 198 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 506/528 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 00:55:59,744 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-54.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 3a25dd997c8fa9a929b53027dc2df9242a939d9c39053d10361ef45987787161 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:56:01,593 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:56:01,672 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:56:01,679 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:56:01,680 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:56:01,697 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:56:01,699 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:56:01,699 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:56:01,699 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:56:01,699 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:56:01,700 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:56:01,700 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:56:01,700 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:56:01,700 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:56:01,700 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:56:01,701 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:56:01,701 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:56:01,701 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:56:01,701 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:56:01,701 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:56:01,701 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:56:01,701 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:56:01,701 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:56:01,701 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:56:01,701 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:56:01,701 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:56:01,701 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:56:01,701 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:56:01,701 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:56:01,701 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:56:01,701 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:56:01,701 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:56:01,701 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:56:01,701 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:56:01,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:56:01,702 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:56:01,702 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:56:01,702 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:56:01,702 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:56:01,702 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:56:01,702 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:56:01,702 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:56:01,702 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:56:01,702 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:56:01,702 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:56:01,702 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 -> 3a25dd997c8fa9a929b53027dc2df9242a939d9c39053d10361ef45987787161 [2025-03-04 00:56:01,925 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:56:01,931 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:56:01,932 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:56:01,933 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:56:01,933 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:56:01,934 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-54.i [2025-03-04 00:56:03,090 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7d3afd47/bfcf360157664225a23c7c82d45808bf/FLAGb759bd3ee [2025-03-04 00:56:03,294 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:56:03,295 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-54.i [2025-03-04 00:56:03,302 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7d3afd47/bfcf360157664225a23c7c82d45808bf/FLAGb759bd3ee [2025-03-04 00:56:03,657 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7d3afd47/bfcf360157664225a23c7c82d45808bf [2025-03-04 00:56:03,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:56:03,660 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:56:03,661 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:56:03,661 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:56:03,665 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:56:03,665 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:56:03" (1/1) ... [2025-03-04 00:56:03,666 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@154a91bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:03, skipping insertion in model container [2025-03-04 00:56:03,666 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:56:03" (1/1) ... [2025-03-04 00:56:03,678 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:56:03,773 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-54.i[913,926] [2025-03-04 00:56:03,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:56:03,830 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:56:03,839 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-54.i[913,926] [2025-03-04 00:56:03,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:56:03,869 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:56:03,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:03 WrapperNode [2025-03-04 00:56:03,871 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:56:03,872 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:56:03,872 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:56:03,872 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:56:03,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:03" (1/1) ... [2025-03-04 00:56:03,891 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:03" (1/1) ... [2025-03-04 00:56:03,905 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 95 [2025-03-04 00:56:03,906 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:56:03,906 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:56:03,906 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:56:03,906 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:56:03,912 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:03" (1/1) ... [2025-03-04 00:56:03,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:03" (1/1) ... [2025-03-04 00:56:03,914 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:03" (1/1) ... [2025-03-04 00:56:03,922 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 00:56:03,922 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:03" (1/1) ... [2025-03-04 00:56:03,922 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:03" (1/1) ... [2025-03-04 00:56:03,928 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:03" (1/1) ... [2025-03-04 00:56:03,928 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:03" (1/1) ... [2025-03-04 00:56:03,930 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:03" (1/1) ... [2025-03-04 00:56:03,930 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:03" (1/1) ... [2025-03-04 00:56:03,932 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:56:03,933 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:56:03,933 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:56:03,933 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:56:03,933 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:03" (1/1) ... [2025-03-04 00:56:03,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:56:03,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:56:03,961 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 00:56:03,964 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 00:56:03,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:56:03,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:56:03,982 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:56:03,983 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:56:03,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:56:03,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:56:04,033 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:56:04,034 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:56:04,669 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-04 00:56:04,669 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:56:04,676 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:56:04,676 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:56:04,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:56:04 BoogieIcfgContainer [2025-03-04 00:56:04,676 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:56:04,678 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:56:04,678 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:56:04,681 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:56:04,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:56:03" (1/3) ... [2025-03-04 00:56:04,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@84e74b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:56:04, skipping insertion in model container [2025-03-04 00:56:04,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:56:03" (2/3) ... [2025-03-04 00:56:04,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@84e74b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:56:04, skipping insertion in model container [2025-03-04 00:56:04,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:56:04" (3/3) ... [2025-03-04 00:56:04,684 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-54.i [2025-03-04 00:56:04,694 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:56:04,695 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-54.i that has 2 procedures, 46 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:56:04,727 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:56:04,737 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;@3c5adde, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:56:04,737 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:56:04,740 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 00:56:04,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-04 00:56:04,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:56:04,746 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:56:04,746 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:56:04,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:56:04,750 INFO L85 PathProgramCache]: Analyzing trace with hash -2145083144, now seen corresponding path program 1 times [2025-03-04 00:56:04,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:56:04,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1616060985] [2025-03-04 00:56:04,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:56:04,757 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 00:56:04,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:56:04,760 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 00:56:04,761 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 00:56:04,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 00:56:04,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 00:56:04,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:56:04,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:56:04,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:56:04,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:56:04,951 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-03-04 00:56:04,951 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:56:04,952 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:56:04,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1616060985] [2025-03-04 00:56:04,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1616060985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:56:04,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:56:04,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:56:04,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296589259] [2025-03-04 00:56:04,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:56:04,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:56:04,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:56:04,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:56:04,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:56:04,974 INFO L87 Difference]: Start difference. First operand has 46 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) 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, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 00:56:04,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:56:04,987 INFO L93 Difference]: Finished difference Result 86 states and 139 transitions. [2025-03-04 00:56:04,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:56:04,988 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, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 81 [2025-03-04 00:56:04,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:56:04,992 INFO L225 Difference]: With dead ends: 86 [2025-03-04 00:56:04,992 INFO L226 Difference]: Without dead ends: 43 [2025-03-04 00:56:04,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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 00:56:04,996 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 00:56:04,996 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 00:56:05,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-04 00:56:05,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-04 00:56:05,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 00:56:05,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2025-03-04 00:56:05,027 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 81 [2025-03-04 00:56:05,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:56:05,028 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2025-03-04 00:56:05,028 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, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 00:56:05,028 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2025-03-04 00:56:05,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-04 00:56:05,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:56:05,030 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:56:05,041 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 00:56:05,230 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 00:56:05,231 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:56:05,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:56:05,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1616448534, now seen corresponding path program 1 times [2025-03-04 00:56:05,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:56:05,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [847284186] [2025-03-04 00:56:05,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:56:05,246 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 00:56:05,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:56:05,249 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 00:56:05,250 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 00:56:05,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 00:56:05,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 00:56:05,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:56:05,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:56:05,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 00:56:05,406 INFO L279 TraceCheckSpWp]: Computing forward predicates...