./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/rlim_invariant.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/rlim_invariant.c.v+lhb-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 b4d60c093ba6c9dcaff9815fcaab264eab148dbcfff5c12da0f56175eb222a22 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 12:46:30,309 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 12:46:30,366 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 12:46:30,373 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 12:46:30,373 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 12:46:30,392 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 12:46:30,393 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 12:46:30,393 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 12:46:30,393 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 12:46:30,393 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 12:46:30,394 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 12:46:30,394 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 12:46:30,394 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 12:46:30,394 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 12:46:30,395 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 12:46:30,395 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 12:46:30,395 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 12:46:30,395 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 12:46:30,395 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 12:46:30,395 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 12:46:30,395 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 12:46:30,396 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 12:46:30,396 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 12:46:30,396 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 12:46:30,396 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 12:46:30,396 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 12:46:30,396 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 12:46:30,396 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 12:46:30,396 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 12:46:30,396 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 12:46:30,396 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 12:46:30,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 12:46:30,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:46:30,397 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 12:46:30,397 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 12:46:30,397 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 12:46:30,397 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 12:46:30,397 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 12:46:30,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 12:46:30,397 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 12:46:30,397 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 12:46:30,397 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 12:46:30,398 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 12:46:30,398 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-jdk21/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 -> b4d60c093ba6c9dcaff9815fcaab264eab148dbcfff5c12da0f56175eb222a22 [2025-02-05 12:46:30,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 12:46:30,641 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 12:46:30,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 12:46:30,646 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 12:46:30,646 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 12:46:30,647 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/rlim_invariant.c.v+lhb-reducer.c [2025-02-05 12:46:31,780 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bf6fd88a9/198f6d1c5e1e436abf7f064d7085a392/FLAG0f8306b68 [2025-02-05 12:46:31,992 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 12:46:31,993 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.v+lhb-reducer.c [2025-02-05 12:46:31,999 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bf6fd88a9/198f6d1c5e1e436abf7f064d7085a392/FLAG0f8306b68 [2025-02-05 12:46:32,347 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bf6fd88a9/198f6d1c5e1e436abf7f064d7085a392 [2025-02-05 12:46:32,349 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 12:46:32,350 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 12:46:32,351 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 12:46:32,351 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 12:46:32,354 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 12:46:32,354 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:46:32" (1/1) ... [2025-02-05 12:46:32,355 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f100305 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:32, skipping insertion in model container [2025-02-05 12:46:32,355 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:46:32" (1/1) ... [2025-02-05 12:46:32,372 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 12:46:32,492 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.v+lhb-reducer.c[1494,1507] [2025-02-05 12:46:32,503 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.v+lhb-reducer.c[2698,2711] [2025-02-05 12:46:32,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:46:32,520 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 12:46:32,537 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.v+lhb-reducer.c[1494,1507] [2025-02-05 12:46:32,541 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.v+lhb-reducer.c[2698,2711] [2025-02-05 12:46:32,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:46:32,559 INFO L204 MainTranslator]: Completed translation [2025-02-05 12:46:32,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:32 WrapperNode [2025-02-05 12:46:32,559 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 12:46:32,560 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 12:46:32,560 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 12:46:32,560 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 12:46:32,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:32" (1/1) ... [2025-02-05 12:46:32,571 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:32" (1/1) ... [2025-02-05 12:46:32,586 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 161 [2025-02-05 12:46:32,587 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 12:46:32,588 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 12:46:32,588 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 12:46:32,588 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 12:46:32,593 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:32" (1/1) ... [2025-02-05 12:46:32,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:32" (1/1) ... [2025-02-05 12:46:32,599 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:32" (1/1) ... [2025-02-05 12:46:32,610 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-02-05 12:46:32,611 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:32" (1/1) ... [2025-02-05 12:46:32,611 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:32" (1/1) ... [2025-02-05 12:46:32,617 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:32" (1/1) ... [2025-02-05 12:46:32,618 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:32" (1/1) ... [2025-02-05 12:46:32,621 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:32" (1/1) ... [2025-02-05 12:46:32,621 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:32" (1/1) ... [2025-02-05 12:46:32,622 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 12:46:32,623 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 12:46:32,623 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 12:46:32,623 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 12:46:32,624 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:32" (1/1) ... [2025-02-05 12:46:32,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:46:32,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:46:32,650 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 12:46:32,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 12:46:32,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 12:46:32,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 12:46:32,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 12:46:32,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 12:46:32,709 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 12:46:32,710 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 12:46:32,837 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L116: havoc main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1;havoc main_~main____CPAchecker_TMP_2~1#1;havoc main_~main____CPAchecker_TMP_1~1#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1;havoc main_~main____CPAchecker_TMP_2~0#1;havoc main_~main____CPAchecker_TMP_1~0#1;havoc main_~main____CPAchecker_TMP_0~0#1; [2025-02-05 12:46:32,843 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-02-05 12:46:32,843 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 12:46:32,849 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 12:46:32,849 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 12:46:32,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:46:32 BoogieIcfgContainer [2025-02-05 12:46:32,850 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 12:46:32,851 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 12:46:32,851 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 12:46:32,854 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 12:46:32,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 12:46:32" (1/3) ... [2025-02-05 12:46:32,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@723b1c42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:46:32, skipping insertion in model container [2025-02-05 12:46:32,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:32" (2/3) ... [2025-02-05 12:46:32,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@723b1c42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:46:32, skipping insertion in model container [2025-02-05 12:46:32,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:46:32" (3/3) ... [2025-02-05 12:46:32,858 INFO L128 eAbstractionObserver]: Analyzing ICFG rlim_invariant.c.v+lhb-reducer.c [2025-02-05 12:46:32,868 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 12:46:32,869 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rlim_invariant.c.v+lhb-reducer.c that has 1 procedures, 42 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-02-05 12:46:32,901 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 12:46:32,908 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;@59ecc185, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 12:46:32,909 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 12:46:32,911 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 41 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:46:32,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-05 12:46:32,915 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:46:32,916 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:46:32,916 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:46:32,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:46:32,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1163298710, now seen corresponding path program 1 times [2025-02-05 12:46:32,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:46:32,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184324992] [2025-02-05 12:46:32,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:46:32,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:46:32,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-05 12:46:32,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-05 12:46:32,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:46:32,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:46:33,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:46:33,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:46:33,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184324992] [2025-02-05 12:46:33,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184324992] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:46:33,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:46:33,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 12:46:33,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261189607] [2025-02-05 12:46:33,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:46:33,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 12:46:33,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:46:33,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 12:46:33,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 12:46:33,125 INFO L87 Difference]: Start difference. First operand has 42 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 41 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:46:33,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:46:33,177 INFO L93 Difference]: Finished difference Result 50 states and 73 transitions. [2025-02-05 12:46:33,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 12:46:33,179 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-05 12:46:33,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:46:33,183 INFO L225 Difference]: With dead ends: 50 [2025-02-05 12:46:33,183 INFO L226 Difference]: Without dead ends: 41 [2025-02-05 12:46:33,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 12:46:33,187 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 22 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 12:46:33,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 207 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 12:46:33,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-05 12:46:33,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-02-05 12:46:33,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:46:33,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2025-02-05 12:46:33,209 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 16 [2025-02-05 12:46:33,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:46:33,209 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2025-02-05 12:46:33,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:46:33,209 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2025-02-05 12:46:33,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-05 12:46:33,210 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:46:33,210 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:46:33,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 12:46:33,210 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:46:33,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:46:33,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1164281813, now seen corresponding path program 1 times [2025-02-05 12:46:33,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:46:33,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757458408] [2025-02-05 12:46:33,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:46:33,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:46:33,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-05 12:46:33,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-05 12:46:33,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:46:33,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 12:46:33,222 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 12:46:33,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-05 12:46:33,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-05 12:46:33,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:46:33,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 12:46:33,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 12:46:33,253 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 12:46:33,254 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-02-05 12:46:33,255 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-02-05 12:46:33,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 12:46:33,258 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-05 12:46:33,274 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 12:46:33,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 12:46:33 BoogieIcfgContainer [2025-02-05 12:46:33,278 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 12:46:33,279 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 12:46:33,279 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 12:46:33,279 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 12:46:33,280 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:46:32" (3/4) ... [2025-02-05 12:46:33,281 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 12:46:33,282 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 12:46:33,282 INFO L158 Benchmark]: Toolchain (without parser) took 932.69ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 47.8MB in the end (delta: 57.3MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-05 12:46:33,283 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 12:46:33,283 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.16ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 93.6MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 12:46:33,283 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.95ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 92.0MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 12:46:33,283 INFO L158 Benchmark]: Boogie Preprocessor took 35.02ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 90.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 12:46:33,283 INFO L158 Benchmark]: IcfgBuilder took 226.70ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 76.8MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 12:46:33,283 INFO L158 Benchmark]: TraceAbstraction took 427.43ms. Allocated memory is still 142.6MB. Free memory was 76.3MB in the beginning and 48.9MB in the end (delta: 27.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-05 12:46:33,284 INFO L158 Benchmark]: Witness Printer took 2.75ms. Allocated memory is still 142.6MB. Free memory was 48.9MB in the beginning and 47.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 12:46:33,285 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.15ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.16ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 93.6MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.95ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 92.0MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.02ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 90.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 226.70ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 76.8MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 427.43ms. Allocated memory is still 142.6MB. Free memory was 76.3MB in the beginning and 48.9MB in the end (delta: 27.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Witness Printer took 2.75ms. Allocated memory is still 142.6MB. Free memory was 48.9MB in the beginning and 47.8MB in the end (delta: 1.1MB). 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: 67]: 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 49, overapproximation of someBinaryDOUBLEComparisonOperation at line 31, overapproximation of someBinaryDOUBLEComparisonOperation at line 54, overapproximation of someBinaryDOUBLEComparisonOperation at line 39, overapproximation of someBinaryDOUBLEComparisonOperation at line 33, overapproximation of someBinaryDOUBLEComparisonOperation at line 41, overapproximation of to_real at line 24, overapproximation of someBinaryArithmeticFLOAToperation at line 51, overapproximation of someBinaryArithmeticFLOAToperation at line 48. Possible FailurePath: [L1] int __return_main; [L12] int __tmp_160_0; [L13] int __tmp_160_1; [L14] int __tmp_160_2; [L15] int __return_165; VAL [__return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0] [L18] float main__X; [L19] float main__Y; [L20] float main__S; [L21] float main__R; [L22] float main__D; [L23] int main__i; [L24] main__Y = 0 [L25] main__i = 0 VAL [__return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main__i=0] [L26] COND TRUE main__i < 100000 [L28] main__X = __VERIFIER_nondet_float() [L29] main__D = __VERIFIER_nondet_float() [L30] int main____CPAchecker_TMP_0; VAL [__return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main__i=0] [L31] COND TRUE main__X >= -128.0 VAL [__return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main__i=0] [L33] COND TRUE main__X <= 128.0 [L35] main____CPAchecker_TMP_0 = 1 VAL [__return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main__i=0] [L36] COND TRUE main____CPAchecker_TMP_0 != 0 [L38] int main____CPAchecker_TMP_1; VAL [__return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main__i=0] [L39] COND TRUE main__D >= 0.0 VAL [__return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main__i=0] [L41] COND TRUE main__D <= 16.0 [L43] main____CPAchecker_TMP_1 = 1 VAL [__return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__i=0] [L44] COND TRUE main____CPAchecker_TMP_1 != 0 [L46] main__S = main__Y [L47] main__Y = main__X [L48] main__R = main__X - main__S VAL [__return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main__Y=54, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__i=0] [L49] COND TRUE main__R <= (-main__D) [L51] main__Y = main__S - main__D VAL [__return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__i=0] [L53] int main____CPAchecker_TMP_2; VAL [__return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__i=0] [L54] COND FALSE !(main__Y >= -129.0) VAL [__return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__i=0] [L205] main____CPAchecker_TMP_2 = 0 VAL [__return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__i=0] [L61] int __tmp_1; [L62] __tmp_1 = main____CPAchecker_TMP_2 [L63] int __VERIFIER_assert__cond; [L64] __VERIFIER_assert__cond = __tmp_1 VAL [__VERIFIER_assert__cond=0, __return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__i=0] [L65] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__i=0] [L67] reach_error() VAL [__return_165=0, __return_main=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__i=0] - UnprovableResult [Line: 123]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 42 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22 mSDsluCounter, 207 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 147 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23 IncrementalHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 60 mSDtfsCounter, 23 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 32 NumberOfCodeBlocks, 32 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 23 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 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-02-05 12:46:33,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/rlim_invariant.c.v+lhb-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 b4d60c093ba6c9dcaff9815fcaab264eab148dbcfff5c12da0f56175eb222a22 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 12:46:35,098 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 12:46:35,168 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 12:46:35,173 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 12:46:35,173 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 12:46:35,194 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 12:46:35,195 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 12:46:35,195 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 12:46:35,195 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 12:46:35,195 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 12:46:35,196 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 12:46:35,196 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 12:46:35,196 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 12:46:35,196 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 12:46:35,196 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 12:46:35,197 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 12:46:35,197 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 12:46:35,197 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 12:46:35,197 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 12:46:35,197 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 12:46:35,197 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 12:46:35,197 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 12:46:35,197 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 12:46:35,197 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 12:46:35,197 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 12:46:35,197 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 12:46:35,197 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 12:46:35,197 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 12:46:35,197 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 12:46:35,197 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 12:46:35,198 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 12:46:35,198 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 12:46:35,198 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 12:46:35,198 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 12:46:35,198 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:46:35,198 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 12:46:35,198 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 12:46:35,198 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 12:46:35,198 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 12:46:35,198 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 12:46:35,198 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 12:46:35,198 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 12:46:35,199 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 12:46:35,199 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 12:46:35,199 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 12:46:35,199 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-jdk21/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 -> b4d60c093ba6c9dcaff9815fcaab264eab148dbcfff5c12da0f56175eb222a22 [2025-02-05 12:46:35,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 12:46:35,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 12:46:35,446 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 12:46:35,447 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 12:46:35,447 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 12:46:35,449 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/rlim_invariant.c.v+lhb-reducer.c [2025-02-05 12:46:36,638 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/51b31b91a/def5b34583dd48fdb8dc5131a156741c/FLAG7dd536c43 [2025-02-05 12:46:36,844 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 12:46:36,844 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.v+lhb-reducer.c [2025-02-05 12:46:36,850 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/51b31b91a/def5b34583dd48fdb8dc5131a156741c/FLAG7dd536c43 [2025-02-05 12:46:37,201 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/51b31b91a/def5b34583dd48fdb8dc5131a156741c [2025-02-05 12:46:37,203 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 12:46:37,204 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 12:46:37,205 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 12:46:37,205 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 12:46:37,210 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 12:46:37,210 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:46:37" (1/1) ... [2025-02-05 12:46:37,211 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@219a8fc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:37, skipping insertion in model container [2025-02-05 12:46:37,211 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:46:37" (1/1) ... [2025-02-05 12:46:37,222 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 12:46:37,342 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.v+lhb-reducer.c[1494,1507] [2025-02-05 12:46:37,349 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.v+lhb-reducer.c[2698,2711] [2025-02-05 12:46:37,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:46:37,365 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 12:46:37,377 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.v+lhb-reducer.c[1494,1507] [2025-02-05 12:46:37,380 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.v+lhb-reducer.c[2698,2711] [2025-02-05 12:46:37,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:46:37,395 INFO L204 MainTranslator]: Completed translation [2025-02-05 12:46:37,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:37 WrapperNode [2025-02-05 12:46:37,396 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 12:46:37,397 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 12:46:37,397 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 12:46:37,397 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 12:46:37,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:37" (1/1) ... [2025-02-05 12:46:37,409 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:37" (1/1) ... [2025-02-05 12:46:37,424 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 162 [2025-02-05 12:46:37,424 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 12:46:37,424 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 12:46:37,425 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 12:46:37,425 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 12:46:37,429 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:37" (1/1) ... [2025-02-05 12:46:37,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:37" (1/1) ... [2025-02-05 12:46:37,432 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:37" (1/1) ... [2025-02-05 12:46:37,440 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-02-05 12:46:37,441 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:37" (1/1) ... [2025-02-05 12:46:37,441 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:37" (1/1) ... [2025-02-05 12:46:37,445 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:37" (1/1) ... [2025-02-05 12:46:37,446 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:37" (1/1) ... [2025-02-05 12:46:37,447 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:37" (1/1) ... [2025-02-05 12:46:37,447 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:37" (1/1) ... [2025-02-05 12:46:37,449 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 12:46:37,449 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 12:46:37,449 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 12:46:37,449 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 12:46:37,450 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:37" (1/1) ... [2025-02-05 12:46:37,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:46:37,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:46:37,476 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 12:46:37,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 12:46:37,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 12:46:37,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 12:46:37,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 12:46:37,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 12:46:37,562 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 12:46:37,564 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 12:46:38,914 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L116: havoc main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1;havoc main_~main____CPAchecker_TMP_2~1#1;havoc main_~main____CPAchecker_TMP_1~1#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1;havoc main_~main____CPAchecker_TMP_2~0#1;havoc main_~main____CPAchecker_TMP_1~0#1;havoc main_~main____CPAchecker_TMP_0~0#1; [2025-02-05 12:46:38,921 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2025-02-05 12:46:38,922 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 12:46:38,928 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 12:46:38,928 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 12:46:38,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:46:38 BoogieIcfgContainer [2025-02-05 12:46:38,928 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 12:46:38,930 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 12:46:38,930 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 12:46:38,933 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 12:46:38,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 12:46:37" (1/3) ... [2025-02-05 12:46:38,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@378d9f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:46:38, skipping insertion in model container [2025-02-05 12:46:38,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:46:37" (2/3) ... [2025-02-05 12:46:38,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@378d9f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:46:38, skipping insertion in model container [2025-02-05 12:46:38,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:46:38" (3/3) ... [2025-02-05 12:46:38,935 INFO L128 eAbstractionObserver]: Analyzing ICFG rlim_invariant.c.v+lhb-reducer.c [2025-02-05 12:46:38,945 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 12:46:38,946 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rlim_invariant.c.v+lhb-reducer.c that has 1 procedures, 42 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-02-05 12:46:38,978 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 12:46:38,986 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;@44a6ce7b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 12:46:38,986 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 12:46:38,989 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 41 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:46:38,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-05 12:46:38,992 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:46:38,992 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:46:38,993 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:46:38,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:46:38,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1163298710, now seen corresponding path program 1 times [2025-02-05 12:46:39,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 12:46:39,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1971186339] [2025-02-05 12:46:39,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:46:39,005 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-02-05 12:46:39,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 12:46:39,008 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-02-05 12:46:39,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 12:46:39,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-05 12:46:39,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-05 12:46:39,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:46:39,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:46:39,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 12:46:39,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:46:39,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:46:39,169 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 12:46:39,169 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 12:46:39,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1971186339] [2025-02-05 12:46:39,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1971186339] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:46:39,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:46:39,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 12:46:39,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512908683] [2025-02-05 12:46:39,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:46:39,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:46:39,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 12:46:39,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:46:39,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:46:39,191 INFO L87 Difference]: Start difference. First operand has 42 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 41 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:46:39,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:46:39,244 INFO L93 Difference]: Finished difference Result 49 states and 72 transitions. [2025-02-05 12:46:39,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:46:39,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-05 12:46:39,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:46:39,249 INFO L225 Difference]: With dead ends: 49 [2025-02-05 12:46:39,249 INFO L226 Difference]: Without dead ends: 41 [2025-02-05 12:46:39,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 12:46:39,252 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 1 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 12:46:39,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 175 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 12:46:39,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-05 12:46:39,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-02-05 12:46:39,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 39 states have (on average 1.358974358974359) internal successors, (53), 40 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:46:39,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2025-02-05 12:46:39,278 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 16 [2025-02-05 12:46:39,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:46:39,279 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2025-02-05 12:46:39,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:46:39,279 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2025-02-05 12:46:39,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-05 12:46:39,279 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:46:39,279 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:46:39,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-05 12:46:39,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-02-05 12:46:39,485 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:46:39,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:46:39,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1164281813, now seen corresponding path program 1 times [2025-02-05 12:46:39,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 12:46:39,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [445893582] [2025-02-05 12:46:39,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:46:39,486 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-02-05 12:46:39,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 12:46:39,488 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-02-05 12:46:39,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 12:46:39,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-05 12:46:39,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-05 12:46:39,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:46:39,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:46:39,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 12:46:39,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:46:43,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:46:43,575 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 12:46:43,575 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 12:46:43,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [445893582] [2025-02-05 12:46:43,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [445893582] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:46:43,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:46:43,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 12:46:43,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039743912] [2025-02-05 12:46:43,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:46:43,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 12:46:43,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 12:46:43,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 12:46:43,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 12:46:43,577 INFO L87 Difference]: Start difference. First operand 41 states and 53 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:46:44,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-05 12:46:47,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 12:46:51,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.78s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 12:46:55,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 12:47:01,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 12:47:07,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 12:47:12,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 12:47:14,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 12:47:19,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 12:47:22,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 12:47:23,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:47:23,934 INFO L93 Difference]: Finished difference Result 86 states and 112 transitions. [2025-02-05 12:47:23,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 12:47:23,938 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-05 12:47:23,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:47:23,939 INFO L225 Difference]: With dead ends: 86 [2025-02-05 12:47:23,939 INFO L226 Difference]: Without dead ends: 61 [2025-02-05 12:47:23,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 12:47:23,940 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 84 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:47:23,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 80 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 3 Unknown, 0 Unchecked, 40.3s Time] [2025-02-05 12:47:23,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-05 12:47:23,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 43. [2025-02-05 12:47:23,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:47:23,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2025-02-05 12:47:23,943 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 16 [2025-02-05 12:47:23,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:47:23,943 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2025-02-05 12:47:23,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:47:23,944 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2025-02-05 12:47:23,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-05 12:47:23,944 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:47:23,944 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:47:23,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Ended with exit code 0 [2025-02-05 12:47:24,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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-02-05 12:47:24,145 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:47:24,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:47:24,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1705385181, now seen corresponding path program 1 times [2025-02-05 12:47:24,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 12:47:24,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1656981161] [2025-02-05 12:47:24,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:47:24,145 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-02-05 12:47:24,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 12:47:24,147 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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-02-05 12:47:24,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 12:47:24,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-05 12:47:24,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-05 12:47:24,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:47:24,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:47:24,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 12:47:24,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:47:29,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:47:29,748 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 12:47:29,748 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 12:47:29,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1656981161] [2025-02-05 12:47:29,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1656981161] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:47:29,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:47:29,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 12:47:29,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704703642] [2025-02-05 12:47:29,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:47:29,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 12:47:29,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 12:47:29,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 12:47:29,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-02-05 12:47:29,749 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:47:33,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 12:47:39,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:47:39,986 INFO L93 Difference]: Finished difference Result 81 states and 106 transitions. [2025-02-05 12:47:39,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 12:47:39,994 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-05 12:47:39,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:47:39,995 INFO L225 Difference]: With dead ends: 81 [2025-02-05 12:47:39,995 INFO L226 Difference]: Without dead ends: 56 [2025-02-05 12:47:39,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-02-05 12:47:39,996 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 59 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2025-02-05 12:47:39,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 68 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2025-02-05 12:47:39,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-05 12:47:39,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 44. [2025-02-05 12:47:39,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 43 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:47:39,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2025-02-05 12:47:39,999 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 17 [2025-02-05 12:47:39,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:47:39,999 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2025-02-05 12:47:40,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:47:40,000 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2025-02-05 12:47:40,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-05 12:47:40,000 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:47:40,000 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:47:40,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Ended with exit code 0 [2025-02-05 12:47:40,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/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-02-05 12:47:40,201 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:47:40,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:47:40,201 INFO L85 PathProgramCache]: Analyzing trace with hash 285704027, now seen corresponding path program 1 times [2025-02-05 12:47:40,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 12:47:40,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1187183864] [2025-02-05 12:47:40,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:47:40,201 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-02-05 12:47:40,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 12:47:40,205 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/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-02-05 12:47:40,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (5)] Waiting until timeout for monitored process [2025-02-05 12:47:40,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-05 12:47:40,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-05 12:47:40,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:47:40,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:47:40,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 12:47:40,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:47:43,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:47:43,005 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 12:47:43,005 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 12:47:43,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1187183864] [2025-02-05 12:47:43,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1187183864] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:47:43,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:47:43,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 12:47:43,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830513881] [2025-02-05 12:47:43,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:47:43,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 12:47:43,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 12:47:43,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 12:47:43,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 12:47:43,006 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:47:56,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:47:56,452 INFO L93 Difference]: Finished difference Result 89 states and 115 transitions. [2025-02-05 12:47:56,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 12:47:56,459 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-05 12:47:56,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:47:56,459 INFO L225 Difference]: With dead ends: 89 [2025-02-05 12:47:56,459 INFO L226 Difference]: Without dead ends: 64 [2025-02-05 12:47:56,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 12:47:56,460 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 62 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2025-02-05 12:47:56,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 136 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 13.4s Time] [2025-02-05 12:47:56,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-05 12:47:56,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 46. [2025-02-05 12:47:56,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 45 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:47:56,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2025-02-05 12:47:56,463 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 17 [2025-02-05 12:47:56,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:47:56,463 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2025-02-05 12:47:56,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:47:56,463 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2025-02-05 12:47:56,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-05 12:47:56,463 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:47:56,464 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:47:56,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (5)] Ended with exit code 0 [2025-02-05 12:47:56,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/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-02-05 12:47:56,664 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:47:56,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:47:56,665 INFO L85 PathProgramCache]: Analyzing trace with hash 2060711389, now seen corresponding path program 1 times [2025-02-05 12:47:56,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 12:47:56,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [534521467] [2025-02-05 12:47:56,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:47:56,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-02-05 12:47:56,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 12:47:56,667 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/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-02-05 12:47:56,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (6)] Waiting until timeout for monitored process [2025-02-05 12:47:56,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-05 12:47:56,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-05 12:47:56,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:47:56,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:47:56,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 12:47:56,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:47:59,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:47:59,509 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 12:47:59,510 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 12:47:59,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [534521467] [2025-02-05 12:47:59,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [534521467] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:47:59,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:47:59,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 12:47:59,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877487252] [2025-02-05 12:47:59,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:47:59,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 12:47:59,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 12:47:59,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 12:47:59,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 12:47:59,511 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)