./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-74.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-74.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 192fd2fa21417aa09ed325872128b5046e8cfebc6357a29362e62278761c25b9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:13:10,197 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:13:10,251 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:13:10,254 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:13:10,255 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:13:10,276 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:13:10,278 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:13:10,278 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:13:10,278 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:13:10,278 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:13:10,279 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:13:10,279 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:13:10,280 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:13:10,280 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:13:10,280 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:13:10,280 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:13:10,280 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:13:10,280 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:13:10,280 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:13:10,280 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:13:10,280 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:13:10,280 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:13:10,281 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:13:10,281 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:13:10,281 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:13:10,281 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:13:10,281 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:13:10,281 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:13:10,281 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:13:10,281 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:13:10,281 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:13:10,281 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:13:10,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:13:10,282 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:13:10,282 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:13:10,282 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:13:10,282 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:13:10,282 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:13:10,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:13:10,283 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:13:10,283 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:13:10,283 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:13:10,283 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:13:10,283 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 -> 192fd2fa21417aa09ed325872128b5046e8cfebc6357a29362e62278761c25b9 [2025-03-03 23:13:10,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:13:10,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:13:10,527 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:13:10,529 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:13:10,529 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:13:10,531 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-74.i [2025-03-03 23:13:11,689 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d873b4620/ce15704e52584069a66f8ffd77177ab6/FLAG57215ba48 [2025-03-03 23:13:11,917 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:13:11,917 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-74.i [2025-03-03 23:13:11,926 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d873b4620/ce15704e52584069a66f8ffd77177ab6/FLAG57215ba48 [2025-03-03 23:13:11,941 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d873b4620/ce15704e52584069a66f8ffd77177ab6 [2025-03-03 23:13:11,943 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:13:11,946 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:13:11,947 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:13:11,947 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:13:11,951 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:13:11,952 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:13:11" (1/1) ... [2025-03-03 23:13:11,952 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4424c496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:11, skipping insertion in model container [2025-03-03 23:13:11,952 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:13:11" (1/1) ... [2025-03-03 23:13:11,970 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:13:12,077 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-74.i[915,928] [2025-03-03 23:13:12,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:13:12,117 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:13:12,124 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-74.i[915,928] [2025-03-03 23:13:12,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:13:12,152 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:13:12,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:12 WrapperNode [2025-03-03 23:13:12,153 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:13:12,154 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:13:12,154 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:13:12,154 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:13:12,158 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:12" (1/1) ... [2025-03-03 23:13:12,163 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:12" (1/1) ... [2025-03-03 23:13:12,179 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 109 [2025-03-03 23:13:12,183 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:13:12,183 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:13:12,183 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:13:12,183 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:13:12,189 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:12" (1/1) ... [2025-03-03 23:13:12,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:12" (1/1) ... [2025-03-03 23:13:12,191 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:12" (1/1) ... [2025-03-03 23:13:12,207 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 23:13:12,210 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:12" (1/1) ... [2025-03-03 23:13:12,211 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:12" (1/1) ... [2025-03-03 23:13:12,218 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:12" (1/1) ... [2025-03-03 23:13:12,218 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:12" (1/1) ... [2025-03-03 23:13:12,219 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:12" (1/1) ... [2025-03-03 23:13:12,223 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:12" (1/1) ... [2025-03-03 23:13:12,224 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:13:12,225 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:13:12,225 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:13:12,225 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:13:12,226 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:12" (1/1) ... [2025-03-03 23:13:12,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:13:12,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:13:12,253 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 23:13:12,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 23:13:12,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:13:12,272 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:13:12,272 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:13:12,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:13:12,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:13:12,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:13:12,317 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:13:12,319 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:13:12,459 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-03 23:13:12,459 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:13:12,465 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:13:12,465 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:13:12,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:13:12 BoogieIcfgContainer [2025-03-03 23:13:12,466 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:13:12,467 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:13:12,467 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:13:12,470 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:13:12,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:13:11" (1/3) ... [2025-03-03 23:13:12,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d33c606 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:13:12, skipping insertion in model container [2025-03-03 23:13:12,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:12" (2/3) ... [2025-03-03 23:13:12,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d33c606 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:13:12, skipping insertion in model container [2025-03-03 23:13:12,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:13:12" (3/3) ... [2025-03-03 23:13:12,474 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-74.i [2025-03-03 23:13:12,484 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:13:12,485 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-74.i that has 2 procedures, 50 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:13:12,521 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:13:12,529 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;@2ea859b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:13:12,530 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:13:12,533 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 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-03 23:13:12,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 23:13:12,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:13:12,539 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, 1, 1, 1, 1] [2025-03-03 23:13:12,540 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:13:12,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:13:12,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1082816437, now seen corresponding path program 1 times [2025-03-03 23:13:12,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:13:12,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148232120] [2025-03-03 23:13:12,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:13:12,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:13:12,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 23:13:12,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 23:13:12,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:13:12,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:13:12,754 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-03 23:13:12,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:13:12,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148232120] [2025-03-03 23:13:12,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148232120] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:13:12,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026448618] [2025-03-03 23:13:12,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:13:12,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:13:12,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:13:12,758 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:13:12,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 23:13:12,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 23:13:12,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 23:13:12,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:13:12,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:13:12,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:13:12,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:13:12,912 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-03 23:13:12,912 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:13:12,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026448618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:13:12,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:13:12,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:13:12,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16005621] [2025-03-03 23:13:12,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:13:12,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:13:12,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:13:12,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:13:12,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:13:12,931 INFO L87 Difference]: Start difference. First operand has 50 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 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 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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-03 23:13:12,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:13:12,950 INFO L93 Difference]: Finished difference Result 97 states and 153 transitions. [2025-03-03 23:13:12,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:13:12,951 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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 95 [2025-03-03 23:13:12,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:13:12,957 INFO L225 Difference]: With dead ends: 97 [2025-03-03 23:13:12,957 INFO L226 Difference]: Without dead ends: 47 [2025-03-03 23:13:12,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:13:12,963 INFO L435 NwaCegarLoop]: 69 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, 69 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:13:12,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:13:12,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-03 23:13:12,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-03 23:13:12,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 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-03 23:13:12,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 66 transitions. [2025-03-03 23:13:12,994 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 66 transitions. Word has length 95 [2025-03-03 23:13:12,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:13:12,995 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 66 transitions. [2025-03-03 23:13:12,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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-03 23:13:12,995 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 66 transitions. [2025-03-03 23:13:12,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 23:13:12,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:13:12,998 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, 1, 1, 1, 1] [2025-03-03 23:13:13,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 23:13:13,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 23:13:13,204 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:13:13,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:13:13,204 INFO L85 PathProgramCache]: Analyzing trace with hash 484736837, now seen corresponding path program 1 times [2025-03-03 23:13:13,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:13:13,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168504521] [2025-03-03 23:13:13,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:13:13,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:13:13,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 23:13:13,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 23:13:13,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:13:13,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:13:13,346 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 23:13:13,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 23:13:13,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 23:13:13,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:13:13,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:13:13,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 23:13:13,463 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 23:13:13,464 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:13:13,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 23:13:13,467 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-03 23:13:13,517 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:13:13,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:13:13 BoogieIcfgContainer [2025-03-03 23:13:13,524 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:13:13,525 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:13:13,525 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:13:13,525 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:13:13,525 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:13:12" (3/4) ... [2025-03-03 23:13:13,527 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 23:13:13,527 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:13:13,528 INFO L158 Benchmark]: Toolchain (without parser) took 1582.16ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 86.3MB in the end (delta: 26.6MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2025-03-03 23:13:13,528 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:13:13,529 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.85ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 99.6MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:13:13,529 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.21ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 98.1MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:13:13,529 INFO L158 Benchmark]: Boogie Preprocessor took 41.04ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 96.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:13:13,530 INFO L158 Benchmark]: IcfgBuilder took 240.96ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 80.9MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:13:13,531 INFO L158 Benchmark]: TraceAbstraction took 1056.64ms. Allocated memory is still 142.6MB. Free memory was 80.4MB in the beginning and 87.1MB in the end (delta: -6.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:13:13,531 INFO L158 Benchmark]: Witness Printer took 3.05ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 86.3MB in the end (delta: 797.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:13:13,532 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.24ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 205.85ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 99.6MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.21ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 98.1MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.04ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 96.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 240.96ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 80.9MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1056.64ms. Allocated memory is still 142.6MB. Free memory was 80.4MB in the beginning and 87.1MB in the end (delta: -6.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.05ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 86.3MB in the end (delta: 797.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 88, overapproximation of someBinaryFLOATComparisonOperation at line 86, overapproximation of someBinaryFLOATComparisonOperation at line 51, overapproximation of someBinaryFLOATComparisonOperation at line 93, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 40, overapproximation of someBinaryDOUBLEComparisonOperation at line 70, overapproximation of someBinaryDOUBLEComparisonOperation at line 66, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 93. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 25; [L23] double var_1_2 = 63.25; [L24] double var_1_3 = 3.779; [L25] double var_1_4 = 31.6; [L26] double var_1_5 = 100.5; [L27] unsigned long int var_1_6 = 64; [L28] unsigned long int var_1_7 = 3150951169; [L29] unsigned long int var_1_8 = 128; [L30] unsigned char var_1_9 = 0; [L31] signed short int var_1_10 = -16; [L32] float var_1_11 = 127.075; [L33] float var_1_12 = 1.2; [L34] signed short int var_1_16 = 4; [L35] signed short int var_1_18 = -64; [L36] signed char var_1_19 = -32; VAL [isInitial=0, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_2=253/4, var_1_3=3779/1000, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L97] isInitial = 1 [L98] FCALL initially() [L99] int k_loop; [L100] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_2=253/4, var_1_3=3779/1000, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L100] COND TRUE k_loop < 1 [L101] FCALL updateLastVariables() [L102] CALL updateVariables() [L65] var_1_2 = __VERIFIER_nondet_double() [L66] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_3=3779/1000, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_3=3779/1000, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L66] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_3=3779/1000, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L67] var_1_3 = __VERIFIER_nondet_double() [L68] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L68] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_4=158/5, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L69] var_1_4 = __VERIFIER_nondet_double() [L70] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L70] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_5=201/2, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L71] var_1_5 = __VERIFIER_nondet_double() [L72] 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, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L72] 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, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=64, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L73] var_1_6 = __VERIFIER_nondet_ulong() [L74] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L74] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L75] CALL assume_abort_if_not(var_1_6 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=6442450943, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=6442450943, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L75] RET assume_abort_if_not(var_1_6 <= 4294967294) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=6442450943, var_1_7=3150951169, var_1_8=128, var_1_9=0] [L76] var_1_7 = __VERIFIER_nondet_ulong() [L77] CALL assume_abort_if_not(var_1_7 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=6442450943, var_1_7=4294967294, var_1_8=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=6442450943, var_1_7=4294967294, var_1_8=128, var_1_9=0] [L77] RET assume_abort_if_not(var_1_7 >= 2147483647) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=6442450943, var_1_7=4294967294, var_1_8=128, var_1_9=0] [L78] CALL assume_abort_if_not(var_1_7 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=6442450943, var_1_7=4294967294, var_1_8=128, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=6442450943, var_1_7=4294967294, var_1_8=128, var_1_9=0] [L78] RET assume_abort_if_not(var_1_7 <= 4294967294) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=6442450943, var_1_7=4294967294, var_1_8=128, var_1_9=0] [L79] var_1_8 = __VERIFIER_nondet_ulong() [L80] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=6442450943, var_1_7=4294967294, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=6442450943, var_1_7=4294967294, var_1_9=0] [L80] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=6442450943, var_1_7=4294967294, var_1_9=0] [L81] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=6442450943, var_1_7=4294967294, var_1_8=-2147483649, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=6442450943, var_1_7=4294967294, var_1_8=-2147483649, var_1_9=0] [L81] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=6442450943, var_1_7=4294967294, var_1_8=-2147483649, var_1_9=0] [L82] var_1_9 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=6442450943, var_1_7=4294967294, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=6442450943, var_1_7=4294967294, var_1_8=-2147483649] [L83] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=6442450943, var_1_7=4294967294, var_1_8=-2147483649] [L84] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=6442450943, var_1_7=4294967294, var_1_8=-2147483649, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=6442450943, var_1_7=4294967294, var_1_8=-2147483649, var_1_9=1] [L84] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, var_1_10=-16, var_1_11=5083/40, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=6442450943, var_1_7=4294967294, var_1_8=-2147483649, var_1_9=1] [L85] var_1_11 = __VERIFIER_nondet_float() [L86] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=6442450943, var_1_7=4294967294, var_1_8=-2147483649, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=6442450943, var_1_7=4294967294, var_1_8=-2147483649, var_1_9=1] [L86] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-16, var_1_12=6/5, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=6442450943, var_1_7=4294967294, var_1_8=-2147483649, var_1_9=1] [L87] var_1_12 = __VERIFIER_nondet_float() [L88] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=6442450943, var_1_7=4294967294, var_1_8=-2147483649, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=6442450943, var_1_7=4294967294, var_1_8=-2147483649, var_1_9=1] [L88] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-16, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=25, var_1_6=6442450943, var_1_7=4294967294, var_1_8=-2147483649, var_1_9=1] [L102] RET updateVariables() [L103] CALL step() [L40] COND TRUE ((((((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3)))) < (var_1_4)) ? (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3)))) : (var_1_4))) < var_1_5 [L41] var_1_1 = ((((var_1_6) > ((var_1_7 - var_1_8))) ? (var_1_6) : ((var_1_7 - var_1_8)))) VAL [isInitial=1, var_1_10=-16, var_1_16=4, var_1_18=-64, var_1_19=-32, var_1_1=6442450943, var_1_6=6442450943, var_1_7=4294967294, var_1_8=-2147483649, var_1_9=1] [L49] var_1_19 = -2 VAL [isInitial=1, var_1_10=-16, var_1_16=4, var_1_18=-64, var_1_19=-2, var_1_1=6442450943, var_1_6=6442450943, var_1_7=4294967294, var_1_8=-2147483649, var_1_9=1] [L50] COND TRUE \read(var_1_9) VAL [isInitial=1, var_1_10=-16, var_1_16=4, var_1_18=-64, var_1_19=-2, var_1_1=6442450943, var_1_6=6442450943, var_1_7=4294967294, var_1_8=-2147483649, var_1_9=1] [L51] COND FALSE !(255.5f != (var_1_11 - var_1_12)) VAL [isInitial=1, var_1_10=-16, var_1_16=4, var_1_18=-64, var_1_19=-2, var_1_1=6442450943, var_1_6=6442450943, var_1_7=4294967294, var_1_8=-2147483649, var_1_9=1] [L59] COND TRUE \read(var_1_9) [L60] var_1_16 = ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))) VAL [isInitial=1, var_1_10=-16, var_1_16=2, var_1_18=-64, var_1_19=-2, var_1_1=6442450943, var_1_6=6442450943, var_1_7=4294967294, var_1_8=-2147483649, var_1_9=1] [L62] var_1_18 = var_1_19 VAL [isInitial=1, var_1_10=-16, var_1_16=2, var_1_18=-2, var_1_19=-2, var_1_1=6442450943, var_1_6=6442450943, var_1_7=4294967294, var_1_8=-2147483649, var_1_9=1] [L103] RET step() [L104] CALL, EXPR property() [L93-L94] return (((((((((((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3)))) < (var_1_4)) ? (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3)))) : (var_1_4))) < var_1_5) ? (var_1_1 == ((unsigned long int) ((((var_1_6) > ((var_1_7 - var_1_8))) ? (var_1_6) : ((var_1_7 - var_1_8)))))) : (var_1_9 ? (var_1_1 == ((unsigned long int) var_1_7)) : (var_1_1 == ((unsigned long int) var_1_6)))) && (var_1_9 ? ((255.5f != (var_1_11 - var_1_12)) ? (var_1_10 == ((signed short int) ((((((((var_1_19) > (var_1_19)) ? (var_1_19) : (var_1_19)))) > (var_1_19)) ? (((((var_1_19) > (var_1_19)) ? (var_1_19) : (var_1_19)))) : (var_1_19))))) : 1) : ((var_1_4 <= var_1_3) ? (var_1_10 == ((signed short int) var_1_19)) : 1))) && (var_1_9 ? (var_1_16 == ((signed short int) ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))))) : 1)) && (var_1_18 == ((signed short int) var_1_19))) && (var_1_19 == ((signed char) -2)) ; VAL [\result=0, isInitial=1, var_1_10=-16, var_1_16=2, var_1_18=-2, var_1_19=-2, var_1_1=6442450943, var_1_6=6442450943, var_1_7=4294967294, var_1_8=-2147483649, var_1_9=1] [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-16, var_1_16=2, var_1_18=-2, var_1_19=-2, var_1_1=6442450943, var_1_6=6442450943, var_1_7=4294967294, var_1_8=-2147483649, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=-16, var_1_16=2, var_1_18=-2, var_1_19=-2, var_1_1=6442450943, var_1_6=6442450943, var_1_7=4294967294, var_1_8=-2147483649, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 14, 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, 69 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, 69 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred 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, 285 NumberOfCodeBlocks, 285 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 188 ConstructedInterpolants, 0 QuantifiedInterpolants, 188 SizeOfPredicates, 0 NumberOfNonLiveVariables, 220 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-03 23:13:13,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-74.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 192fd2fa21417aa09ed325872128b5046e8cfebc6357a29362e62278761c25b9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:13:15,374 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:13:15,463 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 23:13:15,470 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:13:15,472 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:13:15,487 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:13:15,488 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:13:15,489 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:13:15,489 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:13:15,489 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:13:15,490 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:13:15,490 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:13:15,490 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:13:15,490 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:13:15,490 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:13:15,491 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:13:15,491 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:13:15,491 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:13:15,491 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:13:15,491 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:13:15,491 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:13:15,492 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:13:15,492 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:13:15,492 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 23:13:15,492 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 23:13:15,492 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 23:13:15,492 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:13:15,492 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:13:15,492 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:13:15,492 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:13:15,492 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:13:15,492 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:13:15,492 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:13:15,493 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:13:15,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:13:15,493 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:13:15,493 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:13:15,493 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:13:15,493 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:13:15,494 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 23:13:15,494 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 23:13:15,494 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:13:15,494 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:13:15,494 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:13:15,494 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:13:15,494 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 -> 192fd2fa21417aa09ed325872128b5046e8cfebc6357a29362e62278761c25b9 [2025-03-03 23:13:15,716 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:13:15,722 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:13:15,724 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:13:15,724 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:13:15,726 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:13:15,727 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-74.i [2025-03-03 23:13:16,931 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3153256ab/903a763e689c49e8b076b60157035f54/FLAG37d4af8a8 [2025-03-03 23:13:17,132 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:13:17,132 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-74.i [2025-03-03 23:13:17,139 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3153256ab/903a763e689c49e8b076b60157035f54/FLAG37d4af8a8 [2025-03-03 23:13:17,155 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3153256ab/903a763e689c49e8b076b60157035f54 [2025-03-03 23:13:17,157 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:13:17,158 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:13:17,160 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:13:17,160 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:13:17,163 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:13:17,164 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:13:17" (1/1) ... [2025-03-03 23:13:17,166 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7013fe13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:17, skipping insertion in model container [2025-03-03 23:13:17,166 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:13:17" (1/1) ... [2025-03-03 23:13:17,180 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:13:17,285 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-74.i[915,928] [2025-03-03 23:13:17,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:13:17,343 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:13:17,353 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-74.i[915,928] [2025-03-03 23:13:17,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:13:17,392 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:13:17,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:17 WrapperNode [2025-03-03 23:13:17,393 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:13:17,394 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:13:17,394 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:13:17,394 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:13:17,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:17" (1/1) ... [2025-03-03 23:13:17,407 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:17" (1/1) ... [2025-03-03 23:13:17,430 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 109 [2025-03-03 23:13:17,432 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:13:17,432 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:13:17,432 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:13:17,432 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:13:17,438 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:17" (1/1) ... [2025-03-03 23:13:17,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:17" (1/1) ... [2025-03-03 23:13:17,441 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:17" (1/1) ... [2025-03-03 23:13:17,456 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 23:13:17,456 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:17" (1/1) ... [2025-03-03 23:13:17,457 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:17" (1/1) ... [2025-03-03 23:13:17,469 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:17" (1/1) ... [2025-03-03 23:13:17,472 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:17" (1/1) ... [2025-03-03 23:13:17,474 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:17" (1/1) ... [2025-03-03 23:13:17,475 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:17" (1/1) ... [2025-03-03 23:13:17,481 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:13:17,482 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:13:17,482 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:13:17,482 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:13:17,486 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:17" (1/1) ... [2025-03-03 23:13:17,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:13:17,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:13:17,514 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 23:13:17,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 23:13:17,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:13:17,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 23:13:17,537 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:13:17,537 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:13:17,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:13:17,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:13:17,596 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:13:17,597 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:13:17,932 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-03 23:13:17,932 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:13:17,940 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:13:17,941 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:13:17,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:13:17 BoogieIcfgContainer [2025-03-03 23:13:17,941 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:13:17,943 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:13:17,943 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:13:17,947 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:13:17,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:13:17" (1/3) ... [2025-03-03 23:13:17,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a1c68af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:13:17, skipping insertion in model container [2025-03-03 23:13:17,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:17" (2/3) ... [2025-03-03 23:13:17,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a1c68af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:13:17, skipping insertion in model container [2025-03-03 23:13:17,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:13:17" (3/3) ... [2025-03-03 23:13:17,950 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-74.i [2025-03-03 23:13:17,960 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:13:17,961 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-74.i that has 2 procedures, 50 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:13:18,005 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:13:18,014 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;@19507af6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:13:18,014 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:13:18,017 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 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-03 23:13:18,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 23:13:18,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:13:18,025 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, 1, 1, 1, 1] [2025-03-03 23:13:18,025 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:13:18,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:13:18,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1082816437, now seen corresponding path program 1 times [2025-03-03 23:13:18,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:13:18,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1811061981] [2025-03-03 23:13:18,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:13:18,037 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-03 23:13:18,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:13:18,039 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-03 23:13:18,040 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-03 23:13:18,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 23:13:18,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 23:13:18,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:13:18,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:13:18,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:13:18,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:13:18,267 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-03 23:13:18,268 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:13:18,268 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:13:18,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1811061981] [2025-03-03 23:13:18,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1811061981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:13:18,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:13:18,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:13:18,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312822380] [2025-03-03 23:13:18,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:13:18,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:13:18,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:13:18,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:13:18,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:13:18,290 INFO L87 Difference]: Start difference. First operand has 50 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 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 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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-03 23:13:18,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:13:18,304 INFO L93 Difference]: Finished difference Result 97 states and 153 transitions. [2025-03-03 23:13:18,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:13:18,306 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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 95 [2025-03-03 23:13:18,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:13:18,310 INFO L225 Difference]: With dead ends: 97 [2025-03-03 23:13:18,310 INFO L226 Difference]: Without dead ends: 47 [2025-03-03 23:13:18,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:13:18,314 INFO L435 NwaCegarLoop]: 69 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, 69 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:13:18,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:13:18,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-03 23:13:18,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-03 23:13:18,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 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-03 23:13:18,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 66 transitions. [2025-03-03 23:13:18,351 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 66 transitions. Word has length 95 [2025-03-03 23:13:18,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:13:18,352 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 66 transitions. [2025-03-03 23:13:18,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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-03 23:13:18,352 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 66 transitions. [2025-03-03 23:13:18,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 23:13:18,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:13:18,354 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, 1, 1, 1, 1] [2025-03-03 23:13:18,365 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-03 23:13:18,559 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-03 23:13:18,559 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:13:18,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:13:18,560 INFO L85 PathProgramCache]: Analyzing trace with hash 484736837, now seen corresponding path program 1 times [2025-03-03 23:13:18,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:13:18,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1774713388] [2025-03-03 23:13:18,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:13:18,561 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-03 23:13:18,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:13:18,564 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-03 23:13:18,565 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-03 23:13:18,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 23:13:18,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 23:13:18,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:13:18,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:13:18,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 23:13:18,737 INFO L279 TraceCheckSpWp]: Computing forward predicates...