./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-17.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-17.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 e39747c0599d257bc9747ed62d5cd40f48dc813d2f5d610d9a9769b95be59735 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:06:38,354 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:06:38,415 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:06:38,419 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:06:38,419 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:06:38,432 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:06:38,433 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:06:38,433 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:06:38,433 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:06:38,433 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:06:38,433 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:06:38,433 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:06:38,434 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:06:38,434 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:06:38,434 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:06:38,434 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:06:38,434 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:06:38,434 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:06:38,434 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:06:38,434 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:06:38,434 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:06:38,434 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:06:38,434 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:06:38,435 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:06:38,435 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:06:38,435 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:06:38,435 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:06:38,435 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:06:38,435 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:06:38,435 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:06:38,435 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:06:38,435 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:06:38,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:06:38,435 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:06:38,435 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:06:38,435 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:06:38,436 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:06:38,436 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:06:38,436 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:06:38,436 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:06:38,436 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:06:38,436 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:06:38,436 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:06:38,436 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 -> e39747c0599d257bc9747ed62d5cd40f48dc813d2f5d610d9a9769b95be59735 [2025-03-03 23:06:38,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:06:38,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:06:38,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:06:38,663 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:06:38,663 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:06:38,664 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-17.i [2025-03-03 23:06:39,757 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/239dc057d/318a55fd35ef4961a657b360135fae63/FLAG2cab6164a [2025-03-03 23:06:40,001 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:06:40,002 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-17.i [2025-03-03 23:06:40,009 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/239dc057d/318a55fd35ef4961a657b360135fae63/FLAG2cab6164a [2025-03-03 23:06:40,325 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/239dc057d/318a55fd35ef4961a657b360135fae63 [2025-03-03 23:06:40,327 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:06:40,327 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:06:40,328 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:06:40,328 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:06:40,331 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:06:40,332 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:06:40" (1/1) ... [2025-03-03 23:06:40,332 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e42eceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:06:40, skipping insertion in model container [2025-03-03 23:06:40,332 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:06:40" (1/1) ... [2025-03-03 23:06:40,342 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:06:40,439 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-17.i[915,928] [2025-03-03 23:06:40,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:06:40,481 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:06:40,489 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-17.i[915,928] [2025-03-03 23:06:40,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:06:40,522 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:06:40,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:06:40 WrapperNode [2025-03-03 23:06:40,523 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:06:40,523 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:06:40,523 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:06:40,523 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:06:40,527 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:06:40" (1/1) ... [2025-03-03 23:06:40,531 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:06:40" (1/1) ... [2025-03-03 23:06:40,544 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147 [2025-03-03 23:06:40,544 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:06:40,544 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:06:40,544 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:06:40,545 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:06:40,550 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:06:40" (1/1) ... [2025-03-03 23:06:40,550 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:06:40" (1/1) ... [2025-03-03 23:06:40,551 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:06:40" (1/1) ... [2025-03-03 23:06:40,558 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:06:40,558 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:06:40" (1/1) ... [2025-03-03 23:06:40,558 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:06:40" (1/1) ... [2025-03-03 23:06:40,561 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:06:40" (1/1) ... [2025-03-03 23:06:40,562 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:06:40" (1/1) ... [2025-03-03 23:06:40,563 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:06:40" (1/1) ... [2025-03-03 23:06:40,563 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:06:40" (1/1) ... [2025-03-03 23:06:40,564 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:06:40,565 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:06:40,565 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:06:40,565 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:06:40,566 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:06:40" (1/1) ... [2025-03-03 23:06:40,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:06:40,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:06:40,588 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:06:40,590 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:06:40,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:06:40,604 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:06:40,604 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:06:40,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:06:40,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:06:40,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:06:40,650 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:06:40,652 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:06:40,779 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L96: havoc property_#t~bitwise18#1;havoc property_#t~short19#1; [2025-03-03 23:06:40,802 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-03 23:06:40,802 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:06:40,814 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:06:40,814 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:06:40,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:06:40 BoogieIcfgContainer [2025-03-03 23:06:40,814 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:06:40,816 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:06:40,816 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:06:40,819 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:06:40,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:06:40" (1/3) ... [2025-03-03 23:06:40,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b674495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:06:40, skipping insertion in model container [2025-03-03 23:06:40,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:06:40" (2/3) ... [2025-03-03 23:06:40,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b674495 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:06:40, skipping insertion in model container [2025-03-03 23:06:40,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:06:40" (3/3) ... [2025-03-03 23:06:40,821 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-17.i [2025-03-03 23:06:40,831 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:06:40,832 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-17.i that has 2 procedures, 65 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:06:40,873 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:06:40,882 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;@12e7aa3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:06:40,882 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:06:40,886 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 40 states have internal predecessors, (50), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 23:06:40,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 23:06:40,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:06:40,895 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:40,896 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:06:40,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:06:40,901 INFO L85 PathProgramCache]: Analyzing trace with hash -2090532826, now seen corresponding path program 1 times [2025-03-03 23:06:40,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:06:40,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24360050] [2025-03-03 23:06:40,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:06:40,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:06:40,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 23:06:40,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 23:06:40,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:06:40,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:06:41,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-03 23:06:41,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:06:41,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24360050] [2025-03-03 23:06:41,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24360050] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:06:41,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124105407] [2025-03-03 23:06:41,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:06:41,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:06:41,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:06:41,095 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:06:41,096 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:06:41,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 23:06:41,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 23:06:41,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:06:41,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:06:41,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:06:41,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:06:41,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-03 23:06:41,250 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:06:41,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124105407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:06:41,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:06:41,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:06:41,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106320545] [2025-03-03 23:06:41,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:06:41,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:06:41,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:06:41,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:06:41,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:06:41,292 INFO L87 Difference]: Start difference. First operand has 65 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 40 states have internal predecessors, (50), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 23:06:41,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:06:41,311 INFO L93 Difference]: Finished difference Result 127 states and 212 transitions. [2025-03-03 23:06:41,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:06:41,313 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 144 [2025-03-03 23:06:41,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:06:41,317 INFO L225 Difference]: With dead ends: 127 [2025-03-03 23:06:41,317 INFO L226 Difference]: Without dead ends: 62 [2025-03-03 23:06:41,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 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:06:41,321 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:06:41,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:06:41,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-03 23:06:41,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-03 23:06:41,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 23:06:41,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 91 transitions. [2025-03-03 23:06:41,347 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 91 transitions. Word has length 144 [2025-03-03 23:06:41,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:06:41,347 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 91 transitions. [2025-03-03 23:06:41,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 23:06:41,347 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 91 transitions. [2025-03-03 23:06:41,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 23:06:41,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:06:41,349 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:41,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 23:06:41,550 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:06:41,550 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:06:41,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:06:41,551 INFO L85 PathProgramCache]: Analyzing trace with hash 153565033, now seen corresponding path program 1 times [2025-03-03 23:06:41,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:06:41,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949343071] [2025-03-03 23:06:41,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:06:41,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:06:41,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 23:06:41,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 23:06:41,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:06:41,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 23:06:41,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1019774421] [2025-03-03 23:06:41,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:06:41,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:06:41,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:06:41,678 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:06:41,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 23:06:41,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 23:06:41,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 23:06:41,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:06:41,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:06:41,762 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 23:06:41,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 23:06:41,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 23:06:41,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:06:41,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:06:41,837 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 23:06:41,837 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 23:06:41,838 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:06:41,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 23:06:42,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-03 23:06:42,042 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-03 23:06:42,111 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:06:42,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:06:42 BoogieIcfgContainer [2025-03-03 23:06:42,114 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:06:42,115 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:06:42,115 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:06:42,115 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:06:42,115 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:06:40" (3/4) ... [2025-03-03 23:06:42,117 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 23:06:42,117 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:06:42,118 INFO L158 Benchmark]: Toolchain (without parser) took 1790.32ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 60.2MB in the end (delta: 45.4MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. [2025-03-03 23:06:42,118 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:06:42,118 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.63ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 92.8MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:06:42,118 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.65ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 90.4MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:06:42,119 INFO L158 Benchmark]: Boogie Preprocessor took 20.19ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 89.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:06:42,119 INFO L158 Benchmark]: IcfgBuilder took 249.40ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 71.4MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:06:42,119 INFO L158 Benchmark]: TraceAbstraction took 1297.70ms. Allocated memory is still 142.6MB. Free memory was 70.2MB in the beginning and 61.0MB in the end (delta: 9.1MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2025-03-03 23:06:42,119 INFO L158 Benchmark]: Witness Printer took 2.56ms. Allocated memory is still 142.6MB. Free memory was 60.3MB in the beginning and 60.2MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:06:42,121 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.17ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 194.63ms. Allocated memory is still 142.6MB. Free memory was 104.5MB in the beginning and 92.8MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.65ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 90.4MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.19ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 89.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 249.40ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 71.4MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1297.70ms. Allocated memory is still 142.6MB. Free memory was 70.2MB in the beginning and 61.0MB in the end (delta: 9.1MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. * Witness Printer took 2.56ms. Allocated memory is still 142.6MB. Free memory was 60.3MB in the beginning and 60.2MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 49, overapproximation of someBinaryDOUBLEComparisonOperation at line 57, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 61, overapproximation of someBinaryDOUBLEComparisonOperation at line 59, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 42, overapproximation of someBinaryDOUBLEComparisonOperation at line 96. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 10000000.8; [L23] double var_1_3 = 16.2; [L24] double var_1_4 = 7.5; [L25] double var_1_5 = 49.6; [L26] signed short int var_1_6 = -10; [L27] unsigned long int var_1_7 = 3280833198; [L28] unsigned long int var_1_8 = 10000000; [L29] signed short int var_1_10 = 1; [L30] signed long int var_1_11 = -32; [L31] double var_1_12 = 128.25; [L32] double var_1_13 = 4.4; [L33] signed long int var_1_14 = -1; [L34] signed long int var_1_15 = 4; [L35] signed long int var_1_16 = 64; [L36] signed long int var_1_17 = 4; [L37] unsigned char var_1_18 = 1; [L38] unsigned char var_1_19 = 1; VAL [isInitial=0, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_3=81/5, var_1_4=15/2, var_1_5=248/5, var_1_6=-10, var_1_7=3280833198, var_1_8=10000000] [L100] isInitial = 1 [L101] FCALL initially() [L102] int k_loop; [L103] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_3=81/5, var_1_4=15/2, var_1_5=248/5, var_1_6=-10, var_1_7=3280833198, var_1_8=10000000] [L103] COND TRUE k_loop < 1 [L104] FCALL updateLastVariables() [L105] CALL updateVariables() [L56] var_1_3 = __VERIFIER_nondet_double() [L57] CALL assume_abort_if_not((var_1_3 >= -461168.6018427382800e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 4611686.018427382800e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_4=15/2, var_1_5=248/5, var_1_6=-10, var_1_7=3280833198, var_1_8=10000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_4=15/2, var_1_5=248/5, var_1_6=-10, var_1_7=3280833198, var_1_8=10000000] [L57] RET assume_abort_if_not((var_1_3 >= -461168.6018427382800e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 4611686.018427382800e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_4=15/2, var_1_5=248/5, var_1_6=-10, var_1_7=3280833198, var_1_8=10000000] [L58] var_1_4 = __VERIFIER_nondet_double() [L59] CALL assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_5=248/5, var_1_6=-10, var_1_7=3280833198, var_1_8=10000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_5=248/5, var_1_6=-10, var_1_7=3280833198, var_1_8=10000000] [L59] RET assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_5=248/5, var_1_6=-10, var_1_7=3280833198, var_1_8=10000000] [L60] var_1_5 = __VERIFIER_nondet_double() [L61] CALL assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=3280833198, var_1_8=10000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=3280833198, var_1_8=10000000] [L61] RET assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=3280833198, var_1_8=10000000] [L62] var_1_7 = __VERIFIER_nondet_ulong() [L63] CALL assume_abort_if_not(var_1_7 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=10000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=10000000] [L63] RET assume_abort_if_not(var_1_7 >= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=10000000] [L64] CALL assume_abort_if_not(var_1_7 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=10000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=10000000] [L64] RET assume_abort_if_not(var_1_7 <= 4294967295) VAL [isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=10000000] [L65] var_1_8 = __VERIFIER_nondet_ulong() [L66] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647] [L66] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647] [L67] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L67] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L68] var_1_10 = __VERIFIER_nondet_short() [L69] CALL assume_abort_if_not(var_1_10 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L69] RET assume_abort_if_not(var_1_10 >= -32767) VAL [isInitial=1, var_1_10=0, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L70] CALL assume_abort_if_not(var_1_10 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L70] RET assume_abort_if_not(var_1_10 <= 32766) VAL [isInitial=1, var_1_10=0, var_1_11=-32, var_1_12=513/4, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L71] var_1_12 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L72] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=-32, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L73] CALL assume_abort_if_not(var_1_12 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L73] RET assume_abort_if_not(var_1_12 != 0.0F) VAL [isInitial=1, var_1_10=0, var_1_11=-32, var_1_13=22/5, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L74] var_1_13 = __VERIFIER_nondet_double() [L75] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L75] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L76] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L76] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=-1, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L77] var_1_14 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_14 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L78] RET assume_abort_if_not(var_1_14 >= -1) VAL [isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L79] CALL assume_abort_if_not(var_1_14 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L79] RET assume_abort_if_not(var_1_14 <= 2147483646) VAL [isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=4, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L80] var_1_15 = __VERIFIER_nondet_long() [L81] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L81] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L82] CALL assume_abort_if_not(var_1_15 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L82] RET assume_abort_if_not(var_1_15 <= 2147483646) VAL [isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=64, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L83] var_1_16 = __VERIFIER_nondet_long() [L84] CALL assume_abort_if_not(var_1_16 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L84] RET assume_abort_if_not(var_1_16 >= -1) VAL [isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L85] CALL assume_abort_if_not(var_1_16 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L85] RET assume_abort_if_not(var_1_16 <= 2147483646) VAL [isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=4, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L86] var_1_17 = __VERIFIER_nondet_long() [L87] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L87] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L88] CALL assume_abort_if_not(var_1_17 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L88] RET assume_abort_if_not(var_1_17 <= 2147483646) VAL [isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L89] var_1_19 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_19 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L90] RET assume_abort_if_not(var_1_19 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L91] CALL assume_abort_if_not(var_1_19 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L91] RET assume_abort_if_not(var_1_19 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L105] RET updateVariables() [L106] CALL step() [L42] COND FALSE !((var_1_5 * (- var_1_3)) != ((var_1_4 / 255.25) / ((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13))))) VAL [isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L45] EXPR var_1_15 >> var_1_11 VAL [isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L45] COND TRUE ((var_1_15 >> var_1_11) * var_1_7) <= var_1_17 [L46] var_1_18 = var_1_19 VAL [isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_1=50000004/5, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L48] COND TRUE \read(var_1_18) [L49] var_1_1 = (var_1_3 + ((((var_1_4) < ((49.5 + var_1_5))) ? (var_1_4) : ((49.5 + var_1_5))))) VAL [isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_6=-10, var_1_7=2147483647, var_1_8=0] [L51] COND TRUE (((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) - var_1_8) < var_1_11 [L52] var_1_6 = var_1_10 VAL [isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_6=0, var_1_7=2147483647, var_1_8=0] [L106] RET step() [L107] CALL, EXPR property() [L96] EXPR (((var_1_18 ? (var_1_1 == ((double) (var_1_3 + ((((var_1_4) < ((49.5 + var_1_5))) ? (var_1_4) : ((49.5 + var_1_5))))))) : 1) && (((((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) - var_1_8) < var_1_11) ? (var_1_6 == ((signed short int) var_1_10)) : 1)) && (((var_1_5 * (- var_1_3)) != ((var_1_4 / 255.25) / ((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13))))) ? (var_1_11 == ((signed long int) (((((var_1_14 - var_1_15)) > ((var_1_16 - var_1_17))) ? ((var_1_14 - var_1_15)) : ((var_1_16 - var_1_17)))))) : 1)) && ((((var_1_15 >> var_1_11) * var_1_7) <= var_1_17) ? (var_1_18 == ((unsigned char) var_1_19)) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_6=0, var_1_7=2147483647, var_1_8=0] [L96-L97] return (((var_1_18 ? (var_1_1 == ((double) (var_1_3 + ((((var_1_4) < ((49.5 + var_1_5))) ? (var_1_4) : ((49.5 + var_1_5))))))) : 1) && (((((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) - var_1_8) < var_1_11) ? (var_1_6 == ((signed short int) var_1_10)) : 1)) && (((var_1_5 * (- var_1_3)) != ((var_1_4 / 255.25) / ((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13))))) ? (var_1_11 == ((signed long int) (((((var_1_14 - var_1_15)) > ((var_1_16 - var_1_17))) ? ((var_1_14 - var_1_15)) : ((var_1_16 - var_1_17)))))) : 1)) && ((((var_1_15 >> var_1_11) * var_1_7) <= var_1_17) ? (var_1_18 == ((unsigned char) var_1_19)) : 1) ; [L107] RET, EXPR property() [L107] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_6=0, var_1_7=2147483647, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=-32, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=1, var_1_6=0, var_1_7=2147483647, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 65 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 2, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 92 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2 IncrementalHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 92 mSDtfsCounter, 2 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 145 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred 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, 576 NumberOfCodeBlocks, 576 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 286 ConstructedInterpolants, 0 QuantifiedInterpolants, 286 SizeOfPredicates, 0 NumberOfNonLiveVariables, 314 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1980/2024 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:06:42,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-17.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 e39747c0599d257bc9747ed62d5cd40f48dc813d2f5d610d9a9769b95be59735 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:06:43,833 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:06:43,915 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 23:06:43,924 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:06:43,924 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:06:43,940 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:06:43,941 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:06:43,941 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:06:43,941 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:06:43,941 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:06:43,941 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:06:43,941 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:06:43,942 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:06:43,942 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:06:43,942 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:06:43,942 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:06:43,942 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:06:43,942 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:06:43,942 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:06:43,942 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:06:43,942 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:06:43,942 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:06:43,942 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:06:43,942 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 23:06:43,942 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 23:06:43,942 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 23:06:43,942 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:06:43,942 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:06:43,942 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:06:43,943 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:06:43,943 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:06:43,943 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:06:43,943 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:06:43,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:06:43,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:06:43,943 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:06:43,943 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:06:43,943 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:06:43,943 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:06:43,943 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 23:06:43,943 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 23:06:43,943 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:06:43,943 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:06:43,943 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:06:43,943 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:06:43,943 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 -> e39747c0599d257bc9747ed62d5cd40f48dc813d2f5d610d9a9769b95be59735 [2025-03-03 23:06:44,166 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:06:44,171 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:06:44,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:06:44,174 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:06:44,175 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:06:44,176 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-17.i [2025-03-03 23:06:45,342 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f528b1726/d565d26cb16a45409653f2a32571b039/FLAG590ac5a28 [2025-03-03 23:06:45,557 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:06:45,558 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-17.i [2025-03-03 23:06:45,564 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f528b1726/d565d26cb16a45409653f2a32571b039/FLAG590ac5a28 [2025-03-03 23:06:45,579 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f528b1726/d565d26cb16a45409653f2a32571b039 [2025-03-03 23:06:45,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:06:45,583 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:06:45,584 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:06:45,584 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:06:45,587 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:06:45,587 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:06:45" (1/1) ... [2025-03-03 23:06:45,588 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e265e59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:06:45, skipping insertion in model container [2025-03-03 23:06:45,588 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:06:45" (1/1) ... [2025-03-03 23:06:45,599 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:06:45,697 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-17.i[915,928] [2025-03-03 23:06:45,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:06:45,741 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:06:45,749 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-17.i[915,928] [2025-03-03 23:06:45,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:06:45,772 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:06:45,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:06:45 WrapperNode [2025-03-03 23:06:45,773 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:06:45,773 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:06:45,773 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:06:45,773 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:06:45,777 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:06:45" (1/1) ... [2025-03-03 23:06:45,789 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:06:45" (1/1) ... [2025-03-03 23:06:45,809 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 123 [2025-03-03 23:06:45,809 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:06:45,814 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:06:45,814 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:06:45,814 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:06:45,820 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:06:45" (1/1) ... [2025-03-03 23:06:45,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:06:45" (1/1) ... [2025-03-03 23:06:45,823 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:06:45" (1/1) ... [2025-03-03 23:06:45,830 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:06:45,830 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:06:45" (1/1) ... [2025-03-03 23:06:45,830 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:06:45" (1/1) ... [2025-03-03 23:06:45,835 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:06:45" (1/1) ... [2025-03-03 23:06:45,840 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:06:45" (1/1) ... [2025-03-03 23:06:45,841 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:06:45" (1/1) ... [2025-03-03 23:06:45,841 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:06:45" (1/1) ... [2025-03-03 23:06:45,843 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:06:45,847 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:06:45,847 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:06:45,847 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:06:45,847 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:06:45" (1/1) ... [2025-03-03 23:06:45,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:06:45,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:06:45,870 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:06:45,872 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:06:45,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:06:45,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 23:06:45,888 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:06:45,888 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:06:45,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:06:45,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:06:45,952 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:06:45,953 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:07:00,417 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-03 23:07:00,418 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:07:00,424 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:07:00,424 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:07:00,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:07:00 BoogieIcfgContainer [2025-03-03 23:07:00,425 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:07:00,426 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:07:00,426 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:07:00,430 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:07:00,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:06:45" (1/3) ... [2025-03-03 23:07:00,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@646290c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:07:00, skipping insertion in model container [2025-03-03 23:07:00,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:06:45" (2/3) ... [2025-03-03 23:07:00,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@646290c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:07:00, skipping insertion in model container [2025-03-03 23:07:00,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:07:00" (3/3) ... [2025-03-03 23:07:00,431 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-17.i [2025-03-03 23:07:00,441 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:07:00,442 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-17.i that has 2 procedures, 58 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:07:00,477 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:07:00,485 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;@bf9ec91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:07:00,485 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:07:00,487 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 32 states have (on average 1.25) internal successors, (40), 33 states have internal predecessors, (40), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 23:07:00,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-03 23:07:00,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:07:00,494 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:00,495 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:07:00,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:07:00,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1472885661, now seen corresponding path program 1 times [2025-03-03 23:07:00,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:07:00,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1857652832] [2025-03-03 23:07:00,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:07:00,506 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:07:00,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:07:00,507 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:07:00,509 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:07:00,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 23:07:01,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 23:07:01,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:07:01,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:07:01,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:07:01,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:07:01,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2025-03-03 23:07:01,599 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:07:01,600 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:07:01,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1857652832] [2025-03-03 23:07:01,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1857652832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:07:01,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:07:01,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:07:01,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917367916] [2025-03-03 23:07:01,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:07:01,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:07:01,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:07:01,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:07:01,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:07:01,620 INFO L87 Difference]: Start difference. First operand has 58 states, 32 states have (on average 1.25) internal successors, (40), 33 states have internal predecessors, (40), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 23:07:01,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:07:01,637 INFO L93 Difference]: Finished difference Result 113 states and 192 transitions. [2025-03-03 23:07:01,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:07:01,639 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 141 [2025-03-03 23:07:01,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:07:01,642 INFO L225 Difference]: With dead ends: 113 [2025-03-03 23:07:01,642 INFO L226 Difference]: Without dead ends: 55 [2025-03-03 23:07:01,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 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:07:01,646 INFO L435 NwaCegarLoop]: 84 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, 84 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:07:01,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:07:01,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-03 23:07:01,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-03 23:07:01,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 23:07:01,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2025-03-03 23:07:01,676 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 141 [2025-03-03 23:07:01,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:07:01,676 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2025-03-03 23:07:01,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 23:07:01,677 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2025-03-03 23:07:01,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-03 23:07:01,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:07:01,680 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:01,708 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:07:01,881 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:07:01,881 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:07:01,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:07:01,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1830405318, now seen corresponding path program 1 times [2025-03-03 23:07:01,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:07:01,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2050028634] [2025-03-03 23:07:01,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:07:01,883 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:07:01,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:07:01,885 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:07:01,886 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:07:01,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 23:07:02,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 23:07:02,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:07:02,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:07:02,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 23:07:02,951 INFO L279 TraceCheckSpWp]: Computing forward predicates...