./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_2+newton_3_5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5991baf0-97c1-49b0-add8-02bef1e18a86/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5991baf0-97c1-49b0-add8-02bef1e18a86/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5991baf0-97c1-49b0-add8-02bef1e18a86/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5991baf0-97c1-49b0-add8-02bef1e18a86/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_3_5.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5991baf0-97c1-49b0-add8-02bef1e18a86/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5991baf0-97c1-49b0-add8-02bef1e18a86/bin/uautomizer-verify-qhAvR1uOyd --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 3c7e4faaabab9b2f322684d2701654a5044e8a4a6ec20b8d467b524bec442165 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 16:13:10,789 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 16:13:10,875 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5991baf0-97c1-49b0-add8-02bef1e18a86/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 16:13:10,884 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 16:13:10,885 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 16:13:10,925 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 16:13:10,926 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 16:13:10,926 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 16:13:10,927 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 16:13:10,927 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 16:13:10,928 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 16:13:10,928 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 16:13:10,929 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 16:13:10,929 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 16:13:10,930 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 16:13:10,930 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 16:13:10,930 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 16:13:10,930 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 16:13:10,930 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 16:13:10,930 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 16:13:10,930 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 16:13:10,930 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 16:13:10,930 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 16:13:10,930 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 16:13:10,931 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 16:13:10,931 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 16:13:10,931 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 16:13:10,931 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 16:13:10,931 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 16:13:10,931 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 16:13:10,931 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 16:13:10,931 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 16:13:10,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:13:10,932 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 16:13:10,933 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 16:13:10,933 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 16:13:10,933 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 16:13:10,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 16:13:10,933 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 16:13:10,933 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 16:13:10,933 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 16:13:10,934 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 16:13:10,934 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5991baf0-97c1-49b0-add8-02bef1e18a86/bin/uautomizer-verify-qhAvR1uOyd 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 -> 3c7e4faaabab9b2f322684d2701654a5044e8a4a6ec20b8d467b524bec442165 [2024-11-13 16:13:11,262 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 16:13:11,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 16:13:11,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 16:13:11,278 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 16:13:11,278 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 16:13:11,279 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5991baf0-97c1-49b0-add8-02bef1e18a86/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/combinations/gcd_2+newton_3_5.i Unable to find full path for "g++" [2024-11-13 16:13:13,365 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 16:13:13,630 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 16:13:13,634 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5991baf0-97c1-49b0-add8-02bef1e18a86/sv-benchmarks/c/combinations/gcd_2+newton_3_5.i [2024-11-13 16:13:13,646 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5991baf0-97c1-49b0-add8-02bef1e18a86/bin/uautomizer-verify-qhAvR1uOyd/data/215da26d2/2b4d3e9da9164ed286a23c288471eb1e/FLAG3ae7f7135 [2024-11-13 16:13:13,949 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5991baf0-97c1-49b0-add8-02bef1e18a86/bin/uautomizer-verify-qhAvR1uOyd/data/215da26d2/2b4d3e9da9164ed286a23c288471eb1e [2024-11-13 16:13:13,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 16:13:13,955 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 16:13:13,957 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 16:13:13,957 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 16:13:13,962 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 16:13:13,964 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:13:13" (1/1) ... [2024-11-13 16:13:13,967 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c1e1dc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:13, skipping insertion in model container [2024-11-13 16:13:13,967 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:13:13" (1/1) ... [2024-11-13 16:13:13,987 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 16:13:14,184 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5991baf0-97c1-49b0-add8-02bef1e18a86/sv-benchmarks/c/combinations/gcd_2+newton_3_5.i[1226,1239] [2024-11-13 16:13:14,225 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5991baf0-97c1-49b0-add8-02bef1e18a86/sv-benchmarks/c/combinations/gcd_2+newton_3_5.i[2862,2875] [2024-11-13 16:13:14,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:13:14,247 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 16:13:14,258 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5991baf0-97c1-49b0-add8-02bef1e18a86/sv-benchmarks/c/combinations/gcd_2+newton_3_5.i[1226,1239] [2024-11-13 16:13:14,285 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5991baf0-97c1-49b0-add8-02bef1e18a86/sv-benchmarks/c/combinations/gcd_2+newton_3_5.i[2862,2875] [2024-11-13 16:13:14,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:13:14,306 INFO L204 MainTranslator]: Completed translation [2024-11-13 16:13:14,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:14 WrapperNode [2024-11-13 16:13:14,307 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 16:13:14,309 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 16:13:14,310 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 16:13:14,310 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 16:13:14,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:14" (1/1) ... [2024-11-13 16:13:14,325 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:14" (1/1) ... [2024-11-13 16:13:14,357 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 90 [2024-11-13 16:13:14,360 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 16:13:14,361 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 16:13:14,361 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 16:13:14,362 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 16:13:14,373 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:14" (1/1) ... [2024-11-13 16:13:14,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:14" (1/1) ... [2024-11-13 16:13:14,380 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:14" (1/1) ... [2024-11-13 16:13:14,404 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]. [2024-11-13 16:13:14,405 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:14" (1/1) ... [2024-11-13 16:13:14,405 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:14" (1/1) ... [2024-11-13 16:13:14,411 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:14" (1/1) ... [2024-11-13 16:13:14,419 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:14" (1/1) ... [2024-11-13 16:13:14,421 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:14" (1/1) ... [2024-11-13 16:13:14,426 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:14" (1/1) ... [2024-11-13 16:13:14,428 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 16:13:14,429 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 16:13:14,432 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 16:13:14,432 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 16:13:14,437 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:14" (1/1) ... [2024-11-13 16:13:14,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:13:14,465 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5991baf0-97c1-49b0-add8-02bef1e18a86/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:13:14,480 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5991baf0-97c1-49b0-add8-02bef1e18a86/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 16:13:14,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5991baf0-97c1-49b0-add8-02bef1e18a86/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 16:13:14,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 16:13:14,512 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-11-13 16:13:14,513 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-11-13 16:13:14,513 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-13 16:13:14,513 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-13 16:13:14,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 16:13:14,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 16:13:14,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 16:13:14,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 16:13:14,613 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 16:13:14,615 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 16:13:14,824 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2024-11-13 16:13:14,824 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 16:13:14,834 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 16:13:14,835 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 16:13:14,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:13:14 BoogieIcfgContainer [2024-11-13 16:13:14,835 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 16:13:14,838 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 16:13:14,838 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 16:13:14,843 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 16:13:14,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 04:13:13" (1/3) ... [2024-11-13 16:13:14,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c6e0db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:13:14, skipping insertion in model container [2024-11-13 16:13:14,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:13:14" (2/3) ... [2024-11-13 16:13:14,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c6e0db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:13:14, skipping insertion in model container [2024-11-13 16:13:14,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:13:14" (3/3) ... [2024-11-13 16:13:14,846 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_3_5.i [2024-11-13 16:13:14,864 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 16:13:14,866 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG gcd_2+newton_3_5.i that has 3 procedures, 40 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2024-11-13 16:13:14,936 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 16:13:14,956 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;@61acc1ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 16:13:14,956 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-13 16:13:14,962 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 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) [2024-11-13 16:13:14,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 16:13:14,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:14,971 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:13:14,971 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:14,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:14,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1738968779, now seen corresponding path program 1 times [2024-11-13 16:13:14,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:14,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908963112] [2024-11-13 16:13:14,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:14,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:15,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:15,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:13:15,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:15,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908963112] [2024-11-13 16:13:15,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908963112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:15,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:15,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 16:13:15,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812862400] [2024-11-13 16:13:15,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:15,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:13:15,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:15,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:13:15,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:13:15,367 INFO L87 Difference]: Start difference. First operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 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 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:13:15,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:15,469 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2024-11-13 16:13:15,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 16:13:15,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-13 16:13:15,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:15,477 INFO L225 Difference]: With dead ends: 78 [2024-11-13 16:13:15,477 INFO L226 Difference]: Without dead ends: 33 [2024-11-13 16:13:15,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:13:15,486 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 3 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:15,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 122 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:13:15,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-13 16:13:15,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2024-11-13 16:13:15,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 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) [2024-11-13 16:13:15,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2024-11-13 16:13:15,548 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 11 [2024-11-13 16:13:15,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:15,550 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2024-11-13 16:13:15,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:13:15,551 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2024-11-13 16:13:15,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 16:13:15,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:15,552 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:13:15,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 16:13:15,553 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:15,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:15,554 INFO L85 PathProgramCache]: Analyzing trace with hash 36038583, now seen corresponding path program 1 times [2024-11-13 16:13:15,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:15,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515446555] [2024-11-13 16:13:15,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:15,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:15,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:13:15,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:15,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515446555] [2024-11-13 16:13:15,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515446555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:13:15,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:13:15,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 16:13:15,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044614029] [2024-11-13 16:13:15,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:13:15,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:13:15,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:15,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:13:15,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:13:15,671 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:13:15,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:15,704 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2024-11-13 16:13:15,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 16:13:15,705 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-13 16:13:15,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:15,707 INFO L225 Difference]: With dead ends: 39 [2024-11-13 16:13:15,707 INFO L226 Difference]: Without dead ends: 33 [2024-11-13 16:13:15,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:13:15,712 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:15,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 96 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:13:15,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-13 16:13:15,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-13 16:13:15,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 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) [2024-11-13 16:13:15,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2024-11-13 16:13:15,721 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 11 [2024-11-13 16:13:15,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:15,722 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-11-13 16:13:15,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:13:15,722 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2024-11-13 16:13:15,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 16:13:15,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:15,723 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:13:15,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 16:13:15,723 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:15,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:15,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1576478087, now seen corresponding path program 1 times [2024-11-13 16:13:15,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:15,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488173860] [2024-11-13 16:13:15,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:15,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:15,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:15,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:13:15,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:15,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488173860] [2024-11-13 16:13:15,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488173860] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:13:15,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112274789] [2024-11-13 16:13:15,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:15,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:13:15,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5991baf0-97c1-49b0-add8-02bef1e18a86/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:13:15,981 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5991baf0-97c1-49b0-add8-02bef1e18a86/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:13:15,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5991baf0-97c1-49b0-add8-02bef1e18a86/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 16:13:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:16,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 16:13:16,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:13:16,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:13:16,207 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:13:16,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:13:16,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112274789] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:13:16,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 16:13:16,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-13 16:13:16,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484824360] [2024-11-13 16:13:16,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 16:13:16,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 16:13:16,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:13:16,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 16:13:16,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-13 16:13:16,329 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:13:16,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:13:16,473 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2024-11-13 16:13:16,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 16:13:16,474 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-13 16:13:16,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:13:16,475 INFO L225 Difference]: With dead ends: 40 [2024-11-13 16:13:16,475 INFO L226 Difference]: Without dead ends: 34 [2024-11-13 16:13:16,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-13 16:13:16,476 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 2 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:13:16,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 182 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:13:16,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-13 16:13:16,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-13 16:13:16,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.125) internal successors, (27), 25 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) [2024-11-13 16:13:16,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2024-11-13 16:13:16,488 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 12 [2024-11-13 16:13:16,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:13:16,489 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2024-11-13 16:13:16,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:13:16,489 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2024-11-13 16:13:16,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 16:13:16,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:13:16,491 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:13:16,513 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5991baf0-97c1-49b0-add8-02bef1e18a86/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 16:13:16,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5991baf0-97c1-49b0-add8-02bef1e18a86/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:13:16,692 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:13:16,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:13:16,693 INFO L85 PathProgramCache]: Analyzing trace with hash -24887305, now seen corresponding path program 2 times [2024-11-13 16:13:16,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:13:16,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069464758] [2024-11-13 16:13:16,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:13:16,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:13:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:13:17,282 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:13:17,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:13:17,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069464758] [2024-11-13 16:13:17,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069464758] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:13:17,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538144205] [2024-11-13 16:13:17,283 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 16:13:17,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:13:17,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5991baf0-97c1-49b0-add8-02bef1e18a86/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:13:17,285 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5991baf0-97c1-49b0-add8-02bef1e18a86/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:13:17,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5991baf0-97c1-49b0-add8-02bef1e18a86/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 16:13:17,386 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 16:13:17,386 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 16:13:17,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-13 16:13:17,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:14:30,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:14:30,639 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:15:18,025 WARN L286 SmtUtils]: Spent 7.97s on a formula simplification that was a NOOP. DAG size: 106 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 16:15:37,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:15:37,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538144205] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:15:37,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 16:15:37,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 24 [2024-11-13 16:15:37,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684508959] [2024-11-13 16:15:37,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 16:15:37,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-13 16:15:37,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:15:37,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-13 16:15:37,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=445, Unknown=14, NotChecked=0, Total=552 [2024-11-13 16:15:37,150 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:15:42,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 16:15:46,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 16:15:51,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 16:15:56,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 16:16:03,696 WARN L286 SmtUtils]: Spent 6.21s on a formula simplification. DAG size of input: 111 DAG size of output: 177 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 16:16:08,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 16:16:12,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 16:16:16,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 16:16:21,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 16:16:25,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0, 1] [2024-11-13 16:16:27,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:16:27,448 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2024-11-13 16:16:27,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 16:16:27,449 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-13 16:16:27,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:16:27,450 INFO L225 Difference]: With dead ends: 50 [2024-11-13 16:16:27,450 INFO L226 Difference]: Without dead ends: 38 [2024-11-13 16:16:27,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 112.8s TimeCoverageRelationStatistics Valid=121, Invalid=567, Unknown=14, NotChecked=0, Total=702 [2024-11-13 16:16:27,453 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 5 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.6s IncrementalHoareTripleChecker+Time [2024-11-13 16:16:27,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 354 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 111 Invalid, 10 Unknown, 0 Unchecked, 41.6s Time] [2024-11-13 16:16:27,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-13 16:16:27,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-13 16:16:27,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 29 states have internal predecessors, (31), 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) [2024-11-13 16:16:27,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-11-13 16:16:27,466 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 13 [2024-11-13 16:16:27,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:16:27,467 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-11-13 16:16:27,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:16:27,467 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-11-13 16:16:27,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 16:16:27,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:16:27,469 INFO L215 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:16:27,484 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5991baf0-97c1-49b0-add8-02bef1e18a86/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-13 16:16:27,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5991baf0-97c1-49b0-add8-02bef1e18a86/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:16:27,674 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:16:27,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:16:27,674 INFO L85 PathProgramCache]: Analyzing trace with hash -710557577, now seen corresponding path program 3 times [2024-11-13 16:16:27,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:16:27,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938409089] [2024-11-13 16:16:27,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:16:27,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:16:27,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:16:35,121 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:16:35,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:16:35,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938409089] [2024-11-13 16:16:35,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938409089] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:16:35,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149174418] [2024-11-13 16:16:35,122 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 16:16:35,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:16:35,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5991baf0-97c1-49b0-add8-02bef1e18a86/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:16:35,124 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5991baf0-97c1-49b0-add8-02bef1e18a86/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:16:35,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5991baf0-97c1-49b0-add8-02bef1e18a86/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 16:16:35,344 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-13 16:16:35,344 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 16:16:35,346 WARN L253 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-13 16:16:35,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:17:13,761 WARN L286 SmtUtils]: Spent 7.69s on a formula simplification. DAG size of input: 116 DAG size of output: 82 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 16:18:20,545 WARN L286 SmtUtils]: Spent 21.05s on a formula simplification. DAG size of input: 141 DAG size of output: 141 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 16:20:40,388 WARN L286 SmtUtils]: Spent 42.24s on a formula simplification. DAG size of input: 159 DAG size of output: 155 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 16:21:47,382 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (let ((.cse12 (* |c_ULTIMATE.start_gcd_test_~a#1| 255)) (.cse13 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse18 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) (.cse0 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse7 (<= (mod |c_ULTIMATE.start_gcd_test_~a#1| 256) 127)) (.cse8 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|))) (or (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse3 (mod .cse1 256))) (let ((.cse6 (+ (- 256) .cse3))) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse6))) (let ((.cse4 (mod .cse6 .cse2))) (let ((.cse5 (+ (- 256) (mod (+ (* .cse2 255) .cse4) 256)))) (and (<= 128 (mod (+ (* 255 .cse1) .cse2) 256)) (<= 128 .cse3) (not (= .cse2 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse4 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse5) |c_ULTIMATE.start_gcd_test_~a#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= (mod .cse5 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= .cse2 |v_ULTIMATE.start_gcd_test_~a#1_26|))))))))) .cse7) (and .cse8 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse14 (mod (+ .cse18 .cse11) 256))) (let ((.cse17 (+ (- 256) .cse14))) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse17))) (let ((.cse15 (mod .cse17 .cse9))) (let ((.cse16 (+ (- 256) (mod (+ .cse15 (* 255 .cse9)) 256)))) (let ((.cse10 (mod .cse16 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= .cse9 |v_ULTIMATE.start_gcd_test_~a#1_26|) (not (= .cse10 0)) (<= 128 (mod (+ (* 255 .cse11) |c_ULTIMATE.start_main1_~y~0#1| .cse9) 256)) (= (mod (+ .cse12 .cse10) 256) .cse13) (not (= .cse11 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= 128 .cse14) (not (= .cse15 0)) (not (= .cse9 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse16) |c_ULTIMATE.start_gcd_test_~a#1|))))))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse21 (mod (+ .cse18 .cse20) 256))) (let ((.cse24 (+ (- 256) .cse21))) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse24))) (let ((.cse22 (mod .cse24 .cse19))) (let ((.cse23 (+ (- 256) (mod (+ .cse22 (* 255 .cse19)) 256)))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= .cse19 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= 128 (mod (+ (* 255 .cse20) |c_ULTIMATE.start_main1_~y~0#1| .cse19) 256)) (not (= .cse20 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= 128 .cse21) (not (= .cse22 0)) (not (= .cse19 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse23) |c_ULTIMATE.start_gcd_test_~a#1|) (= (mod .cse23 |c_ULTIMATE.start_gcd_test_~a#1|) 0))))))))) .cse0 .cse7) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse26 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse26))) (let ((.cse27 (mod .cse26 .cse25))) (and (<= .cse25 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= (+ .cse25 .cse26) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (= (mod .cse27 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse25 0)) (not (= .cse27 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse27))))))) .cse0 .cse7) (and (or (and .cse0 .cse7 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse31 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse30 (mod (+ .cse18 .cse31) 256))) (let ((.cse29 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse30))) (let ((.cse28 (mod .cse30 .cse29))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse28)) (not (= .cse28 0)) (<= (+ .cse29 .cse30) 127) (not (= .cse31 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= (mod .cse28 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= .cse29 0)) (<= .cse29 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse32 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (not (= .cse32 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse35 (mod (+ .cse18 .cse32) 256))) (let ((.cse34 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse35))) (let ((.cse33 (mod .cse35 .cse34))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse33)) (not (= .cse33 0)) (<= (+ .cse34 .cse35) 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse34 0)) (<= .cse34 |v_ULTIMATE.start_gcd_test_~a#1_26|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse33 |c_ULTIMATE.start_gcd_test_~a#1|))))))))))) .cse8) (and .cse8 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse36 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse38 (mod .cse36 256))) (let ((.cse42 (+ (- 256) .cse38))) (let ((.cse37 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse42))) (let ((.cse40 (mod .cse42 .cse37))) (let ((.cse41 (+ (- 256) (mod (+ (* .cse37 255) .cse40) 256)))) (let ((.cse39 (mod .cse41 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (mod (+ (* 255 .cse36) .cse37) 256) 127) (<= 128 .cse38) (not (= .cse37 0)) (not (= .cse39 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse40 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse41) |c_ULTIMATE.start_gcd_test_~a#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= .cse37 |v_ULTIMATE.start_gcd_test_~a#1_26|) (= (mod (+ .cse39 .cse12) 256) .cse13))))))))))) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse46 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse45 (mod (+ .cse18 .cse46) 256))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse44 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse45))) (let ((.cse43 (mod .cse45 .cse44))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse43)) (not (= .cse43 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= 128 (+ .cse44 .cse45)) (<= .cse44 |v_ULTIMATE.start_gcd_test_~a#1_26|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse43 |c_ULTIMATE.start_gcd_test_~a#1|)))))) (not (= .cse46 0)) (<= .cse45 127))))) (and .cse0 .cse7 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse48 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse49 (mod (+ .cse18 .cse48) 256))) (let ((.cse50 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse49))) (let ((.cse47 (mod .cse49 .cse50))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse47)) (not (= .cse47 0)) (not (= .cse48 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= (mod .cse47 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= .cse49 127) (<= 128 (+ .cse50 .cse49)) (<= .cse50 |v_ULTIMATE.start_gcd_test_~a#1_26|))))))))) .cse8) (and .cse8 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse51 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse53 (mod .cse51 256))) (let ((.cse57 (+ (- 256) .cse53))) (let ((.cse52 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse57))) (let ((.cse55 (mod .cse57 .cse52))) (let ((.cse56 (+ (- 256) (mod (+ (* .cse52 255) .cse55) 256)))) (let ((.cse54 (mod .cse56 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= 128 (mod (+ (* 255 .cse51) .cse52) 256)) (<= 128 .cse53) (not (= .cse52 0)) (not (= .cse54 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse55 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse56) |c_ULTIMATE.start_gcd_test_~a#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= .cse52 |v_ULTIMATE.start_gcd_test_~a#1_26|) (= (mod (+ .cse54 .cse12) 256) .cse13))))))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse58 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse59 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse58))) (let ((.cse60 (mod .cse58 .cse59))) (and (<= .cse58 127) (<= .cse59 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= 128 (+ .cse59 .cse58)) (= (mod .cse60 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse60 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse60))))))) .cse0 .cse7) (and .cse8 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse63 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse62 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse63))) (let ((.cse61 (mod .cse63 .cse62))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse61 |c_ULTIMATE.start_gcd_test_~a#1|)) (<= .cse62 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= (+ .cse62 .cse63) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse62 0)) (not (= .cse61 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse61)))))))) (and .cse0 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse65 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse66 (mod (+ .cse18 .cse65) 256))) (let ((.cse69 (+ (- 256) .cse66))) (let ((.cse64 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse69))) (let ((.cse67 (mod .cse69 .cse64))) (let ((.cse68 (+ (- 256) (mod (+ .cse67 (* 255 .cse64)) 256)))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= .cse64 |v_ULTIMATE.start_gcd_test_~a#1_26|) (not (= .cse65 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= 128 .cse66) (not (= .cse67 0)) (<= (mod (+ (* 255 .cse65) |c_ULTIMATE.start_main1_~y~0#1| .cse64) 256) 127) (not (= .cse64 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse68) |c_ULTIMATE.start_gcd_test_~a#1|) (= (mod .cse68 |c_ULTIMATE.start_gcd_test_~a#1|) 0))))))))) .cse7) (and .cse8 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse72 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse73 (mod (+ .cse18 .cse72) 256))) (let ((.cse76 (+ (- 256) .cse73))) (let ((.cse70 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse76))) (let ((.cse74 (mod .cse76 .cse70))) (let ((.cse75 (+ (- 256) (mod (+ .cse74 (* 255 .cse70)) 256)))) (let ((.cse71 (mod .cse75 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= .cse70 |v_ULTIMATE.start_gcd_test_~a#1_26|) (not (= .cse71 0)) (= (mod (+ .cse12 .cse71) 256) .cse13) (not (= .cse72 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= 128 .cse73) (not (= .cse74 0)) (<= (mod (+ (* 255 .cse72) |c_ULTIMATE.start_main1_~y~0#1| .cse70) 256) 127) (not (= .cse70 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse75) |c_ULTIMATE.start_gcd_test_~a#1|))))))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse77 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse79 (mod .cse77 256))) (let ((.cse82 (+ (- 256) .cse79))) (let ((.cse78 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse82))) (let ((.cse80 (mod .cse82 .cse78))) (let ((.cse81 (+ (- 256) (mod (+ (* .cse78 255) .cse80) 256)))) (and (<= (mod (+ (* 255 .cse77) .cse78) 256) 127) (<= 128 .cse79) (not (= .cse78 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse80 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse81) |c_ULTIMATE.start_gcd_test_~a#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= (mod .cse81 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= .cse78 |v_ULTIMATE.start_gcd_test_~a#1_26|))))))))) .cse0 .cse7) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse84 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse85 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse84))) (let ((.cse83 (mod .cse84 .cse85))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse83 |c_ULTIMATE.start_gcd_test_~a#1|)) (<= .cse84 127) (<= .cse85 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= 128 (+ .cse85 .cse84)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse83 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse83))))))) .cse8))) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2024-11-13 16:24:34,968 WARN L286 SmtUtils]: Spent 1.05m on a formula simplification. DAG size of input: 150 DAG size of output: 139 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 16:26:44,735 WARN L286 SmtUtils]: Spent 42.38s on a formula simplification that was a NOOP. DAG size: 138 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 16:27:10,799 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (not (= 0 |c_ULTIMATE.start_gcd_test_#res#1|)) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|) (let ((.cse6 (+ 256 |c_ULTIMATE.start_gcd_test_#res#1|)) (.cse9 (* |c_ULTIMATE.start_main1_~y~0#1| 255))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse4 (mod (+ .cse9 .cse2) 256))) (let ((.cse8 (+ (- 256) .cse4))) (let ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse8))) (let ((.cse5 (mod .cse8 .cse1))) (let ((.cse7 (+ (- 256) (mod (+ .cse5 (* 255 .cse1)) 256)))) (let ((.cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse7))) (let ((.cse0 (mod .cse7 .cse3))) (and (not (= .cse0 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= .cse1 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= 128 (mod (+ (* 255 .cse2) |c_ULTIMATE.start_main1_~y~0#1| .cse1) 256)) (not (= .cse2 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse3 0)) (<= 128 .cse4) (not (= .cse5 0)) (= (mod (+ (* .cse3 255) .cse0) 256) .cse6) (not (= .cse1 0)) (= (mod .cse3 |c_ULTIMATE.start_gcd_test_#res#1|) 0))))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse12 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse12))) (let ((.cse11 (mod .cse12 .cse13))) (let ((.cse10 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse11))) (and (not (= .cse10 0)) (= (mod .cse11 .cse10) |c_ULTIMATE.start_gcd_test_#res#1|) (<= .cse12 127) (<= .cse13 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= 128 (+ .cse13 .cse12)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= (mod .cse10 |c_ULTIMATE.start_gcd_test_#res#1|) 0))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse17 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse17))) (let ((.cse15 (mod .cse17 .cse16))) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse15))) (and (not (= .cse14 0)) (= (mod .cse15 .cse14) |c_ULTIMATE.start_gcd_test_#res#1|) (<= .cse16 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= (+ .cse16 .cse17) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse16 0)) (= (mod .cse14 |c_ULTIMATE.start_gcd_test_#res#1|) 0))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse22 (mod .cse20 256))) (let ((.cse25 (+ (- 256) .cse22))) (let ((.cse21 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse25))) (let ((.cse23 (mod .cse25 .cse21))) (let ((.cse24 (+ (- 256) (mod (+ (* .cse21 255) .cse23) 256)))) (let ((.cse18 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse24))) (let ((.cse19 (mod .cse24 .cse18))) (and (= .cse6 (mod (+ (* .cse18 255) .cse19) 256)) (<= 128 (mod (+ (* 255 .cse20) .cse21) 256)) (<= 128 .cse22) (not (= .cse21 0)) (= (mod .cse18 |c_ULTIMATE.start_gcd_test_#res#1|) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse23 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse18 0)) (not (= .cse19 0)) (<= .cse21 |v_ULTIMATE.start_gcd_test_~a#1_26|))))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse29 (mod (+ .cse9 .cse28) 256))) (let ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse29))) (let ((.cse26 (mod .cse29 .cse30))) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse26))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (= (mod .cse26 .cse27) |c_ULTIMATE.start_gcd_test_#res#1|) (not (= .cse28 0)) (= (mod .cse27 |c_ULTIMATE.start_gcd_test_#res#1|) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= .cse29 127) (not (= .cse27 0)) (<= 128 (+ .cse30 .cse29)) (<= .cse30 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse35 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse34 (mod (+ .cse9 .cse35) 256))) (let ((.cse33 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse34))) (let ((.cse31 (mod .cse34 .cse33))) (let ((.cse32 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse31))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (= (mod .cse31 .cse32) |c_ULTIMATE.start_gcd_test_#res#1|) (<= (+ .cse33 .cse34) 127) (not (= .cse35 0)) (= (mod .cse32 |c_ULTIMATE.start_gcd_test_#res#1|) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse33 0)) (not (= .cse32 0)) (<= .cse33 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse38 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse40 (mod .cse38 256))) (let ((.cse43 (+ (- 256) .cse40))) (let ((.cse39 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse43))) (let ((.cse41 (mod .cse43 .cse39))) (let ((.cse42 (+ (- 256) (mod (+ (* .cse39 255) .cse41) 256)))) (let ((.cse36 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse42))) (let ((.cse37 (mod .cse42 .cse36))) (and (= .cse6 (mod (+ (* .cse36 255) .cse37) 256)) (<= (mod (+ (* 255 .cse38) .cse39) 256) 127) (<= 128 .cse40) (not (= .cse39 0)) (= (mod .cse36 |c_ULTIMATE.start_gcd_test_#res#1|) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse41 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse36 0)) (not (= .cse37 0)) (<= .cse39 |v_ULTIMATE.start_gcd_test_~a#1_26|))))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse46 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse48 (mod (+ .cse9 .cse46) 256))) (let ((.cse51 (+ (- 256) .cse48))) (let ((.cse45 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse51))) (let ((.cse49 (mod .cse51 .cse45))) (let ((.cse50 (+ (- 256) (mod (+ .cse49 (* 255 .cse45)) 256)))) (let ((.cse47 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse50))) (let ((.cse44 (mod .cse50 .cse47))) (and (not (= .cse44 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= .cse45 |v_ULTIMATE.start_gcd_test_~a#1_26|) (not (= .cse46 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse47 0)) (<= 128 .cse48) (not (= .cse49 0)) (<= (mod (+ (* 255 .cse46) |c_ULTIMATE.start_main1_~y~0#1| .cse45) 256) 127) (= (mod (+ (* .cse47 255) .cse44) 256) .cse6) (not (= .cse45 0)) (= (mod .cse47 |c_ULTIMATE.start_gcd_test_#res#1|) 0)))))))))))))) is different from false [2024-11-13 16:27:34,092 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (not (= |c_ULTIMATE.start_main1_~g~0#1| 0)) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|) (<= |c_ULTIMATE.start_main1_~g~0#1| 127) (let ((.cse5 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) (.cse9 (+ 256 |c_ULTIMATE.start_main1_~g~0#1|))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse2 (mod (+ .cse5 .cse1) 256))) (let ((.cse4 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse2))) (let ((.cse3 (mod .cse2 .cse4))) (let ((.cse0 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse3))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (= (mod .cse0 |c_ULTIMATE.start_main1_~g~0#1|) 0) (not (= .cse1 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= .cse2 127) (= (mod .cse3 .cse0) |c_ULTIMATE.start_main1_~g~0#1|) (not (= .cse0 0)) (<= 128 (+ .cse4 .cse2)) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse6 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse8 (mod .cse6 256))) (let ((.cse14 (+ (- 256) .cse8))) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse14))) (let ((.cse12 (mod .cse14 .cse7))) (let ((.cse13 (+ (- 256) (mod (+ (* .cse7 255) .cse12) 256)))) (let ((.cse10 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse13))) (let ((.cse11 (mod .cse13 .cse10))) (and (<= (mod (+ (* 255 .cse6) .cse7) 256) 127) (<= 128 .cse8) (not (= .cse7 0)) (= .cse9 (mod (+ (* .cse10 255) .cse11) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse12 0)) (= (mod .cse10 |c_ULTIMATE.start_main1_~g~0#1|) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse10 0)) (not (= .cse11 0)) (<= .cse7 |v_ULTIMATE.start_gcd_test_~a#1_26|))))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse18 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse17 (mod (+ .cse5 .cse18) 256))) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse17))) (let ((.cse19 (mod .cse17 .cse16))) (let ((.cse15 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse19))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (= (mod .cse15 |c_ULTIMATE.start_main1_~g~0#1|) 0) (<= (+ .cse16 .cse17) 127) (not (= .cse18 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse16 0)) (= (mod .cse19 .cse15) |c_ULTIMATE.start_main1_~g~0#1|) (not (= .cse15 0)) (<= .cse16 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse21 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse21))) (let ((.cse23 (mod .cse21 .cse22))) (let ((.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse23))) (and (not (= .cse20 0)) (<= .cse21 127) (<= .cse22 |v_ULTIMATE.start_gcd_test_~a#1_26|) (= (mod .cse23 .cse20) |c_ULTIMATE.start_main1_~g~0#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= 128 (+ .cse22 .cse21)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= (mod .cse20 |c_ULTIMATE.start_main1_~g~0#1|) 0))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse26 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse26))) (let ((.cse27 (mod .cse26 .cse25))) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse27))) (and (not (= .cse24 0)) (<= .cse25 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= (+ .cse25 .cse26) 127) (= (mod .cse27 .cse24) |c_ULTIMATE.start_main1_~g~0#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse25 0)) (= (mod .cse24 |c_ULTIMATE.start_main1_~g~0#1|) 0))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse31 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse32 (mod (+ .cse5 .cse31) 256))) (let ((.cse35 (+ (- 256) .cse32))) (let ((.cse30 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse35))) (let ((.cse33 (mod .cse35 .cse30))) (let ((.cse34 (+ (- 256) (mod (+ .cse33 (* 255 .cse30)) 256)))) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse34))) (let ((.cse29 (mod .cse34 .cse28))) (and (= (mod .cse28 |c_ULTIMATE.start_main1_~g~0#1|) 0) (not (= .cse29 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= .cse30 |v_ULTIMATE.start_gcd_test_~a#1_26|) (= (mod (+ (* .cse28 255) .cse29) 256) .cse9) (not (= .cse31 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse28 0)) (<= 128 .cse32) (not (= .cse33 0)) (<= (mod (+ (* 255 .cse31) |c_ULTIMATE.start_main1_~y~0#1| .cse30) 256) 127) (not (= .cse30 0)))))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse39 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse40 (mod (+ .cse5 .cse39) 256))) (let ((.cse43 (+ (- 256) .cse40))) (let ((.cse38 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse43))) (let ((.cse41 (mod .cse43 .cse38))) (let ((.cse42 (+ (- 256) (mod (+ .cse41 (* 255 .cse38)) 256)))) (let ((.cse36 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse42))) (let ((.cse37 (mod .cse42 .cse36))) (and (= (mod .cse36 |c_ULTIMATE.start_main1_~g~0#1|) 0) (not (= .cse37 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= .cse38 |v_ULTIMATE.start_gcd_test_~a#1_26|) (= (mod (+ (* .cse36 255) .cse37) 256) .cse9) (<= 128 (mod (+ (* 255 .cse39) |c_ULTIMATE.start_main1_~y~0#1| .cse38) 256)) (not (= .cse39 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse36 0)) (<= 128 .cse40) (not (= .cse41 0)) (not (= .cse38 0)))))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse44 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse46 (mod .cse44 256))) (let ((.cse51 (+ (- 256) .cse46))) (let ((.cse45 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse51))) (let ((.cse49 (mod .cse51 .cse45))) (let ((.cse50 (+ (- 256) (mod (+ (* .cse45 255) .cse49) 256)))) (let ((.cse47 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse50))) (let ((.cse48 (mod .cse50 .cse47))) (and (<= 128 (mod (+ (* 255 .cse44) .cse45) 256)) (<= 128 .cse46) (not (= .cse45 0)) (= .cse9 (mod (+ (* .cse47 255) .cse48) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse49 0)) (= (mod .cse47 |c_ULTIMATE.start_main1_~g~0#1|) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse47 0)) (not (= .cse48 0)) (<= .cse45 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))))))))))) is different from false [2024-11-13 16:28:08,431 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 8 refuted. 7 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-13 16:28:08,431 INFO L311 TraceCheckSpWp]: Computing backward predicates...