./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-12.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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-12.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 0c0c6d17ec5ebb3727e132dea838f76b6fc640941a7a94448d0b68ae2b7e3815 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:17:43,137 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:17:43,210 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 14:17:43,215 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:17:43,215 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:17:43,240 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:17:43,241 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:17:43,241 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:17:43,241 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:17:43,241 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:17:43,242 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:17:43,242 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:17:43,242 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:17:43,243 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:17:43,243 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:17:43,243 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:17:43,243 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:17:43,243 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:17:43,243 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 14:17:43,243 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:17:43,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:17:43,243 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:17:43,244 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:17:43,244 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:17:43,244 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:17:43,244 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:17:43,244 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:17:43,244 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:17:43,244 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:17:43,244 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:17:43,245 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:17:43,245 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:17:43,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:17:43,245 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:17:43,245 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:17:43,245 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:17:43,245 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:17:43,245 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 14:17:43,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 14:17:43,245 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:17:43,245 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:17:43,245 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:17:43,245 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:17:43,245 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 -> 0c0c6d17ec5ebb3727e132dea838f76b6fc640941a7a94448d0b68ae2b7e3815 [2025-03-08 14:17:43,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:17:43,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:17:43,460 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:17:43,461 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:17:43,461 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:17:43,462 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-12.i [2025-03-08 14:17:44,625 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a013aa8d6/a146167698cc402a8ee0fff8757db687/FLAG7c0674eda [2025-03-08 14:17:44,879 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:17:44,879 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-12.i [2025-03-08 14:17:44,885 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a013aa8d6/a146167698cc402a8ee0fff8757db687/FLAG7c0674eda [2025-03-08 14:17:45,197 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a013aa8d6/a146167698cc402a8ee0fff8757db687 [2025-03-08 14:17:45,199 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:17:45,200 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:17:45,201 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:17:45,201 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:17:45,204 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:17:45,205 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:17:45" (1/1) ... [2025-03-08 14:17:45,206 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dd26dc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:45, skipping insertion in model container [2025-03-08 14:17:45,206 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:17:45" (1/1) ... [2025-03-08 14:17:45,218 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:17:45,305 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-12.i[915,928] [2025-03-08 14:17:45,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:17:45,336 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:17:45,343 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-12.i[915,928] [2025-03-08 14:17:45,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:17:45,366 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:17:45,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:45 WrapperNode [2025-03-08 14:17:45,367 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:17:45,368 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:17:45,368 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:17:45,368 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:17:45,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:45" (1/1) ... [2025-03-08 14:17:45,379 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:45" (1/1) ... [2025-03-08 14:17:45,393 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2025-03-08 14:17:45,394 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:17:45,394 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:17:45,394 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:17:45,394 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:17:45,400 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:45" (1/1) ... [2025-03-08 14:17:45,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:45" (1/1) ... [2025-03-08 14:17:45,402 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:45" (1/1) ... [2025-03-08 14:17:45,409 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-08 14:17:45,410 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:45" (1/1) ... [2025-03-08 14:17:45,410 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:45" (1/1) ... [2025-03-08 14:17:45,413 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:45" (1/1) ... [2025-03-08 14:17:45,414 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:45" (1/1) ... [2025-03-08 14:17:45,415 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:45" (1/1) ... [2025-03-08 14:17:45,416 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:45" (1/1) ... [2025-03-08 14:17:45,417 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:17:45,417 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:17:45,417 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:17:45,418 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:17:45,418 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:45" (1/1) ... [2025-03-08 14:17:45,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:17:45,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:17:45,445 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-08 14:17:45,450 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-08 14:17:45,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:17:45,463 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:17:45,463 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:17:45,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 14:17:45,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:17:45,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:17:45,523 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:17:45,525 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:17:45,693 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-08 14:17:45,694 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:17:45,703 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:17:45,704 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:17:45,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:17:45 BoogieIcfgContainer [2025-03-08 14:17:45,704 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:17:45,708 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:17:45,708 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:17:45,711 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:17:45,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:17:45" (1/3) ... [2025-03-08 14:17:45,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@112f53f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:17:45, skipping insertion in model container [2025-03-08 14:17:45,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:45" (2/3) ... [2025-03-08 14:17:45,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@112f53f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:17:45, skipping insertion in model container [2025-03-08 14:17:45,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:17:45" (3/3) ... [2025-03-08 14:17:45,714 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-12.i [2025-03-08 14:17:45,726 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:17:45,727 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-12.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:17:45,778 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:17:45,787 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;@12711ea5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:17:45,787 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:17:45,790 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 14:17:45,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 14:17:45,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:17:45,797 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:17:45,797 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:17:45,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:17:45,801 INFO L85 PathProgramCache]: Analyzing trace with hash 927241195, now seen corresponding path program 1 times [2025-03-08 14:17:45,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:17:45,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639490740] [2025-03-08 14:17:45,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:17:45,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:17:45,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 14:17:45,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 14:17:45,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:17:45,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:17:46,021 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-08 14:17:46,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:17:46,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639490740] [2025-03-08 14:17:46,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639490740] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:17:46,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283016108] [2025-03-08 14:17:46,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:17:46,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:17:46,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:17:46,026 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-08 14:17:46,031 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-08 14:17:46,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 14:17:46,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 14:17:46,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:17:46,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:17:46,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:17:46,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:17:46,159 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-08 14:17:46,159 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:17:46,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283016108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:17:46,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:17:46,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 14:17:46,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765214259] [2025-03-08 14:17:46,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:17:46,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:17:46,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:17:46,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:17:46,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:17:46,185 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 14:17:46,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:17:46,206 INFO L93 Difference]: Finished difference Result 99 states and 161 transitions. [2025-03-08 14:17:46,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:17:46,208 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 103 [2025-03-08 14:17:46,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:17:46,213 INFO L225 Difference]: With dead ends: 99 [2025-03-08 14:17:46,213 INFO L226 Difference]: Without dead ends: 48 [2025-03-08 14:17:46,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 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-08 14:17:46,217 INFO L435 NwaCegarLoop]: 72 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, 72 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-08 14:17:46,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:17:46,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-08 14:17:46,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-08 14:17:46,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 14:17:46,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2025-03-08 14:17:46,251 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 69 transitions. Word has length 103 [2025-03-08 14:17:46,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:17:46,252 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 69 transitions. [2025-03-08 14:17:46,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 14:17:46,252 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 69 transitions. [2025-03-08 14:17:46,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 14:17:46,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:17:46,255 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:17:46,262 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-08 14:17:46,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 14:17:46,459 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:17:46,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:17:46,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1360627025, now seen corresponding path program 1 times [2025-03-08 14:17:46,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:17:46,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032427532] [2025-03-08 14:17:46,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:17:46,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:17:46,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 14:17:46,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 14:17:46,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:17:46,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:17:46,965 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-08 14:17:46,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:17:46,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032427532] [2025-03-08 14:17:46,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032427532] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:17:46,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688460195] [2025-03-08 14:17:46,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:17:46,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:17:46,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:17:46,971 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-08 14:17:46,972 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-08 14:17:47,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 14:17:47,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 14:17:47,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:17:47,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:17:47,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 14:17:47,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:17:47,250 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 225 proven. 30 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2025-03-08 14:17:47,251 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:17:47,430 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-08 14:17:47,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688460195] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 14:17:47,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 14:17:47,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-03-08 14:17:47,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241812200] [2025-03-08 14:17:47,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 14:17:47,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 14:17:47,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:17:47,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 14:17:47,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 14:17:47,432 INFO L87 Difference]: Start difference. First operand 48 states and 69 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 14:17:47,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:17:47,729 INFO L93 Difference]: Finished difference Result 150 states and 211 transitions. [2025-03-08 14:17:47,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 14:17:47,730 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 103 [2025-03-08 14:17:47,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:17:47,731 INFO L225 Difference]: With dead ends: 150 [2025-03-08 14:17:47,731 INFO L226 Difference]: Without dead ends: 105 [2025-03-08 14:17:47,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 203 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2025-03-08 14:17:47,732 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 131 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 14:17:47,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 144 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 14:17:47,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-08 14:17:47,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 53. [2025-03-08 14:17:47,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 14:17:47,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 73 transitions. [2025-03-08 14:17:47,749 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 73 transitions. Word has length 103 [2025-03-08 14:17:47,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:17:47,750 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 73 transitions. [2025-03-08 14:17:47,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 14:17:47,751 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 73 transitions. [2025-03-08 14:17:47,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 14:17:47,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:17:47,752 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:17:47,763 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-08 14:17:47,952 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-08 14:17:47,952 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:17:47,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:17:47,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1389256176, now seen corresponding path program 1 times [2025-03-08 14:17:47,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:17:47,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569916344] [2025-03-08 14:17:47,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:17:47,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:17:47,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 14:17:48,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 14:17:48,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:17:48,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 14:17:48,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [301126831] [2025-03-08 14:17:48,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:17:48,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:17:48,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:17:48,027 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:17:48,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 14:17:48,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 14:17:48,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 14:17:48,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:17:48,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:17:48,095 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 14:17:48,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 14:17:48,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 14:17:48,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:17:48,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:17:48,171 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 14:17:48,171 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 14:17:48,172 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 14:17:48,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 14:17:48,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:17:48,376 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 14:17:48,427 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 14:17:48,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:17:48 BoogieIcfgContainer [2025-03-08 14:17:48,431 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 14:17:48,431 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 14:17:48,431 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 14:17:48,431 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 14:17:48,432 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:17:45" (3/4) ... [2025-03-08 14:17:48,433 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 14:17:48,434 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 14:17:48,434 INFO L158 Benchmark]: Toolchain (without parser) took 3234.20ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 83.8MB in the end (delta: 22.5MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. [2025-03-08 14:17:48,435 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:17:48,435 INFO L158 Benchmark]: CACSL2BoogieTranslator took 166.49ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 93.3MB in the end (delta: 12.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 14:17:48,435 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.79ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 91.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:17:48,435 INFO L158 Benchmark]: Boogie Preprocessor took 22.67ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 89.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:17:48,435 INFO L158 Benchmark]: IcfgBuilder took 286.79ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 73.7MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 14:17:48,435 INFO L158 Benchmark]: TraceAbstraction took 2722.96ms. Allocated memory is still 142.6MB. Free memory was 72.8MB in the beginning and 83.9MB in the end (delta: -11.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:17:48,435 INFO L158 Benchmark]: Witness Printer took 2.80ms. Allocated memory is still 142.6MB. Free memory was 83.9MB in the beginning and 83.8MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:17:48,436 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.14ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 166.49ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 93.3MB in the end (delta: 12.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.79ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 91.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.67ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 89.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 286.79ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 73.7MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2722.96ms. Allocated memory is still 142.6MB. Free memory was 72.8MB in the beginning and 83.9MB in the end (delta: -11.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.80ms. Allocated memory is still 142.6MB. Free memory was 83.9MB in the beginning and 83.8MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 84, overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryArithmeticFLOAToperation at line 63. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] signed long int var_1_2 = -8; [L24] signed long int var_1_3 = 128; [L25] unsigned char var_1_5 = 0; [L26] float var_1_6 = 128.625; [L27] float var_1_7 = 2.625; [L28] float var_1_8 = 25.5; [L29] float var_1_9 = 4.75; [L30] float var_1_10 = 16.4; [L31] float var_1_11 = 0.2; [L32] float var_1_12 = 499.1; [L33] unsigned char var_1_13 = 0; [L34] signed long int var_1_14 = -8; [L35] unsigned char var_1_15 = 1; [L36] unsigned char last_1_var_1_13 = 0; VAL [isInitial=0, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-8, var_1_3=128, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L101] isInitial = 1 [L102] FCALL initially() [L103] int k_loop; [L104] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-8, var_1_3=128, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L104] COND TRUE k_loop < 1 [L105] CALL updateLastVariables() [L94] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-8, var_1_3=128, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L105] RET updateLastVariables() [L106] CALL updateVariables() [L66] var_1_2 = __VERIFIER_nondet_long() [L67] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=128, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=128, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L67] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=128, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L68] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=128, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=128, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L68] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=128, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L69] var_1_3 = __VERIFIER_nondet_long() [L70] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L70] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L71] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L71] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L72] var_1_5 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L73] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L74] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L74] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_7=21/8, var_1_8=51/2, var_1_9=19/4] [L75] var_1_7 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_8=51/2, var_1_9=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_8=51/2, var_1_9=19/4] [L76] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_8=51/2, var_1_9=19/4] [L77] var_1_8 = __VERIFIER_nondet_float() [L78] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_9=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_9=19/4] [L78] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8, var_1_9=19/4] [L79] var_1_9 = __VERIFIER_nondet_float() [L80] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L80] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=82/5, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L81] var_1_10 = __VERIFIER_nondet_float() [L82] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L82] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_12=4991/10, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L83] var_1_12 = __VERIFIER_nondet_float() [L84] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L84] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=-8, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L85] var_1_14 = __VERIFIER_nondet_long() [L86] CALL assume_abort_if_not(var_1_14 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L86] RET assume_abort_if_not(var_1_14 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L87] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L87] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L88] CALL assume_abort_if_not(var_1_14 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L88] RET assume_abort_if_not(var_1_14 != 0) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L89] var_1_15 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L90] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L91] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L91] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L106] RET updateVariables() [L107] CALL step() [L40] signed long int stepLocal_1 = var_1_3; [L41] signed long int stepLocal_0 = var_1_2; VAL [isInitial=1, last_1_var_1_13=0, stepLocal_0=-1, stepLocal_1=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L42] COND FALSE !(! (-50 < var_1_2)) VAL [isInitial=1, last_1_var_1_13=0, stepLocal_0=-1, stepLocal_1=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L51] COND FALSE !(var_1_2 > (var_1_3 / var_1_14)) [L58] var_1_13 = var_1_5 VAL [isInitial=1, last_1_var_1_13=0, stepLocal_0=-1, stepLocal_1=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L60] COND FALSE !(\read(var_1_13)) VAL [isInitial=1, last_1_var_1_13=0, stepLocal_0=-1, stepLocal_1=0, var_1_11=1/5, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L63] var_1_11 = (((((2.5f) < (((((31.75f) > (var_1_12)) ? (31.75f) : (var_1_12))))) ? (2.5f) : (((((31.75f) > (var_1_12)) ? (31.75f) : (var_1_12)))))) + 0.125f) VAL [isInitial=1, last_1_var_1_13=0, stepLocal_0=-1, stepLocal_1=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L107] RET step() [L108] CALL, EXPR property() [L97-L98] return ((((! (-50 < var_1_2)) ? ((var_1_2 != var_1_3) ? ((var_1_3 <= var_1_2) ? (var_1_1 == ((unsigned char) (last_1_var_1_13 && var_1_5))) : 1) : (var_1_1 == ((unsigned char) var_1_5))) : 1) && (var_1_13 ? (var_1_6 == ((float) (((((((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) - var_1_9)) > (var_1_10)) ? ((((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) - var_1_9)) : (var_1_10))))) : 1)) && (var_1_11 == ((float) (((((2.5f) < (((((31.75f) > (var_1_12)) ? (31.75f) : (var_1_12))))) ? (2.5f) : (((((31.75f) > (var_1_12)) ? (31.75f) : (var_1_12)))))) + 0.125f)))) && ((var_1_2 > (var_1_3 / var_1_14)) ? (var_1_1 ? (var_1_13 == ((unsigned char) (! var_1_15))) : (var_1_13 == ((unsigned char) 0))) : (var_1_13 == ((unsigned char) var_1_5))) ; VAL [\result=0, isInitial=1, last_1_var_1_13=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_1=0, var_1_2=-1, var_1_3=0, var_1_5=0, var_1_6=1029/8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 90 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 3, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 137 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 131 mSDsluCounter, 216 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 98 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 132 IncrementalHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 118 mSDtfsCounter, 132 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 325 GetRequests, 307 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=2, InterpolantAutomatonStates: 17, 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, 2 MinimizatonAttempts, 52 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 618 NumberOfCodeBlocks, 618 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 510 ConstructedInterpolants, 0 QuantifiedInterpolants, 968 SizeOfPredicates, 2 NumberOfNonLiveVariables, 484 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 2280/2400 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-08 14:17:48,455 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-12.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 0c0c6d17ec5ebb3727e132dea838f76b6fc640941a7a94448d0b68ae2b7e3815 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:17:50,371 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:17:50,484 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 14:17:50,488 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:17:50,489 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:17:50,510 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:17:50,511 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:17:50,512 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:17:50,512 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:17:50,512 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:17:50,513 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:17:50,513 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:17:50,513 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:17:50,514 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:17:50,514 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:17:50,514 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:17:50,514 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:17:50,514 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:17:50,514 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:17:50,515 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:17:50,515 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:17:50,515 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:17:50,515 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:17:50,515 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 14:17:50,515 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 14:17:50,515 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 14:17:50,515 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:17:50,515 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:17:50,515 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:17:50,515 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:17:50,516 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:17:50,516 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:17:50,516 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:17:50,516 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:17:50,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:17:50,516 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:17:50,516 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:17:50,516 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:17:50,516 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:17:50,516 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 14:17:50,516 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 14:17:50,516 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:17:50,516 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:17:50,516 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:17:50,516 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:17:50,516 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 -> 0c0c6d17ec5ebb3727e132dea838f76b6fc640941a7a94448d0b68ae2b7e3815 [2025-03-08 14:17:50,780 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:17:50,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:17:50,791 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:17:50,793 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:17:50,794 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:17:50,795 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-12.i [2025-03-08 14:17:52,045 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ed012ee8/f32d65f2659c4265b27d2d85d4378bdd/FLAG618be0691 [2025-03-08 14:17:52,226 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:17:52,226 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-12.i [2025-03-08 14:17:52,236 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ed012ee8/f32d65f2659c4265b27d2d85d4378bdd/FLAG618be0691 [2025-03-08 14:17:52,599 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ed012ee8/f32d65f2659c4265b27d2d85d4378bdd [2025-03-08 14:17:52,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:17:52,602 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:17:52,603 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:17:52,604 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:17:52,607 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:17:52,608 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:17:52" (1/1) ... [2025-03-08 14:17:52,608 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c6ca3df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:52, skipping insertion in model container [2025-03-08 14:17:52,608 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:17:52" (1/1) ... [2025-03-08 14:17:52,620 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:17:52,708 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-12.i[915,928] [2025-03-08 14:17:52,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:17:52,750 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:17:52,758 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-12.i[915,928] [2025-03-08 14:17:52,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:17:52,785 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:17:52,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:52 WrapperNode [2025-03-08 14:17:52,785 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:17:52,786 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:17:52,786 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:17:52,786 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:17:52,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:52" (1/1) ... [2025-03-08 14:17:52,797 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:52" (1/1) ... [2025-03-08 14:17:52,813 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2025-03-08 14:17:52,813 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:17:52,814 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:17:52,814 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:17:52,814 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:17:52,820 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:52" (1/1) ... [2025-03-08 14:17:52,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:52" (1/1) ... [2025-03-08 14:17:52,823 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:52" (1/1) ... [2025-03-08 14:17:52,831 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-08 14:17:52,832 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:52" (1/1) ... [2025-03-08 14:17:52,832 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:52" (1/1) ... [2025-03-08 14:17:52,837 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:52" (1/1) ... [2025-03-08 14:17:52,842 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:52" (1/1) ... [2025-03-08 14:17:52,844 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:52" (1/1) ... [2025-03-08 14:17:52,845 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:52" (1/1) ... [2025-03-08 14:17:52,847 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:17:52,848 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:17:52,848 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:17:52,848 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:17:52,849 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:52" (1/1) ... [2025-03-08 14:17:52,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:17:52,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:17:52,875 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-08 14:17:52,882 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-08 14:17:52,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:17:52,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 14:17:52,898 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:17:52,898 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:17:52,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:17:52,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:17:52,953 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:17:52,955 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:17:53,561 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-08 14:17:53,561 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:17:53,569 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:17:53,570 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:17:53,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:17:53 BoogieIcfgContainer [2025-03-08 14:17:53,570 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:17:53,572 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:17:53,572 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:17:53,576 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:17:53,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:17:52" (1/3) ... [2025-03-08 14:17:53,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12735e8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:17:53, skipping insertion in model container [2025-03-08 14:17:53,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:17:52" (2/3) ... [2025-03-08 14:17:53,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12735e8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:17:53, skipping insertion in model container [2025-03-08 14:17:53,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:17:53" (3/3) ... [2025-03-08 14:17:53,579 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-12.i [2025-03-08 14:17:53,590 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:17:53,591 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-12.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:17:53,628 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:17:53,639 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;@3009d456, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:17:53,640 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:17:53,644 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 14:17:53,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 14:17:53,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:17:53,653 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:17:53,654 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:17:53,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:17:53,657 INFO L85 PathProgramCache]: Analyzing trace with hash 927241195, now seen corresponding path program 1 times [2025-03-08 14:17:53,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:17:53,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1145429895] [2025-03-08 14:17:53,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:17:53,665 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-08 14:17:53,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:17:53,669 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-08 14:17:53,670 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-08 14:17:53,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 14:17:53,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 14:17:53,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:17:53,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:17:53,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:17:53,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:17:53,980 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2025-03-08 14:17:53,981 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:17:53,981 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:17:53,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1145429895] [2025-03-08 14:17:53,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1145429895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:17:53,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:17:53,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 14:17:53,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441952481] [2025-03-08 14:17:53,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:17:53,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:17:53,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:17:54,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:17:54,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:17:54,005 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 14:17:54,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:17:54,027 INFO L93 Difference]: Finished difference Result 99 states and 161 transitions. [2025-03-08 14:17:54,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:17:54,029 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 103 [2025-03-08 14:17:54,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:17:54,036 INFO L225 Difference]: With dead ends: 99 [2025-03-08 14:17:54,036 INFO L226 Difference]: Without dead ends: 48 [2025-03-08 14:17:54,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 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-08 14:17:54,042 INFO L435 NwaCegarLoop]: 72 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, 72 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-08 14:17:54,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:17:54,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-08 14:17:54,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-08 14:17:54,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 14:17:54,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2025-03-08 14:17:54,079 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 69 transitions. Word has length 103 [2025-03-08 14:17:54,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:17:54,080 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 69 transitions. [2025-03-08 14:17:54,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 14:17:54,081 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 69 transitions. [2025-03-08 14:17:54,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 14:17:54,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:17:54,084 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:17:54,095 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-03-08 14:17:54,285 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-08 14:17:54,286 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:17:54,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:17:54,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1360627025, now seen corresponding path program 1 times [2025-03-08 14:17:54,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:17:54,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [947040367] [2025-03-08 14:17:54,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:17:54,287 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-08 14:17:54,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:17:54,289 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-08 14:17:54,292 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-08 14:17:54,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 14:17:54,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 14:17:54,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:17:54,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:17:54,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 14:17:54,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:17:54,790 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 225 proven. 30 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2025-03-08 14:17:54,790 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:17:55,039 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-08 14:17:55,041 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:17:55,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [947040367] [2025-03-08 14:17:55,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [947040367] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 14:17:55,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 14:17:55,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2025-03-08 14:17:55,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855836018] [2025-03-08 14:17:55,042 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 14:17:55,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 14:17:55,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:17:55,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 14:17:55,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 14:17:55,045 INFO L87 Difference]: Start difference. First operand 48 states and 69 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 14:17:56,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:17:56,034 INFO L93 Difference]: Finished difference Result 154 states and 215 transitions. [2025-03-08 14:17:56,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 14:17:56,034 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 103 [2025-03-08 14:17:56,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:17:56,036 INFO L225 Difference]: With dead ends: 154 [2025-03-08 14:17:56,036 INFO L226 Difference]: Without dead ends: 109 [2025-03-08 14:17:56,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2025-03-08 14:17:56,037 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 178 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 14:17:56,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 140 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 14:17:56,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-08 14:17:56,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 53. [2025-03-08 14:17:56,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 14:17:56,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 73 transitions. [2025-03-08 14:17:56,048 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 73 transitions. Word has length 103 [2025-03-08 14:17:56,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:17:56,048 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 73 transitions. [2025-03-08 14:17:56,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 14:17:56,049 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 73 transitions. [2025-03-08 14:17:56,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 14:17:56,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:17:56,050 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:17:56,059 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-03-08 14:17:56,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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-08 14:17:56,251 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:17:56,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:17:56,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1389256176, now seen corresponding path program 1 times [2025-03-08 14:17:56,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:17:56,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2145599657] [2025-03-08 14:17:56,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:17:56,252 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-08 14:17:56,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:17:56,254 INFO L229 MonitoredProcess]: Starting monitored process 4 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-08 14:17:56,255 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 (4)] Waiting until timeout for monitored process [2025-03-08 14:17:56,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 14:17:56,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 14:17:56,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:17:56,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:17:56,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 14:17:56,479 INFO L279 TraceCheckSpWp]: Computing forward predicates...