./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/gcd_1+newton_3_8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/combinations/gcd_1+newton_3_8.i -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 fb60664eb219cfca617a3a97a655d40aa192b004d90693207c446e4cc68b6381 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:46:05,641 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:46:05,716 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 21:46:05,724 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:46:05,726 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:46:05,745 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:46:05,746 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:46:05,747 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:46:05,747 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:46:05,747 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:46:05,748 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:46:05,749 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:46:05,749 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:46:05,749 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:46:05,749 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:46:05,749 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:46:05,750 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:46:05,750 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:46:05,750 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:46:05,750 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:46:05,750 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:46:05,750 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:46:05,750 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:46:05,750 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:46:05,750 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:46:05,750 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:46:05,750 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:46:05,750 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:46:05,750 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:46:05,750 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:46:05,751 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:46:05,751 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:46:05,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:46:05,752 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:46:05,752 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:46:05,752 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:46:05,752 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:46:05,752 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:46:05,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:46:05,752 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:46:05,752 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:46:05,753 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:46:05,753 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:46:05,753 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 -> fb60664eb219cfca617a3a97a655d40aa192b004d90693207c446e4cc68b6381 [2025-02-07 21:46:06,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:46:06,067 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:46:06,071 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:46:06,073 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:46:06,073 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:46:06,074 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_1+newton_3_8.i [2025-02-07 21:46:07,370 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f21a79c59/e16e218a15294f7b8c2a36daf17d7d22/FLAG8376d4bca [2025-02-07 21:46:07,584 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:46:07,586 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/gcd_1+newton_3_8.i [2025-02-07 21:46:07,608 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f21a79c59/e16e218a15294f7b8c2a36daf17d7d22/FLAG8376d4bca [2025-02-07 21:46:07,628 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f21a79c59/e16e218a15294f7b8c2a36daf17d7d22 [2025-02-07 21:46:07,630 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:46:07,633 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:46:07,634 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:46:07,635 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:46:07,638 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:46:07,639 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:46:07" (1/1) ... [2025-02-07 21:46:07,642 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a098044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:07, skipping insertion in model container [2025-02-07 21:46:07,642 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:46:07" (1/1) ... [2025-02-07 21:46:07,660 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:46:07,805 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/combinations/gcd_1+newton_3_8.i[1226,1239] [2025-02-07 21:46:07,826 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/combinations/gcd_1+newton_3_8.i[2828,2841] [2025-02-07 21:46:07,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:46:07,839 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:46:07,848 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/combinations/gcd_1+newton_3_8.i[1226,1239] [2025-02-07 21:46:07,857 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/combinations/gcd_1+newton_3_8.i[2828,2841] [2025-02-07 21:46:07,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:46:07,872 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:46:07,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:07 WrapperNode [2025-02-07 21:46:07,873 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:46:07,873 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:46:07,873 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:46:07,873 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:46:07,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:07" (1/1) ... [2025-02-07 21:46:07,892 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:07" (1/1) ... [2025-02-07 21:46:07,916 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 88 [2025-02-07 21:46:07,918 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:46:07,919 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:46:07,919 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:46:07,919 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:46:07,928 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:07" (1/1) ... [2025-02-07 21:46:07,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:07" (1/1) ... [2025-02-07 21:46:07,932 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:07" (1/1) ... [2025-02-07 21:46:07,951 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-02-07 21:46:07,952 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:07" (1/1) ... [2025-02-07 21:46:07,952 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:07" (1/1) ... [2025-02-07 21:46:07,961 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:07" (1/1) ... [2025-02-07 21:46:07,962 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:07" (1/1) ... [2025-02-07 21:46:07,963 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:07" (1/1) ... [2025-02-07 21:46:07,968 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:07" (1/1) ... [2025-02-07 21:46:07,974 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:46:07,975 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:46:07,975 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:46:07,975 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:46:07,975 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:07" (1/1) ... [2025-02-07 21:46:07,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:46:07,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:46:08,006 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-07 21:46:08,009 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-07 21:46:08,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:46:08,026 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2025-02-07 21:46:08,026 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2025-02-07 21:46:08,026 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-02-07 21:46:08,026 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-02-07 21:46:08,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:46:08,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 21:46:08,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:46:08,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:46:08,085 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:46:08,086 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:46:08,225 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L27: assume false;assume false; [2025-02-07 21:46:08,225 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L27: assume !false; [2025-02-07 21:46:08,225 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56: havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; [2025-02-07 21:46:08,225 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54: main1_#t~ret7#1 := gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1, gcd_test_~t~0#1;havoc gcd_test_#in~a#1, gcd_test_#in~b#1;assume { :end_inline_gcd_test } true;assume -128 <= main1_#t~ret7#1 && main1_#t~ret7#1 <= 127;main1_~g~0#1 := main1_#t~ret7#1;havoc main1_#t~ret7#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main1_~g~0#1 == main1_~y~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; [2025-02-07 21:46:08,225 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1: #t~ret18#1 := main_#res#1;havoc main_#t~nondet15#1, main_#t~ret16#1, main_#t~ret17#1;assume { :end_inline_main } true; [2025-02-07 21:46:08,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2025-02-07 21:46:08,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L26: assume 0 == __VERIFIER_assert_~cond#1; [2025-02-07 21:46:08,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L26: assume !(0 == __VERIFIER_assert_~cond#1); [2025-02-07 21:46:08,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L111: main_#t~ret17#1 := main2_#res#1;havoc main2_#t~nondet8#1, main2_#t~ret9#1, main2_#t~ret10#1, main2_#t~ret11#1, main2_#t~ret12#1, main2_#t~ret13#1, main2_#t~ret14#1, main2_~IN~0#1, main2_~x~1#1;assume { :end_inline_main2 } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; [2025-02-07 21:46:08,226 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109: main_#t~ret16#1 := main1_#res#1;havoc main1_#t~nondet5#1, main1_#t~nondet6#1, main1_#t~ret7#1, main1_~x~0#1, main1_~y~0#1, main1_~g~0#1;assume { :end_inline_main1 } true;assume -2147483648 <= main_#t~ret16#1 && main_#t~ret16#1 <= 2147483647; [2025-02-07 21:46:08,256 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-02-07 21:46:08,257 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:46:08,268 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:46:08,268 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:46:08,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:46:08 BoogieIcfgContainer [2025-02-07 21:46:08,269 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:46:08,272 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:46:08,273 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:46:08,276 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:46:08,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:46:07" (1/3) ... [2025-02-07 21:46:08,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e3dfd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:46:08, skipping insertion in model container [2025-02-07 21:46:08,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:07" (2/3) ... [2025-02-07 21:46:08,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e3dfd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:46:08, skipping insertion in model container [2025-02-07 21:46:08,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:46:08" (3/3) ... [2025-02-07 21:46:08,279 INFO L128 eAbstractionObserver]: Analyzing ICFG gcd_1+newton_3_8.i [2025-02-07 21:46:08,291 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:46:08,293 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG gcd_1+newton_3_8.i that has 3 procedures, 32 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-02-07 21:46:08,344 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:46:08,356 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;@6b234079, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:46:08,357 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-07 21:46:08,360 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 22 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 21:46:08,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-07 21:46:08,367 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:46:08,368 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:46:08,368 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:46:08,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:46:08,372 INFO L85 PathProgramCache]: Analyzing trace with hash 188303393, now seen corresponding path program 1 times [2025-02-07 21:46:08,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:46:08,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860567351] [2025-02-07 21:46:08,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:46:08,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:46:08,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-07 21:46:08,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-07 21:46:08,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:46:08,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:46:08,510 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-07 21:46:08,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:46:08,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860567351] [2025-02-07 21:46:08,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860567351] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:46:08,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:46:08,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 21:46:08,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560030398] [2025-02-07 21:46:08,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:46:08,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 21:46:08,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:46:08,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 21:46:08,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 21:46:08,542 INFO L87 Difference]: Start difference. First operand has 31 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 22 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-07 21:46:08,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:46:08,562 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2025-02-07 21:46:08,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 21:46:08,564 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 33 [2025-02-07 21:46:08,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:46:08,569 INFO L225 Difference]: With dead ends: 52 [2025-02-07 21:46:08,570 INFO L226 Difference]: Without dead ends: 22 [2025-02-07 21:46:08,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 21:46:08,576 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:46:08,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:46:08,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-02-07 21:46:08,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-02-07 21:46:08,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.0) internal successors, (13), 13 states have internal predecessors, (13), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 21:46:08,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2025-02-07 21:46:08,611 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 33 [2025-02-07 21:46:08,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:46:08,611 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-02-07 21:46:08,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-07 21:46:08,611 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2025-02-07 21:46:08,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-07 21:46:08,616 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:46:08,617 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:46:08,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 21:46:08,617 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:46:08,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:46:08,618 INFO L85 PathProgramCache]: Analyzing trace with hash 539103330, now seen corresponding path program 1 times [2025-02-07 21:46:08,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:46:08,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091494607] [2025-02-07 21:46:08,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:46:08,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:46:08,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-07 21:46:08,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-07 21:46:08,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:46:08,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 21:46:08,660 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 21:46:08,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-07 21:46:08,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-07 21:46:08,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:46:08,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 21:46:08,706 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 21:46:08,707 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 21:46:08,708 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-02-07 21:46:08,710 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-02-07 21:46:08,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 21:46:08,714 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-07 21:46:08,735 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 21:46:08,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 09:46:08 BoogieIcfgContainer [2025-02-07 21:46:08,740 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 21:46:08,741 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 21:46:08,741 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 21:46:08,742 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 21:46:08,742 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:46:08" (3/4) ... [2025-02-07 21:46:08,744 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-07 21:46:08,745 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 21:46:08,746 INFO L158 Benchmark]: Toolchain (without parser) took 1114.16ms. Allocated memory is still 142.6MB. Free memory was 113.8MB in the beginning and 61.1MB in the end (delta: 52.7MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-02-07 21:46:08,746 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:46:08,747 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.87ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 101.6MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:46:08,747 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.44ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 100.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:46:08,747 INFO L158 Benchmark]: Boogie Preprocessor took 54.71ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 98.3MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:46:08,748 INFO L158 Benchmark]: IcfgBuilder took 294.80ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 84.0MB in the end (delta: 14.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:46:08,748 INFO L158 Benchmark]: TraceAbstraction took 467.92ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 61.1MB in the end (delta: 22.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-07 21:46:08,748 INFO L158 Benchmark]: Witness Printer took 4.07ms. Allocated memory is still 142.6MB. Free memory is still 61.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:46:08,750 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.27ms. Allocated memory is still 201.3MB. Free memory is still 124.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 238.87ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 101.6MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.44ms. Allocated memory is still 142.6MB. Free memory was 101.6MB in the beginning and 100.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.71ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 98.3MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 294.80ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 84.0MB in the end (delta: 14.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 467.92ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 61.1MB in the end (delta: 22.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Witness Printer took 4.07ms. Allocated memory is still 142.6MB. Free memory is still 61.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: 102]: 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 91, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryArithmeticFLOAToperation at line 80, overapproximation of someBinaryArithmeticFLOAToperation at line 97, overapproximation of someBinaryArithmeticFLOAToperation at line 95, overapproximation of someBinaryArithmeticFLOAToperation at line 85, overapproximation of someBinaryArithmeticFLOAToperation at line 93. Possible FailurePath: [L108] COND FALSE !(__VERIFIER_nondet_int()) [L111] CALL main2() [L90] float IN = __VERIFIER_nondet_float(); [L91] CALL assume_abort_if_not(IN > -2.0f && IN < 2.0f) [L75] COND FALSE !(!cond) [L91] RET assume_abort_if_not(IN > -2.0f && IN < 2.0f) [L93] CALL, EXPR f(IN) VAL [\old(x)=110] [L80] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=110] [L93] RET, EXPR f(IN) VAL [IN=110] [L93] CALL, EXPR fp(IN) VAL [\old(x)=110] [L85] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=110] [L93] RET, EXPR fp(IN) VAL [IN=110] [L93] float x = IN - f(IN)/fp(IN); [L95] CALL, EXPR f(x) VAL [\old(x)=112] [L80] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=112] [L95] RET, EXPR f(x) VAL [IN=110, x=112] [L95] CALL, EXPR fp(x) VAL [\old(x)=112] [L85] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=112] [L95] RET, EXPR fp(x) VAL [IN=110, x=112] [L95] x = x - f(x)/fp(x) [L97] CALL, EXPR f(x) VAL [\old(x)=111] [L80] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=111] [L97] RET, EXPR f(x) VAL [IN=110, x=111] [L97] CALL, EXPR fp(x) VAL [\old(x)=111] [L85] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=111] [L97] RET, EXPR fp(x) VAL [IN=110, x=111] [L97] x = x - f(x)/fp(x) [L101] COND TRUE !(x < 0.1) VAL [IN=110] [L102] reach_error() VAL [IN=110] - UnprovableResult [Line: 27]: 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 3 procedures, 32 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 37 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 37 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 66 NumberOfCodeBlocks, 66 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 32 ConstructedInterpolants, 0 QuantifiedInterpolants, 32 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 18/18 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-07 21:46:08,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-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/combinations/gcd_1+newton_3_8.i -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 fb60664eb219cfca617a3a97a655d40aa192b004d90693207c446e4cc68b6381 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:46:10,990 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:46:11,090 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-07 21:46:11,096 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:46:11,097 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:46:11,128 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:46:11,130 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:46:11,130 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:46:11,131 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:46:11,131 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:46:11,132 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:46:11,133 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:46:11,133 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:46:11,133 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:46:11,133 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:46:11,133 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:46:11,133 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:46:11,133 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:46:11,133 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:46:11,134 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:46:11,134 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:46:11,134 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:46:11,134 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:46:11,134 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-07 21:46:11,134 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-07 21:46:11,134 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-07 21:46:11,134 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:46:11,134 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:46:11,134 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:46:11,134 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:46:11,134 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:46:11,134 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:46:11,134 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:46:11,134 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:46:11,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:46:11,135 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:46:11,135 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:46:11,135 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:46:11,135 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:46:11,135 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-07 21:46:11,135 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-07 21:46:11,135 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:46:11,135 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:46:11,135 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:46:11,135 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:46:11,135 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 -> fb60664eb219cfca617a3a97a655d40aa192b004d90693207c446e4cc68b6381 [2025-02-07 21:46:11,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:46:11,486 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:46:11,488 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:46:11,489 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:46:11,489 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:46:11,490 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_1+newton_3_8.i [2025-02-07 21:46:12,885 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b76aa4f32/e352bdc3eee44f01aec67609dfe92d4a/FLAGd632c0ed2 [2025-02-07 21:46:13,129 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:46:13,130 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/gcd_1+newton_3_8.i [2025-02-07 21:46:13,138 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b76aa4f32/e352bdc3eee44f01aec67609dfe92d4a/FLAGd632c0ed2 [2025-02-07 21:46:13,156 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b76aa4f32/e352bdc3eee44f01aec67609dfe92d4a [2025-02-07 21:46:13,162 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:46:13,164 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:46:13,165 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:46:13,165 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:46:13,170 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:46:13,172 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:46:13" (1/1) ... [2025-02-07 21:46:13,173 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55ba2cdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:13, skipping insertion in model container [2025-02-07 21:46:13,173 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:46:13" (1/1) ... [2025-02-07 21:46:13,189 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:46:13,329 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/combinations/gcd_1+newton_3_8.i[1226,1239] [2025-02-07 21:46:13,366 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/combinations/gcd_1+newton_3_8.i[2828,2841] [2025-02-07 21:46:13,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:46:13,383 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:46:13,398 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/combinations/gcd_1+newton_3_8.i[1226,1239] [2025-02-07 21:46:13,416 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/combinations/gcd_1+newton_3_8.i[2828,2841] [2025-02-07 21:46:13,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:46:13,433 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:46:13,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:13 WrapperNode [2025-02-07 21:46:13,434 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:46:13,436 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:46:13,436 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:46:13,436 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:46:13,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:13" (1/1) ... [2025-02-07 21:46:13,454 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:13" (1/1) ... [2025-02-07 21:46:13,477 INFO L138 Inliner]: procedures = 28, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 83 [2025-02-07 21:46:13,479 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:46:13,480 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:46:13,480 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:46:13,480 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:46:13,488 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:13" (1/1) ... [2025-02-07 21:46:13,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:13" (1/1) ... [2025-02-07 21:46:13,499 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:13" (1/1) ... [2025-02-07 21:46:13,515 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-02-07 21:46:13,517 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:13" (1/1) ... [2025-02-07 21:46:13,517 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:13" (1/1) ... [2025-02-07 21:46:13,527 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:13" (1/1) ... [2025-02-07 21:46:13,530 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:13" (1/1) ... [2025-02-07 21:46:13,532 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:13" (1/1) ... [2025-02-07 21:46:13,533 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:13" (1/1) ... [2025-02-07 21:46:13,539 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:46:13,540 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:46:13,542 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:46:13,543 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:46:13,544 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:13" (1/1) ... [2025-02-07 21:46:13,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:46:13,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:46:13,583 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-07 21:46:13,591 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-07 21:46:13,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:46:13,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-07 21:46:13,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-07 21:46:13,613 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2025-02-07 21:46:13,614 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2025-02-07 21:46:13,614 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-02-07 21:46:13,614 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-02-07 21:46:13,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:46:13,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:46:13,692 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:46:13,694 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:46:24,069 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L27: assume false;assume false; [2025-02-07 21:46:24,069 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L27: assume !false; [2025-02-07 21:46:24,069 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L56: havoc __VERIFIER_assert_~cond#1;havoc __VERIFIER_assert_#in~cond#1;assume { :end_inline___VERIFIER_assert } true; [2025-02-07 21:46:24,069 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L54: main1_#t~ret7#1 := gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1, gcd_test_~t~0#1;havoc gcd_test_#in~a#1, gcd_test_#in~b#1;assume { :end_inline_gcd_test } true;main1_~g~0#1 := main1_#t~ret7#1;havoc main1_#t~ret7#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~sign_extend~32~8(main1_~g~0#1) == ~sign_extend~32~8(main1_~y~0#1) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; [2025-02-07 21:46:24,070 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L-1: #t~ret18#1 := main_#res#1;havoc main_#t~nondet15#1, main_#t~ret16#1, main_#t~ret17#1;assume { :end_inline_main } true; [2025-02-07 21:46:24,070 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2025-02-07 21:46:24,070 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L26: assume 0bv32 == __VERIFIER_assert_~cond#1; [2025-02-07 21:46:24,070 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L26: assume !(0bv32 == __VERIFIER_assert_~cond#1); [2025-02-07 21:46:24,070 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L111: main_#t~ret17#1 := main2_#res#1;havoc main2_#t~nondet8#1, main2_#t~ret9#1, main2_#t~ret10#1, main2_#t~ret11#1, main2_#t~ret12#1, main2_#t~ret13#1, main2_#t~ret14#1, main2_~IN~0#1, main2_~x~1#1;assume { :end_inline_main2 } true; [2025-02-07 21:46:24,070 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L109: main_#t~ret16#1 := main1_#res#1;havoc main1_#t~nondet5#1, main1_#t~nondet6#1, main1_#t~ret7#1, main1_~x~0#1, main1_~y~0#1, main1_~g~0#1;assume { :end_inline_main1 } true; [2025-02-07 21:46:28,186 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-02-07 21:46:28,186 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:46:28,195 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:46:28,195 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:46:28,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:46:28 BoogieIcfgContainer [2025-02-07 21:46:28,196 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:46:28,198 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:46:28,198 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:46:28,202 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:46:28,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:46:13" (1/3) ... [2025-02-07 21:46:28,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b227cb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:46:28, skipping insertion in model container [2025-02-07 21:46:28,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:46:13" (2/3) ... [2025-02-07 21:46:28,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b227cb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:46:28, skipping insertion in model container [2025-02-07 21:46:28,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:46:28" (3/3) ... [2025-02-07 21:46:28,205 INFO L128 eAbstractionObserver]: Analyzing ICFG gcd_1+newton_3_8.i [2025-02-07 21:46:28,217 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:46:28,219 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG gcd_1+newton_3_8.i that has 3 procedures, 32 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-02-07 21:46:28,266 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:46:28,279 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;@6bcb3f72, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:46:28,279 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-07 21:46:28,283 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 22 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 21:46:28,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-07 21:46:28,290 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:46:28,290 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:46:28,291 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:46:28,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:46:28,297 INFO L85 PathProgramCache]: Analyzing trace with hash 188303393, now seen corresponding path program 1 times [2025-02-07 21:46:28,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 21:46:28,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1327206579] [2025-02-07 21:46:28,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:46:28,310 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-07 21:46:28,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-07 21:46:28,313 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-07 21:46:28,315 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-07 21:46:28,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-07 21:46:30,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-07 21:46:30,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:46:30,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:46:30,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-07 21:46:30,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:46:30,958 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-07 21:46:30,958 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 21:46:30,959 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 21:46:30,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1327206579] [2025-02-07 21:46:30,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1327206579] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:46:30,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:46:30,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 21:46:30,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110893771] [2025-02-07 21:46:30,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:46:30,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 21:46:30,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 21:46:30,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 21:46:30,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 21:46:30,992 INFO L87 Difference]: Start difference. First operand has 31 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 22 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-07 21:46:31,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:46:31,006 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2025-02-07 21:46:31,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 21:46:31,008 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 33 [2025-02-07 21:46:31,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:46:31,012 INFO L225 Difference]: With dead ends: 52 [2025-02-07 21:46:31,012 INFO L226 Difference]: Without dead ends: 22 [2025-02-07 21:46:31,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 21:46:31,017 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:46:31,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:46:31,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-02-07 21:46:31,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-02-07 21:46:31,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.0) internal successors, (13), 13 states have internal predecessors, (13), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 21:46:31,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2025-02-07 21:46:31,045 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 33 [2025-02-07 21:46:31,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:46:31,045 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-02-07 21:46:31,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-07 21:46:31,046 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2025-02-07 21:46:31,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-07 21:46:31,047 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:46:31,047 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:46:31,127 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-07 21:46:31,248 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-07 21:46:31,249 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:46:31,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:46:31,250 INFO L85 PathProgramCache]: Analyzing trace with hash 539103330, now seen corresponding path program 1 times [2025-02-07 21:46:31,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 21:46:31,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [161510405] [2025-02-07 21:46:31,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:46:31,251 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-07 21:46:31,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-07 21:46:31,253 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-07 21:46:31,254 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-07 21:46:31,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-07 21:47:11,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-07 21:47:11,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:47:11,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 21:47:11,317 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 21:47:11,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-07 21:47:50,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-07 21:47:50,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:47:50,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 21:47:50,867 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-07 21:47:50,867 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 21:47:50,868 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-02-07 21:47:50,870 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-02-07 21:47:50,977 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-07 21:47:51,072 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-07 21:47:51,087 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-07 21:47:51,112 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 21:47:51,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 09:47:51 BoogieIcfgContainer [2025-02-07 21:47:51,115 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 21:47:51,116 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 21:47:51,116 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 21:47:51,116 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 21:47:51,117 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:46:28" (3/4) ... [2025-02-07 21:47:51,117 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-07 21:47:51,164 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 19. [2025-02-07 21:47:51,221 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 21:47:51,222 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 21:47:51,222 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 21:47:51,223 INFO L158 Benchmark]: Toolchain (without parser) took 98059.25ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 83.0MB in the end (delta: 9.2MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. [2025-02-07 21:47:51,223 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 83.9MB. Free memory was 61.7MB in the beginning and 61.6MB in the end (delta: 37.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:47:51,224 INFO L158 Benchmark]: CACSL2BoogieTranslator took 270.29ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 79.5MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:47:51,224 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.81ms. Allocated memory is still 117.4MB. Free memory was 79.5MB in the beginning and 78.0MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:47:51,225 INFO L158 Benchmark]: Boogie Preprocessor took 58.81ms. Allocated memory is still 117.4MB. Free memory was 78.0MB in the beginning and 76.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:47:51,225 INFO L158 Benchmark]: IcfgBuilder took 14655.98ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 62.6MB in the end (delta: 13.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:47:51,225 INFO L158 Benchmark]: TraceAbstraction took 82917.24ms. Allocated memory is still 117.4MB. Free memory was 61.9MB in the beginning and 89.0MB in the end (delta: -27.0MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. [2025-02-07 21:47:51,225 INFO L158 Benchmark]: Witness Printer took 106.20ms. Allocated memory is still 117.4MB. Free memory was 89.0MB in the beginning and 83.0MB in the end (delta: 5.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:47:51,227 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.31ms. Allocated memory is still 83.9MB. Free memory was 61.7MB in the beginning and 61.6MB in the end (delta: 37.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 270.29ms. Allocated memory is still 117.4MB. Free memory was 92.2MB in the beginning and 79.5MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.81ms. Allocated memory is still 117.4MB. Free memory was 79.5MB in the beginning and 78.0MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.81ms. Allocated memory is still 117.4MB. Free memory was 78.0MB in the beginning and 76.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 14655.98ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 62.6MB in the end (delta: 13.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 82917.24ms. Allocated memory is still 117.4MB. Free memory was 61.9MB in the beginning and 89.0MB in the end (delta: -27.0MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. * Witness Printer took 106.20ms. Allocated memory is still 117.4MB. Free memory was 89.0MB in the beginning and 83.0MB in the end (delta: 5.9MB). 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 - CounterExampleResult [Line: 102]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L108] COND FALSE !(__VERIFIER_nondet_int()) [L111] CALL main2() [L90] float IN = __VERIFIER_nondet_float(); [L91] CALL assume_abort_if_not(IN > -2.0f && IN < 2.0f) [L75] COND FALSE !(!cond) [L91] RET assume_abort_if_not(IN > -2.0f && IN < 2.0f) [L93] CALL, EXPR f(IN) VAL [\old(x)=1.634765625] [L80] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=1.634765625, \result=1.0101122856140137] [L93] RET, EXPR f(IN) VAL [IN=1.634765625] [L93] CALL, EXPR fp(IN) VAL [\old(x)=1.634765625] [L85] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=1.634765625, \result=-0.012135086581110954] [L93] RET, EXPR fp(IN) VAL [IN=1.634765625] [L93] float x = IN - f(IN)/fp(IN); [L95] CALL, EXPR f(x) VAL [\old(x)=84.87374877929688] [L80] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=84.87374877929688, \result=6331417600] [L95] RET, EXPR f(x) VAL [x=84.87374877929688] [L95] CALL, EXPR fp(x) VAL [\old(x)=84.87374877929688] [L85] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=84.87374877929688, \result=521326400] [L95] RET, EXPR fp(x) VAL [x=84.87374877929688] [L95] x = x - f(x)/fp(x) [L97] CALL, EXPR f(x) VAL [\old(x)=72.72892761230469] [L80] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=72.72892761230469, \result=2152492288] [L97] RET, EXPR f(x) VAL [x=72.72892761230469] [L97] CALL, EXPR fp(x) VAL [\old(x)=72.72892761230469] [L85] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=72.72892761230469, \result=206709888] [L97] RET, EXPR fp(x) VAL [x=72.72892761230469] [L97] x = x - f(x)/fp(x) [L101] COND TRUE !(x < 0.1) [L102] reach_error() - UnprovableResult [Line: 27]: 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 3 procedures, 32 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 82.8s, OverallIterations: 2, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 37 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 37 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 42.5s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 66 NumberOfCodeBlocks, 66 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 32 ConstructedInterpolants, 0 QuantifiedInterpolants, 32 SizeOfPredicates, 0 NumberOfNonLiveVariables, 73 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 18/18 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 proved your program to be incorrect! [2025-02-07 21:47:51,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE