./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-66.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 57396a3f6522baf465f10477ff1b4f4e1deccf80d42129ee9d03d8e74cd20ef5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:31:05,970 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:31:06,018 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:31:06,021 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:31:06,022 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:31:06,039 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:31:06,040 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:31:06,040 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:31:06,040 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:31:06,040 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:31:06,041 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:31:06,041 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:31:06,041 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:31:06,041 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:31:06,041 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:31:06,041 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:31:06,041 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:31:06,041 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:31:06,042 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:31:06,042 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:31:06,042 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:31:06,042 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:31:06,042 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:31:06,042 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:31:06,042 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:31:06,042 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:31:06,042 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:31:06,042 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:31:06,042 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:31:06,042 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:31:06,042 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:31:06,042 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:31:06,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:31:06,043 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:31:06,043 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:31:06,043 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:31:06,043 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:31:06,043 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:31:06,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:31:06,043 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:31:06,043 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:31:06,043 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:31:06,043 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:31:06,043 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 -> 57396a3f6522baf465f10477ff1b4f4e1deccf80d42129ee9d03d8e74cd20ef5 [2025-03-17 03:31:06,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:31:06,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:31:06,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:31:06,297 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:31:06,297 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:31:06,299 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-66.i [2025-03-17 03:31:07,471 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e47f31808/c3d611e1c9104e8b977fb873cf78966b/FLAGe011c88d2 [2025-03-17 03:31:07,750 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:31:07,751 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-66.i [2025-03-17 03:31:07,761 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e47f31808/c3d611e1c9104e8b977fb873cf78966b/FLAGe011c88d2 [2025-03-17 03:31:08,054 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e47f31808/c3d611e1c9104e8b977fb873cf78966b [2025-03-17 03:31:08,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:31:08,057 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:31:08,058 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:31:08,058 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:31:08,061 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:31:08,062 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:31:08" (1/1) ... [2025-03-17 03:31:08,062 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66e8df04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:08, skipping insertion in model container [2025-03-17 03:31:08,063 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:31:08" (1/1) ... [2025-03-17 03:31:08,077 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:31:08,173 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-66.i[915,928] [2025-03-17 03:31:08,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:31:08,224 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:31:08,234 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-66.i[915,928] [2025-03-17 03:31:08,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:31:08,269 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:31:08,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:08 WrapperNode [2025-03-17 03:31:08,269 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:31:08,274 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:31:08,274 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:31:08,274 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:31:08,278 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:08" (1/1) ... [2025-03-17 03:31:08,283 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:08" (1/1) ... [2025-03-17 03:31:08,300 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 105 [2025-03-17 03:31:08,300 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:31:08,300 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:31:08,301 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:31:08,301 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:31:08,307 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:08" (1/1) ... [2025-03-17 03:31:08,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:08" (1/1) ... [2025-03-17 03:31:08,309 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:08" (1/1) ... [2025-03-17 03:31:08,317 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 03:31:08,318 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:08" (1/1) ... [2025-03-17 03:31:08,318 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:08" (1/1) ... [2025-03-17 03:31:08,324 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:08" (1/1) ... [2025-03-17 03:31:08,324 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:08" (1/1) ... [2025-03-17 03:31:08,330 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:08" (1/1) ... [2025-03-17 03:31:08,338 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:08" (1/1) ... [2025-03-17 03:31:08,340 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:31:08,342 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:31:08,343 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:31:08,343 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:31:08,344 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:08" (1/1) ... [2025-03-17 03:31:08,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:31:08,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:31:08,373 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 03:31:08,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 03:31:08,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:31:08,393 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:31:08,394 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:31:08,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:31:08,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:31:08,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:31:08,446 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:31:08,448 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:31:08,658 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-17 03:31:08,658 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:31:08,668 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:31:08,668 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:31:08,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:31:08 BoogieIcfgContainer [2025-03-17 03:31:08,668 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:31:08,670 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:31:08,670 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:31:08,673 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:31:08,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:31:08" (1/3) ... [2025-03-17 03:31:08,674 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31a74991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:31:08, skipping insertion in model container [2025-03-17 03:31:08,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:08" (2/3) ... [2025-03-17 03:31:08,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31a74991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:31:08, skipping insertion in model container [2025-03-17 03:31:08,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:31:08" (3/3) ... [2025-03-17 03:31:08,676 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-66.i [2025-03-17 03:31:08,686 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:31:08,688 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-66.i that has 2 procedures, 42 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:31:08,731 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:31:08,739 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;@34c72d6f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:31:08,739 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:31:08,742 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 03:31:08,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 03:31:08,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:31:08,748 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:31:08,749 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:31:08,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:31:08,753 INFO L85 PathProgramCache]: Analyzing trace with hash -472853473, now seen corresponding path program 1 times [2025-03-17 03:31:08,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:31:08,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956108703] [2025-03-17 03:31:08,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:31:08,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:31:08,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 03:31:08,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 03:31:08,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:31:08,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:31:08,966 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-17 03:31:08,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:31:08,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956108703] [2025-03-17 03:31:08,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956108703] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:31:08,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482506321] [2025-03-17 03:31:08,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:31:08,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:31:08,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:31:08,972 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:31:08,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 03:31:09,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 03:31:09,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 03:31:09,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:31:09,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:31:09,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:31:09,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:31:09,113 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-17 03:31:09,114 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:31:09,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482506321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:31:09,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:31:09,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:31:09,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331363627] [2025-03-17 03:31:09,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:31:09,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:31:09,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:31:09,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:31:09,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:31:09,143 INFO L87 Difference]: Start difference. First operand has 42 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 03:31:09,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:31:09,162 INFO L93 Difference]: Finished difference Result 83 states and 140 transitions. [2025-03-17 03:31:09,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:31:09,163 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 92 [2025-03-17 03:31:09,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:31:09,168 INFO L225 Difference]: With dead ends: 83 [2025-03-17 03:31:09,169 INFO L226 Difference]: Without dead ends: 40 [2025-03-17 03:31:09,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:31:09,174 INFO L435 NwaCegarLoop]: 60 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, 60 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:31:09,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:31:09,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-17 03:31:09,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-17 03:31:09,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 03:31:09,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2025-03-17 03:31:09,203 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 92 [2025-03-17 03:31:09,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:31:09,203 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2025-03-17 03:31:09,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 03:31:09,204 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2025-03-17 03:31:09,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 03:31:09,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:31:09,206 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:31:09,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 03:31:09,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 03:31:09,407 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:31:09,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:31:09,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1283670467, now seen corresponding path program 1 times [2025-03-17 03:31:09,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:31:09,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458916096] [2025-03-17 03:31:09,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:31:09,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:31:09,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 03:31:09,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 03:31:09,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:31:09,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 03:31:09,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [354841837] [2025-03-17 03:31:09,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:31:09,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:31:09,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:31:09,522 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:31:09,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 03:31:09,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 03:31:09,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 03:31:09,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:31:09,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:31:09,612 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 03:31:09,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 03:31:09,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 03:31:09,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:31:09,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:31:09,694 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 03:31:09,695 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 03:31:09,695 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:31:09,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 03:31:09,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-17 03:31:09,903 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-17 03:31:09,948 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:31:09,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:31:09 BoogieIcfgContainer [2025-03-17 03:31:09,954 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:31:09,954 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:31:09,955 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:31:09,955 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:31:09,955 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:31:08" (3/4) ... [2025-03-17 03:31:09,957 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 03:31:09,957 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:31:09,958 INFO L158 Benchmark]: Toolchain (without parser) took 1900.47ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 85.2MB in the end (delta: 26.3MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2025-03-17 03:31:09,958 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:31:09,958 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.49ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 98.9MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:31:09,958 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.11ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 96.3MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:31:09,958 INFO L158 Benchmark]: Boogie Preprocessor took 41.57ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 92.9MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:31:09,958 INFO L158 Benchmark]: IcfgBuilder took 326.06ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 76.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:31:09,959 INFO L158 Benchmark]: TraceAbstraction took 1283.78ms. Allocated memory is still 142.6MB. Free memory was 75.2MB in the beginning and 85.2MB in the end (delta: -10.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:31:09,959 INFO L158 Benchmark]: Witness Printer took 2.71ms. Allocated memory is still 142.6MB. Free memory was 85.2MB in the beginning and 85.2MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:31:09,960 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.22ms. Allocated memory is still 201.3MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 211.49ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 98.9MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.11ms. Allocated memory is still 142.6MB. Free memory was 98.9MB in the beginning and 96.3MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.57ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 92.9MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 326.06ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 76.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1283.78ms. Allocated memory is still 142.6MB. Free memory was 75.2MB in the beginning and 85.2MB in the end (delta: -10.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.71ms. Allocated memory is still 142.6MB. Free memory was 85.2MB in the beginning and 85.2MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 83, overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 49. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 8; [L23] unsigned short int var_1_4 = 4; [L24] unsigned short int var_1_7 = 10000; [L25] unsigned short int var_1_9 = 38382; [L26] unsigned char var_1_10 = 0; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 100; [L29] double var_1_13 = 5.9; [L30] float var_1_15 = 9.375; [L31] double var_1_16 = 64.75; [L32] double var_1_17 = 99.5; [L33] float var_1_18 = 0.75; [L34] unsigned char last_1_var_1_10 = 0; [L35] double last_1_var_1_13 = 5.9; [L94] isInitial = 1 [L95] FCALL initially() [L96] int k_loop; [L97] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=4, var_1_7=10000, var_1_9=38382] [L97] COND TRUE k_loop < 1 [L98] CALL updateLastVariables() [L86] last_1_var_1_10 = var_1_10 [L87] last_1_var_1_13 = var_1_13 [L98] RET updateLastVariables() [L99] CALL updateVariables() [L60] var_1_4 = __VERIFIER_nondet_ushort() [L61] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_7=10000, var_1_9=38382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_7=10000, var_1_9=38382] [L61] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_7=10000, var_1_9=38382] [L62] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=10000, var_1_9=38382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=10000, var_1_9=38382] [L62] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=10000, var_1_9=38382] [L63] var_1_7 = __VERIFIER_nondet_ushort() [L64] CALL assume_abort_if_not(var_1_7 >= 8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=81919, var_1_9=38382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=81919, var_1_9=38382] [L64] RET assume_abort_if_not(var_1_7 >= 8191) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=81919, var_1_9=38382] [L65] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=81919, var_1_9=38382] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=81919, var_1_9=38382] [L65] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=81919, var_1_9=38382] [L66] var_1_9 = __VERIFIER_nondet_ushort() [L67] CALL assume_abort_if_not(var_1_9 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=81919, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=81919, var_1_9=32767] [L67] RET assume_abort_if_not(var_1_9 >= 32767) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=81919, var_1_9=32767] [L68] CALL assume_abort_if_not(var_1_9 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=81919, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=81919, var_1_9=32767] [L68] RET assume_abort_if_not(var_1_9 <= 65534) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=81919, var_1_9=32767] [L69] var_1_11 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=81919, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=81919, var_1_9=32767] [L70] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=81919, var_1_9=32767] [L71] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=81919, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=81919, var_1_9=32767] [L71] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=100, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=81919, var_1_9=32767] [L72] var_1_12 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=81919, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=81919, var_1_9=32767] [L73] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=81919, var_1_9=32767] [L74] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=81919, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=81919, var_1_9=32767] [L74] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=59/10, var_1_15=75/8, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=81919, var_1_9=32767] [L75] var_1_15 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=59/10, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=81919, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=59/10, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=81919, var_1_9=32767] [L76] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=59/10, var_1_16=259/4, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=81919, var_1_9=32767] [L77] var_1_16 = __VERIFIER_nondet_double() [L78] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=59/10, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=81919, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=59/10, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=81919, var_1_9=32767] [L78] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=59/10, var_1_17=199/2, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=81919, var_1_9=32767] [L79] var_1_17 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=59/10, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=81919, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=59/10, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=81919, var_1_9=32767] [L80] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=59/10, var_1_18=3/4, var_1_1=8, var_1_4=0, var_1_7=81919, var_1_9=32767] [L81] var_1_18 = __VERIFIER_nondet_float() [L82] CALL assume_abort_if_not((var_1_18 >= -922337.2036854776000e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854776000e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=59/10, var_1_1=8, var_1_4=0, var_1_7=81919, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=59/10, var_1_1=8, var_1_4=0, var_1_7=81919, var_1_9=32767] [L82] RET assume_abort_if_not((var_1_18 >= -922337.2036854776000e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854776000e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=59/10, var_1_1=8, var_1_4=0, var_1_7=81919, var_1_9=32767] [L83] CALL assume_abort_if_not(var_1_18 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=59/10, var_1_1=8, var_1_4=0, var_1_7=81919, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=59/10, var_1_1=8, var_1_4=0, var_1_7=81919, var_1_9=32767] [L83] RET assume_abort_if_not(var_1_18 != 0.0F) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=59/10, var_1_1=8, var_1_4=0, var_1_7=81919, var_1_9=32767] [L99] RET updateVariables() [L100] CALL step() [L39] COND TRUE last_1_var_1_10 <= last_1_var_1_10 [L40] var_1_1 = (last_1_var_1_10 + ((last_1_var_1_10 + last_1_var_1_10) + (var_1_7 - last_1_var_1_10))) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=59/10, var_1_1=16383, var_1_4=0, var_1_7=81919, var_1_9=32767] [L44] COND FALSE !(\read(var_1_11)) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=59/10, var_1_1=16383, var_1_4=0, var_1_7=81919, var_1_9=32767] [L49] COND TRUE (last_1_var_1_13 + var_1_15) < 16.75f [L50] var_1_13 = ((((((((2.625) > (var_1_16)) ? (2.625) : (var_1_16)))) < (var_1_17)) ? (((((2.625) > (var_1_16)) ? (2.625) : (var_1_16)))) : (var_1_17))) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=21/8, var_1_16=0, var_1_17=0, var_1_1=16383, var_1_4=0, var_1_7=81919, var_1_9=32767] [L100] RET step() [L101] CALL, EXPR property() [L90-L91] return (((last_1_var_1_10 <= last_1_var_1_10) ? (var_1_1 == ((unsigned short int) (last_1_var_1_10 + ((last_1_var_1_10 + last_1_var_1_10) + (var_1_7 - last_1_var_1_10))))) : (var_1_1 == ((unsigned short int) (var_1_9 - var_1_7)))) && (var_1_11 ? ((((var_1_4 % var_1_9) * var_1_1) >= var_1_7) ? (var_1_10 == ((unsigned char) var_1_12)) : 1) : 1)) && (((last_1_var_1_13 + var_1_15) < 16.75f) ? (var_1_13 == ((double) ((((((((2.625) > (var_1_16)) ? (2.625) : (var_1_16)))) < (var_1_17)) ? (((((2.625) > (var_1_16)) ? (2.625) : (var_1_16)))) : (var_1_17))))) : (((var_1_17 / var_1_18) <= 49.6) ? (var_1_13 == ((double) var_1_17)) : (var_1_13 == ((double) var_1_16)))) ; [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=21/8, var_1_16=0, var_1_17=0, var_1_1=16383, var_1_4=0, var_1_7=81919, var_1_9=32767] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_13=59/10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=21/8, var_1_16=0, var_1_17=0, var_1_1=16383, var_1_4=0, var_1_7=81919, var_1_9=32767] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 42 locations, 78 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 2, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 60 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, 60 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred 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, 368 NumberOfCodeBlocks, 368 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 182 ConstructedInterpolants, 0 QuantifiedInterpolants, 182 SizeOfPredicates, 0 NumberOfNonLiveVariables, 221 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 812/840 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 03:31:09,973 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-66.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 57396a3f6522baf465f10477ff1b4f4e1deccf80d42129ee9d03d8e74cd20ef5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:31:11,796 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:31:11,874 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 03:31:11,881 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:31:11,881 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:31:11,901 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:31:11,901 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:31:11,901 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:31:11,902 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:31:11,902 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:31:11,902 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:31:11,902 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:31:11,903 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:31:11,903 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:31:11,903 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:31:11,903 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:31:11,903 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:31:11,904 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:31:11,904 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:31:11,904 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:31:11,904 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:31:11,904 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:31:11,904 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:31:11,904 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 03:31:11,905 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 03:31:11,905 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 03:31:11,905 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:31:11,905 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:31:11,905 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:31:11,905 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:31:11,905 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:31:11,905 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:31:11,905 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:31:11,905 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:31:11,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:31:11,905 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:31:11,906 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:31:11,906 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:31:11,906 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:31:11,906 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 03:31:11,906 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 03:31:11,906 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:31:11,906 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:31:11,907 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:31:11,907 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:31:11,907 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 -> 57396a3f6522baf465f10477ff1b4f4e1deccf80d42129ee9d03d8e74cd20ef5 [2025-03-17 03:31:12,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:31:12,156 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:31:12,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:31:12,160 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:31:12,160 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:31:12,161 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-66.i [2025-03-17 03:31:13,394 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83220e1b6/6db2b11325f94114b84cd0f62e131d49/FLAG6893a0b93 [2025-03-17 03:31:13,575 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:31:13,576 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-66.i [2025-03-17 03:31:13,585 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83220e1b6/6db2b11325f94114b84cd0f62e131d49/FLAG6893a0b93 [2025-03-17 03:31:13,600 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83220e1b6/6db2b11325f94114b84cd0f62e131d49 [2025-03-17 03:31:13,602 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:31:13,604 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:31:13,605 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:31:13,605 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:31:13,609 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:31:13,609 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:31:13" (1/1) ... [2025-03-17 03:31:13,610 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41bb903b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:13, skipping insertion in model container [2025-03-17 03:31:13,610 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:31:13" (1/1) ... [2025-03-17 03:31:13,625 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:31:13,734 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-66.i[915,928] [2025-03-17 03:31:13,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:31:13,794 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:31:13,805 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-66.i[915,928] [2025-03-17 03:31:13,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:31:13,845 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:31:13,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:13 WrapperNode [2025-03-17 03:31:13,846 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:31:13,847 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:31:13,847 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:31:13,848 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:31:13,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:13" (1/1) ... [2025-03-17 03:31:13,866 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:13" (1/1) ... [2025-03-17 03:31:13,886 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 105 [2025-03-17 03:31:13,886 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:31:13,887 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:31:13,887 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:31:13,887 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:31:13,893 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:13" (1/1) ... [2025-03-17 03:31:13,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:13" (1/1) ... [2025-03-17 03:31:13,895 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:13" (1/1) ... [2025-03-17 03:31:13,905 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 03:31:13,906 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:13" (1/1) ... [2025-03-17 03:31:13,906 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:13" (1/1) ... [2025-03-17 03:31:13,914 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:13" (1/1) ... [2025-03-17 03:31:13,915 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:13" (1/1) ... [2025-03-17 03:31:13,916 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:13" (1/1) ... [2025-03-17 03:31:13,917 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:13" (1/1) ... [2025-03-17 03:31:13,918 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:31:13,919 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:31:13,919 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:31:13,919 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:31:13,922 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:13" (1/1) ... [2025-03-17 03:31:13,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:31:13,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:31:13,953 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 03:31:13,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 03:31:13,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:31:13,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 03:31:13,978 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:31:13,978 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:31:13,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:31:13,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:31:14,028 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:31:14,029 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:31:28,255 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-17 03:31:28,255 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:31:28,265 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:31:28,265 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:31:28,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:31:28 BoogieIcfgContainer [2025-03-17 03:31:28,266 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:31:28,268 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:31:28,268 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:31:28,271 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:31:28,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:31:13" (1/3) ... [2025-03-17 03:31:28,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@254197aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:31:28, skipping insertion in model container [2025-03-17 03:31:28,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:31:13" (2/3) ... [2025-03-17 03:31:28,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@254197aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:31:28, skipping insertion in model container [2025-03-17 03:31:28,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:31:28" (3/3) ... [2025-03-17 03:31:28,273 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-66.i [2025-03-17 03:31:28,282 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:31:28,283 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-66.i that has 2 procedures, 42 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:31:28,314 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:31:28,322 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;@7add15d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:31:28,322 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:31:28,325 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 03:31:28,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 03:31:28,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:31:28,331 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:31:28,331 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:31:28,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:31:28,335 INFO L85 PathProgramCache]: Analyzing trace with hash -472853473, now seen corresponding path program 1 times [2025-03-17 03:31:28,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:31:28,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1969086746] [2025-03-17 03:31:28,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:31:28,343 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:31:28,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:31:28,346 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:31:28,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 03:31:28,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 03:31:29,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 03:31:29,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:31:29,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:31:29,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:31:29,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:31:29,150 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 03:31:29,150 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:31:29,150 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:31:29,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1969086746] [2025-03-17 03:31:29,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1969086746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:31:29,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:31:29,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 03:31:29,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921675308] [2025-03-17 03:31:29,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:31:29,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:31:29,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:31:29,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:31:29,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:31:29,171 INFO L87 Difference]: Start difference. First operand has 42 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 03:31:29,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:31:29,188 INFO L93 Difference]: Finished difference Result 83 states and 140 transitions. [2025-03-17 03:31:29,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:31:29,190 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 92 [2025-03-17 03:31:29,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:31:29,194 INFO L225 Difference]: With dead ends: 83 [2025-03-17 03:31:29,194 INFO L226 Difference]: Without dead ends: 40 [2025-03-17 03:31:29,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:31:29,198 INFO L435 NwaCegarLoop]: 60 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, 60 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:31:29,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:31:29,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-17 03:31:29,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-17 03:31:29,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 03:31:29,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2025-03-17 03:31:29,248 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 92 [2025-03-17 03:31:29,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:31:29,248 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2025-03-17 03:31:29,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 03:31:29,248 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2025-03-17 03:31:29,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 03:31:29,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:31:29,252 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:31:29,273 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-17 03:31:29,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:31:29,454 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:31:29,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:31:29,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1283670467, now seen corresponding path program 1 times [2025-03-17 03:31:29,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:31:29,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1108616941] [2025-03-17 03:31:29,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:31:29,456 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:31:29,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:31:29,459 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:31:29,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 03:31:29,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 03:31:30,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 03:31:30,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:31:30,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:31:30,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 03:31:30,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:32:28,884 WARN L286 SmtUtils]: Spent 7.32s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)