./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-77.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-77.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 80d0dbd642f174f1d467e22c7cd881540a5b30cdbb6826a74a2a8a7b559c2f1a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:13:28,931 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:13:28,984 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:13:28,988 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:13:28,988 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:13:29,001 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:13:29,001 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:13:29,001 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:13:29,002 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:13:29,002 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:13:29,002 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:13:29,002 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:13:29,002 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:13:29,002 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:13:29,002 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:13:29,002 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:13:29,003 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:13:29,003 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:13:29,003 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:13:29,003 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:13:29,003 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:13:29,003 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:13:29,003 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:13:29,003 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:13:29,003 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:13:29,003 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:13:29,003 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:13:29,003 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:13:29,004 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:13:29,004 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:13:29,004 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:13:29,004 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:13:29,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:13:29,004 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:13:29,004 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:13:29,004 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:13:29,004 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:13:29,004 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:13:29,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:13:29,005 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:13:29,005 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:13:29,005 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:13:29,005 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:13:29,005 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 -> 80d0dbd642f174f1d467e22c7cd881540a5b30cdbb6826a74a2a8a7b559c2f1a [2025-03-03 23:13:29,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:13:29,216 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:13:29,220 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:13:29,221 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:13:29,221 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:13:29,222 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-77.i [2025-03-03 23:13:30,341 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bb59191a/62537c2242be40af8814844d2f5aadf4/FLAGc6b0e7e57 [2025-03-03 23:13:30,564 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:13:30,565 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-77.i [2025-03-03 23:13:30,570 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bb59191a/62537c2242be40af8814844d2f5aadf4/FLAGc6b0e7e57 [2025-03-03 23:13:30,918 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bb59191a/62537c2242be40af8814844d2f5aadf4 [2025-03-03 23:13:30,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:13:30,921 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:13:30,922 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:13:30,922 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:13:30,925 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:13:30,926 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:13:30" (1/1) ... [2025-03-03 23:13:30,927 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22e85379 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:30, skipping insertion in model container [2025-03-03 23:13:30,928 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:13:30" (1/1) ... [2025-03-03 23:13:30,939 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:13:31,025 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-77.i[915,928] [2025-03-03 23:13:31,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:13:31,060 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:13:31,066 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-77.i[915,928] [2025-03-03 23:13:31,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:13:31,094 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:13:31,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:31 WrapperNode [2025-03-03 23:13:31,095 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:13:31,096 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:13:31,096 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:13:31,096 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:13:31,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:31" (1/1) ... [2025-03-03 23:13:31,107 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:31" (1/1) ... [2025-03-03 23:13:31,131 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 105 [2025-03-03 23:13:31,131 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:13:31,132 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:13:31,132 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:13:31,132 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:13:31,138 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:31" (1/1) ... [2025-03-03 23:13:31,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:31" (1/1) ... [2025-03-03 23:13:31,140 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:31" (1/1) ... [2025-03-03 23:13:31,147 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 23:13:31,147 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:31" (1/1) ... [2025-03-03 23:13:31,147 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:31" (1/1) ... [2025-03-03 23:13:31,151 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:31" (1/1) ... [2025-03-03 23:13:31,151 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:31" (1/1) ... [2025-03-03 23:13:31,152 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:31" (1/1) ... [2025-03-03 23:13:31,153 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:31" (1/1) ... [2025-03-03 23:13:31,154 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:13:31,154 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:13:31,155 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:13:31,155 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:13:31,155 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:31" (1/1) ... [2025-03-03 23:13:31,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:13:31,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:13:31,181 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 23:13:31,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 23:13:31,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:13:31,202 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:13:31,203 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:13:31,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:13:31,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:13:31,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:13:31,258 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:13:31,259 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:13:31,444 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-03 23:13:31,444 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:13:31,450 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:13:31,450 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:13:31,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:13:31 BoogieIcfgContainer [2025-03-03 23:13:31,450 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:13:31,452 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:13:31,452 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:13:31,455 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:13:31,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:13:30" (1/3) ... [2025-03-03 23:13:31,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6893a0f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:13:31, skipping insertion in model container [2025-03-03 23:13:31,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:31" (2/3) ... [2025-03-03 23:13:31,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6893a0f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:13:31, skipping insertion in model container [2025-03-03 23:13:31,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:13:31" (3/3) ... [2025-03-03 23:13:31,457 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-77.i [2025-03-03 23:13:31,466 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:13:31,467 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-77.i that has 2 procedures, 48 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:13:31,501 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:13:31,508 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;@24e3a0f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:13:31,509 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:13:31,511 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 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-03 23:13:31,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 23:13:31,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:13:31,517 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, 1, 1, 1, 1, 1, 1] [2025-03-03 23:13:31,517 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:13:31,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:13:31,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1153221105, now seen corresponding path program 1 times [2025-03-03 23:13:31,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:13:31,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134354650] [2025-03-03 23:13:31,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:13:31,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:13:31,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 23:13:31,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 23:13:31,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:13:31,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:13:31,738 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-03 23:13:31,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:13:31,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134354650] [2025-03-03 23:13:31,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134354650] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:13:31,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139146907] [2025-03-03 23:13:31,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:13:31,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:13:31,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:13:31,744 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:13:31,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 23:13:31,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 23:13:31,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 23:13:31,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:13:31,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:13:31,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:13:31,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:13:31,884 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-03 23:13:31,885 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:13:31,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139146907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:13:31,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:13:31,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:13:31,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064850554] [2025-03-03 23:13:31,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:13:31,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:13:31,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:13:31,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:13:31,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:13:31,904 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 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 14.0) internal successors, (28), 2 states have internal predecessors, (28), 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-03 23:13:31,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:13:31,917 INFO L93 Difference]: Finished difference Result 93 states and 148 transitions. [2025-03-03 23:13:31,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:13:31,918 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (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 98 [2025-03-03 23:13:31,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:13:31,922 INFO L225 Difference]: With dead ends: 93 [2025-03-03 23:13:31,922 INFO L226 Difference]: Without dead ends: 45 [2025-03-03 23:13:31,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:13:31,926 INFO L435 NwaCegarLoop]: 66 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, 66 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:13:31,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:13:31,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-03 23:13:31,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-03 23:13:31,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 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-03 23:13:31,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 63 transitions. [2025-03-03 23:13:31,949 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 63 transitions. Word has length 98 [2025-03-03 23:13:31,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:13:31,949 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 63 transitions. [2025-03-03 23:13:31,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (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-03 23:13:31,950 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 63 transitions. [2025-03-03 23:13:31,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 23:13:31,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:13:31,952 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, 1, 1, 1, 1, 1, 1] [2025-03-03 23:13:31,960 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-03 23:13:32,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 23:13:32,153 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:13:32,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:13:32,154 INFO L85 PathProgramCache]: Analyzing trace with hash 761128692, now seen corresponding path program 1 times [2025-03-03 23:13:32,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:13:32,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857551654] [2025-03-03 23:13:32,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:13:32,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:13:32,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 23:13:32,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 23:13:32,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:13:32,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:13:32,278 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 23:13:32,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 23:13:32,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 23:13:32,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:13:32,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:13:32,370 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 23:13:32,370 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 23:13:32,371 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:13:32,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 23:13:32,374 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-03 23:13:32,427 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:13:32,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:13:32 BoogieIcfgContainer [2025-03-03 23:13:32,429 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:13:32,430 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:13:32,430 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:13:32,430 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:13:32,431 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:13:31" (3/4) ... [2025-03-03 23:13:32,434 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 23:13:32,435 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:13:32,435 INFO L158 Benchmark]: Toolchain (without parser) took 1514.65ms. Allocated memory is still 201.3MB. Free memory was 154.1MB in the beginning and 54.8MB in the end (delta: 99.3MB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB. [2025-03-03 23:13:32,435 INFO L158 Benchmark]: CDTParser took 0.79ms. Allocated memory is still 201.3MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:13:32,436 INFO L158 Benchmark]: CACSL2BoogieTranslator took 173.48ms. Allocated memory is still 201.3MB. Free memory was 153.7MB in the beginning and 141.1MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:13:32,436 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.33ms. Allocated memory is still 201.3MB. Free memory was 141.1MB in the beginning and 138.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:13:32,436 INFO L158 Benchmark]: Boogie Preprocessor took 22.29ms. Allocated memory is still 201.3MB. Free memory was 138.3MB in the beginning and 135.0MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:13:32,436 INFO L158 Benchmark]: IcfgBuilder took 295.96ms. Allocated memory is still 201.3MB. Free memory was 135.0MB in the beginning and 117.5MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:13:32,437 INFO L158 Benchmark]: TraceAbstraction took 977.50ms. Allocated memory is still 201.3MB. Free memory was 117.1MB in the beginning and 55.2MB in the end (delta: 61.9MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-03 23:13:32,437 INFO L158 Benchmark]: Witness Printer took 4.90ms. Allocated memory is still 201.3MB. Free memory was 55.2MB in the beginning and 54.8MB in the end (delta: 379.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:13:32,438 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.79ms. Allocated memory is still 201.3MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 173.48ms. Allocated memory is still 201.3MB. Free memory was 153.7MB in the beginning and 141.1MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.33ms. Allocated memory is still 201.3MB. Free memory was 141.1MB in the beginning and 138.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.29ms. Allocated memory is still 201.3MB. Free memory was 138.3MB in the beginning and 135.0MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 295.96ms. Allocated memory is still 201.3MB. Free memory was 135.0MB in the beginning and 117.5MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 977.50ms. Allocated memory is still 201.3MB. Free memory was 117.1MB in the beginning and 55.2MB in the end (delta: 61.9MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Witness Printer took 4.90ms. Allocated memory is still 201.3MB. Free memory was 55.2MB in the beginning and 54.8MB in the end (delta: 379.9kB). 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 46, overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of someBinaryFLOATComparisonOperation at line 88, overapproximation of someBinaryFLOATComparisonOperation at line 40, overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someUnaryFLOAToperation at line 40. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 50; [L23] unsigned short int var_1_4 = 60871; [L24] unsigned short int var_1_5 = 1; [L25] unsigned short int var_1_6 = 28896; [L26] unsigned short int var_1_7 = 5; [L27] float var_1_8 = 63.8; [L28] float var_1_9 = 49.5; [L29] float var_1_10 = 31.875; [L30] float var_1_11 = 255.25; [L31] unsigned short int var_1_12 = 0; [L32] unsigned char var_1_13 = 0; [L33] unsigned char var_1_14 = 1; [L34] float var_1_16 = 0.8; [L35] unsigned short int var_1_17 = 64; VAL [isInitial=0, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=60871, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L92] isInitial = 1 [L93] FCALL initially() [L94] int k_loop; [L95] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=60871, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L95] COND TRUE k_loop < 1 [L96] FCALL updateLastVariables() [L97] CALL updateVariables() [L60] var_1_4 = __VERIFIER_nondet_ushort() [L61] CALL assume_abort_if_not(var_1_4 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L61] RET assume_abort_if_not(var_1_4 >= 32767) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L62] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L62] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L63] var_1_5 = __VERIFIER_nondet_ushort() [L64] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L64] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L65] CALL assume_abort_if_not(var_1_5 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=16353, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=16353, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L65] RET assume_abort_if_not(var_1_5 <= 32767) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=16353, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L66] var_1_6 = __VERIFIER_nondet_ushort() [L67] CALL assume_abort_if_not(var_1_6 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=16353, var_1_6=32737, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=16353, var_1_6=32737, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L67] RET assume_abort_if_not(var_1_6 >= 16383) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=16353, var_1_6=32737, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L68] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=16353, var_1_6=32737, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=16353, var_1_6=32737, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L68] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=16353, var_1_6=32737, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L69] var_1_7 = __VERIFIER_nondet_ushort() [L70] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=16353, var_1_6=32737, var_1_8=319/5, var_1_9=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=16353, var_1_6=32737, var_1_8=319/5, var_1_9=99/2] [L70] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=16353, var_1_6=32737, var_1_8=319/5, var_1_9=99/2] [L71] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=16353, var_1_6=32737, var_1_7=16383, var_1_8=319/5, var_1_9=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=16353, var_1_6=32737, var_1_7=16383, var_1_8=319/5, var_1_9=99/2] [L71] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=16353, var_1_6=32737, var_1_7=16383, var_1_8=319/5, var_1_9=99/2] [L72] var_1_9 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=16353, var_1_6=32737, var_1_7=16383, var_1_8=319/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=16353, var_1_6=32737, var_1_7=16383, var_1_8=319/5] [L73] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=16353, var_1_6=32737, var_1_7=16383, var_1_8=319/5] [L74] var_1_10 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=16353, var_1_6=32737, var_1_7=16383, var_1_8=319/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=16353, var_1_6=32737, var_1_7=16383, var_1_8=319/5] [L75] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=16353, var_1_6=32737, var_1_7=16383, var_1_8=319/5] [L76] var_1_11 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=16353, var_1_6=32737, var_1_7=16383, var_1_8=319/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=16353, var_1_6=32737, var_1_7=16383, var_1_8=319/5] [L77] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=16353, var_1_6=32737, var_1_7=16383, var_1_8=319/5] [L78] var_1_13 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=16353, var_1_6=32737, var_1_7=16383, var_1_8=319/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=16353, var_1_6=32737, var_1_7=16383, var_1_8=319/5] [L79] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_12=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=16353, var_1_6=32737, var_1_7=16383, var_1_8=319/5] [L80] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=-255, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=16353, var_1_6=32737, var_1_7=16383, var_1_8=319/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=-255, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=16353, var_1_6=32737, var_1_7=16383, var_1_8=319/5] [L80] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_12=0, var_1_13=-255, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=16353, var_1_6=32737, var_1_7=16383, var_1_8=319/5] [L81] var_1_14 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=-255, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=16353, var_1_6=32737, var_1_7=16383, var_1_8=319/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=-255, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=16353, var_1_6=32737, var_1_7=16383, var_1_8=319/5] [L82] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_12=0, var_1_13=-255, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=16353, var_1_6=32737, var_1_7=16383, var_1_8=319/5] [L83] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=-255, var_1_14=0, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=16353, var_1_6=32737, var_1_7=16383, var_1_8=319/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=-255, var_1_14=0, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=16353, var_1_6=32737, var_1_7=16383, var_1_8=319/5] [L83] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_12=0, var_1_13=-255, var_1_14=0, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=16353, var_1_6=32737, var_1_7=16383, var_1_8=319/5] [L97] RET updateVariables() [L98] CALL step() [L39] COND TRUE var_1_7 > var_1_5 [L40] var_1_8 = ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) VAL [isInitial=1, var_1_12=0, var_1_13=-255, var_1_14=0, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-1071677441, var_1_5=16353, var_1_6=32737, var_1_7=16383, var_1_8=60876, var_1_9=60876] [L44] var_1_16 = var_1_11 [L45] var_1_17 = var_1_5 VAL [isInitial=1, var_1_11=60877, var_1_12=0, var_1_13=-255, var_1_14=0, var_1_16=60877, var_1_17=16353, var_1_1=50, var_1_4=-1071677441, var_1_5=16353, var_1_6=32737, var_1_7=16383, var_1_8=60876, var_1_9=60876] [L46] COND TRUE var_1_8 != var_1_16 [L47] var_1_1 = (var_1_4 - ((((var_1_5) < ((var_1_6 - var_1_7))) ? (var_1_5) : ((var_1_6 - var_1_7))))) VAL [isInitial=1, var_1_11=60877, var_1_12=0, var_1_13=-255, var_1_14=0, var_1_16=60877, var_1_17=16353, var_1_1=16414, var_1_4=-1071677441, var_1_5=16353, var_1_6=32737, var_1_7=16383, var_1_8=60876, var_1_9=60876] [L49] unsigned char stepLocal_1 = var_1_13; [L50] signed long int stepLocal_0 = (((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)); VAL [isInitial=1, stepLocal_0=16353, stepLocal_1=-255, var_1_11=60877, var_1_12=0, var_1_13=-255, var_1_14=0, var_1_16=60877, var_1_17=16353, var_1_1=16414, var_1_4=-1071677441, var_1_5=16353, var_1_6=32737, var_1_7=16383, var_1_8=60876, var_1_9=60876] [L51] COND FALSE !(stepLocal_1 && var_1_14) [L56] var_1_12 = 64 VAL [isInitial=1, stepLocal_0=16353, var_1_11=60877, var_1_12=64, var_1_13=-255, var_1_14=0, var_1_16=60877, var_1_17=16353, var_1_1=16414, var_1_4=-1071677441, var_1_5=16353, var_1_6=32737, var_1_7=16383, var_1_8=60876, var_1_9=60876] [L98] RET step() [L99] CALL, EXPR property() [L88-L89] return (((((var_1_8 != var_1_16) ? (var_1_1 == ((unsigned short int) (var_1_4 - ((((var_1_5) < ((var_1_6 - var_1_7))) ? (var_1_5) : ((var_1_6 - var_1_7))))))) : 1) && ((var_1_7 > var_1_5) ? (var_1_8 == ((float) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) : (var_1_8 == ((float) (((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - 1.6f))))) && ((var_1_13 && var_1_14) ? ((((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))) < ((((32) > ((var_1_1 - var_1_7))) ? (32) : ((var_1_1 - var_1_7))))) ? (var_1_12 == ((unsigned short int) (var_1_7 + 5))) : 1) : (var_1_12 == ((unsigned short int) 64)))) && (var_1_16 == ((float) var_1_11))) && (var_1_17 == ((unsigned short int) var_1_5)) ; VAL [\result=0, isInitial=1, var_1_11=60877, var_1_12=64, var_1_13=-255, var_1_14=0, var_1_16=60877, var_1_17=16353, var_1_1=16414, var_1_4=-1071677441, var_1_5=16353, var_1_6=32737, var_1_7=16383, var_1_8=60876, var_1_9=60876] [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=60877, var_1_12=64, var_1_13=-255, var_1_14=0, var_1_16=60877, var_1_17=16353, var_1_1=16414, var_1_4=-1071677441, var_1_5=16353, var_1_6=32737, var_1_7=16383, var_1_8=60876, var_1_9=60876] [L19] reach_error() VAL [isInitial=1, var_1_11=60877, var_1_12=64, var_1_13=-255, var_1_14=0, var_1_16=60877, var_1_17=16353, var_1_1=16414, var_1_4=-1071677441, var_1_5=16353, var_1_6=32737, var_1_7=16383, var_1_8=60876, var_1_9=60876] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 66 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, 66 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred 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, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 194 ConstructedInterpolants, 0 QuantifiedInterpolants, 194 SizeOfPredicates, 0 NumberOfNonLiveVariables, 231 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-03 23:13:32,455 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-77.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 80d0dbd642f174f1d467e22c7cd881540a5b30cdbb6826a74a2a8a7b559c2f1a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:13:34,236 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:13:34,319 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 23:13:34,325 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:13:34,325 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:13:34,352 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:13:34,352 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:13:34,353 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:13:34,353 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:13:34,354 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:13:34,354 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:13:34,354 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:13:34,355 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:13:34,355 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:13:34,355 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:13:34,355 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:13:34,355 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:13:34,355 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:13:34,355 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:13:34,355 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:13:34,355 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:13:34,355 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:13:34,355 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:13:34,356 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 23:13:34,356 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 23:13:34,356 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 23:13:34,356 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:13:34,356 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:13:34,356 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:13:34,356 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:13:34,357 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:13:34,357 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:13:34,357 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:13:34,357 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:13:34,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:13:34,357 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:13:34,357 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:13:34,358 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:13:34,358 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:13:34,358 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 23:13:34,358 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 23:13:34,358 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:13:34,358 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:13:34,358 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:13:34,358 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:13:34,358 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 -> 80d0dbd642f174f1d467e22c7cd881540a5b30cdbb6826a74a2a8a7b559c2f1a [2025-03-03 23:13:34,570 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:13:34,575 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:13:34,577 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:13:34,578 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:13:34,578 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:13:34,578 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-77.i [2025-03-03 23:13:35,691 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a87d81a1c/e1037cdaf94449788c1c1e85ef553c22/FLAG2e1dae516 [2025-03-03 23:13:35,901 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:13:35,901 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-77.i [2025-03-03 23:13:35,908 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a87d81a1c/e1037cdaf94449788c1c1e85ef553c22/FLAG2e1dae516 [2025-03-03 23:13:35,927 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a87d81a1c/e1037cdaf94449788c1c1e85ef553c22 [2025-03-03 23:13:35,929 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:13:35,931 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:13:35,932 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:13:35,932 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:13:35,935 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:13:35,936 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:13:35" (1/1) ... [2025-03-03 23:13:35,936 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4608937c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:35, skipping insertion in model container [2025-03-03 23:13:35,937 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:13:35" (1/1) ... [2025-03-03 23:13:35,951 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:13:36,036 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-77.i[915,928] [2025-03-03 23:13:36,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:13:36,070 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:13:36,077 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-77.i[915,928] [2025-03-03 23:13:36,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:13:36,102 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:13:36,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:36 WrapperNode [2025-03-03 23:13:36,103 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:13:36,103 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:13:36,104 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:13:36,104 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:13:36,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:36" (1/1) ... [2025-03-03 23:13:36,119 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:36" (1/1) ... [2025-03-03 23:13:36,132 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 105 [2025-03-03 23:13:36,133 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:13:36,134 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:13:36,134 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:13:36,134 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:13:36,139 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:36" (1/1) ... [2025-03-03 23:13:36,139 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:36" (1/1) ... [2025-03-03 23:13:36,141 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:36" (1/1) ... [2025-03-03 23:13:36,148 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 23:13:36,148 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:36" (1/1) ... [2025-03-03 23:13:36,149 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:36" (1/1) ... [2025-03-03 23:13:36,154 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:36" (1/1) ... [2025-03-03 23:13:36,154 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:36" (1/1) ... [2025-03-03 23:13:36,155 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:36" (1/1) ... [2025-03-03 23:13:36,156 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:36" (1/1) ... [2025-03-03 23:13:36,158 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:13:36,158 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:13:36,158 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:13:36,158 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:13:36,159 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:36" (1/1) ... [2025-03-03 23:13:36,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:13:36,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:13:36,185 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 23:13:36,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 23:13:36,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:13:36,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 23:13:36,202 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:13:36,202 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:13:36,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:13:36,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:13:36,254 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:13:36,256 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:13:36,546 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-03 23:13:36,546 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:13:36,556 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:13:36,556 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:13:36,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:13:36 BoogieIcfgContainer [2025-03-03 23:13:36,556 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:13:36,558 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:13:36,558 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:13:36,561 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:13:36,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:13:35" (1/3) ... [2025-03-03 23:13:36,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124922ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:13:36, skipping insertion in model container [2025-03-03 23:13:36,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:13:36" (2/3) ... [2025-03-03 23:13:36,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124922ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:13:36, skipping insertion in model container [2025-03-03 23:13:36,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:13:36" (3/3) ... [2025-03-03 23:13:36,563 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-77.i [2025-03-03 23:13:36,572 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:13:36,573 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-77.i that has 2 procedures, 48 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:13:36,609 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:13:36,616 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;@6f4917b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:13:36,616 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:13:36,618 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 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-03 23:13:36,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 23:13:36,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:13:36,626 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, 1, 1, 1, 1, 1, 1] [2025-03-03 23:13:36,626 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:13:36,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:13:36,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1153221105, now seen corresponding path program 1 times [2025-03-03 23:13:36,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:13:36,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1687035913] [2025-03-03 23:13:36,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:13:36,637 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:13:36,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:13:36,640 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 23:13:36,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 23:13:36,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 23:13:36,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 23:13:36,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:13:36,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:13:36,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:13:36,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:13:36,857 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-03-03 23:13:36,857 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:13:36,857 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:13:36,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1687035913] [2025-03-03 23:13:36,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1687035913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:13:36,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:13:36,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:13:36,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435737099] [2025-03-03 23:13:36,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:13:36,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:13:36,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:13:36,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:13:36,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:13:36,875 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 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 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 23:13:36,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:13:36,889 INFO L93 Difference]: Finished difference Result 93 states and 148 transitions. [2025-03-03 23:13:36,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:13:36,891 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 98 [2025-03-03 23:13:36,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:13:36,896 INFO L225 Difference]: With dead ends: 93 [2025-03-03 23:13:36,896 INFO L226 Difference]: Without dead ends: 45 [2025-03-03 23:13:36,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:13:36,902 INFO L435 NwaCegarLoop]: 66 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, 66 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:13:36,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:13:36,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-03 23:13:36,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-03 23:13:36,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 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-03 23:13:36,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 63 transitions. [2025-03-03 23:13:36,955 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 63 transitions. Word has length 98 [2025-03-03 23:13:36,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:13:36,955 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 63 transitions. [2025-03-03 23:13:36,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 23:13:36,956 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 63 transitions. [2025-03-03 23:13:36,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 23:13:36,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:13:36,958 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, 1, 1, 1, 1, 1, 1] [2025-03-03 23:13:36,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 23:13:37,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:13:37,159 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:13:37,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:13:37,160 INFO L85 PathProgramCache]: Analyzing trace with hash 761128692, now seen corresponding path program 1 times [2025-03-03 23:13:37,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:13:37,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [440523335] [2025-03-03 23:13:37,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:13:37,160 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:13:37,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:13:37,164 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 23:13:37,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 23:13:37,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 23:13:37,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 23:13:37,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:13:37,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:13:37,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 23:13:37,330 INFO L279 TraceCheckSpWp]: Computing forward predicates...