./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_2+newton_3_3.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_0c3d7667-811c-4f7c-aaed-8f225366fad9/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c3d7667-811c-4f7c-aaed-8f225366fad9/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_0c3d7667-811c-4f7c-aaed-8f225366fad9/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c3d7667-811c-4f7c-aaed-8f225366fad9/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_3_3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c3d7667-811c-4f7c-aaed-8f225366fad9/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_0c3d7667-811c-4f7c-aaed-8f225366fad9/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 cf7f7457cdd0c5557ed6396b1b77324a2673e1bc1f66f80f06950a47fe88485c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:34:03,476 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:34:03,577 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c3d7667-811c-4f7c-aaed-8f225366fad9/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 13:34:03,582 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:34:03,582 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:34:03,606 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:34:03,607 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:34:03,607 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:34:03,607 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:34:03,608 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:34:03,608 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:34:03,608 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:34:03,608 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:34:03,608 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:34:03,608 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:34:03,609 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:34:03,609 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 13:34:03,609 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:34:03,609 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:34:03,609 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:34:03,609 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:34:03,609 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 13:34:03,609 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:34:03,609 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 13:34:03,610 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:34:03,610 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:34:03,610 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 13:34:03,610 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:34:03,610 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:34:03,610 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:34:03,610 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:34:03,610 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:34:03,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:34:03,611 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:34:03,611 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:34:03,611 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 13:34:03,611 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:34:03,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 13:34:03,611 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:34:03,611 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:34:03,611 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:34:03,611 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:34:03,611 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_0c3d7667-811c-4f7c-aaed-8f225366fad9/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 -> cf7f7457cdd0c5557ed6396b1b77324a2673e1bc1f66f80f06950a47fe88485c [2024-11-13 13:34:03,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:34:03,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:34:03,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:34:03,949 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:34:03,949 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:34:03,952 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c3d7667-811c-4f7c-aaed-8f225366fad9/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/combinations/gcd_2+newton_3_3.i Unable to find full path for "g++" [2024-11-13 13:34:05,878 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:34:06,202 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:34:06,203 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c3d7667-811c-4f7c-aaed-8f225366fad9/sv-benchmarks/c/combinations/gcd_2+newton_3_3.i [2024-11-13 13:34:06,214 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c3d7667-811c-4f7c-aaed-8f225366fad9/bin/uautomizer-verify-qhAvR1uOyd/data/29036d8be/74ed24dd3eeb41a685abde6644cdcd40/FLAG16fc736f7 [2024-11-13 13:34:06,236 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c3d7667-811c-4f7c-aaed-8f225366fad9/bin/uautomizer-verify-qhAvR1uOyd/data/29036d8be/74ed24dd3eeb41a685abde6644cdcd40 [2024-11-13 13:34:06,238 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:34:06,240 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:34:06,243 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:34:06,244 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:34:06,252 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:34:06,253 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:34:06" (1/1) ... [2024-11-13 13:34:06,254 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@424400db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:06, skipping insertion in model container [2024-11-13 13:34:06,254 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:34:06" (1/1) ... [2024-11-13 13:34:06,275 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:34:06,410 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_0c3d7667-811c-4f7c-aaed-8f225366fad9/sv-benchmarks/c/combinations/gcd_2+newton_3_3.i[1226,1239] [2024-11-13 13:34:06,438 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_0c3d7667-811c-4f7c-aaed-8f225366fad9/sv-benchmarks/c/combinations/gcd_2+newton_3_3.i[2862,2875] [2024-11-13 13:34:06,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:34:06,448 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:34:06,460 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_0c3d7667-811c-4f7c-aaed-8f225366fad9/sv-benchmarks/c/combinations/gcd_2+newton_3_3.i[1226,1239] [2024-11-13 13:34:06,471 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_0c3d7667-811c-4f7c-aaed-8f225366fad9/sv-benchmarks/c/combinations/gcd_2+newton_3_3.i[2862,2875] [2024-11-13 13:34:06,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:34:06,491 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:34:06,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:06 WrapperNode [2024-11-13 13:34:06,491 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:34:06,493 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:34:06,493 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:34:06,493 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:34:06,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:06" (1/1) ... [2024-11-13 13:34:06,507 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:06" (1/1) ... [2024-11-13 13:34:06,529 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 90 [2024-11-13 13:34:06,529 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:34:06,530 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:34:06,530 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:34:06,530 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:34:06,539 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:06" (1/1) ... [2024-11-13 13:34:06,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:06" (1/1) ... [2024-11-13 13:34:06,541 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:06" (1/1) ... [2024-11-13 13:34:06,552 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 13:34:06,552 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:06" (1/1) ... [2024-11-13 13:34:06,552 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:06" (1/1) ... [2024-11-13 13:34:06,557 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:06" (1/1) ... [2024-11-13 13:34:06,560 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:06" (1/1) ... [2024-11-13 13:34:06,561 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:06" (1/1) ... [2024-11-13 13:34:06,562 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:06" (1/1) ... [2024-11-13 13:34:06,564 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:34:06,565 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:34:06,565 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:34:06,565 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:34:06,566 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:06" (1/1) ... [2024-11-13 13:34:06,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:34:06,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c3d7667-811c-4f7c-aaed-8f225366fad9/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:34:06,607 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c3d7667-811c-4f7c-aaed-8f225366fad9/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:34:06,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c3d7667-811c-4f7c-aaed-8f225366fad9/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:34:06,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:34:06,640 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2024-11-13 13:34:06,640 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2024-11-13 13:34:06,640 INFO L130 BoogieDeclarations]: Found specification of procedure f [2024-11-13 13:34:06,640 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2024-11-13 13:34:06,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 13:34:06,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 13:34:06,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:34:06,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:34:06,738 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:34:06,739 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:34:06,974 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2024-11-13 13:34:06,974 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:34:06,993 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:34:06,994 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 13:34:06,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:34:06 BoogieIcfgContainer [2024-11-13 13:34:06,995 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:34:06,997 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:34:06,998 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:34:07,003 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:34:07,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:34:06" (1/3) ... [2024-11-13 13:34:07,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d0a6ab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:34:07, skipping insertion in model container [2024-11-13 13:34:07,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:06" (2/3) ... [2024-11-13 13:34:07,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d0a6ab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:34:07, skipping insertion in model container [2024-11-13 13:34:07,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:34:06" (3/3) ... [2024-11-13 13:34:07,007 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_3_3.i [2024-11-13 13:34:07,024 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:34:07,027 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG gcd_2+newton_3_3.i that has 3 procedures, 40 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2024-11-13 13:34:07,097 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:34:07,115 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;@24faef3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:34:07,116 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-13 13:34:07,123 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 13:34:07,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 13:34:07,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:34:07,131 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:34:07,132 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:34:07,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:34:07,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1738968779, now seen corresponding path program 1 times [2024-11-13 13:34:07,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:34:07,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519246848] [2024-11-13 13:34:07,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:34:07,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:34:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:07,480 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 13:34:07,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:34:07,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519246848] [2024-11-13 13:34:07,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519246848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:34:07,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:34:07,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:34:07,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968142769] [2024-11-13 13:34:07,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:34:07,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:34:07,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:34:07,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:34:07,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:34:07,512 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 13:34:07,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:34:07,590 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2024-11-13 13:34:07,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:34:07,593 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 13:34:07,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:34:07,599 INFO L225 Difference]: With dead ends: 78 [2024-11-13 13:34:07,599 INFO L226 Difference]: Without dead ends: 33 [2024-11-13 13:34:07,602 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 13:34:07,605 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 3 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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 13:34:07,606 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 13:34:07,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-13 13:34:07,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2024-11-13 13:34:07,642 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 13:34:07,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2024-11-13 13:34:07,647 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 11 [2024-11-13 13:34:07,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:34:07,648 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2024-11-13 13:34:07,648 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 13:34:07,649 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2024-11-13 13:34:07,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 13:34:07,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:34:07,650 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:34:07,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 13:34:07,650 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:34:07,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:34:07,651 INFO L85 PathProgramCache]: Analyzing trace with hash 36038583, now seen corresponding path program 1 times [2024-11-13 13:34:07,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:34:07,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624861852] [2024-11-13 13:34:07,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:34:07,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:34:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:07,782 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 13:34:07,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:34:07,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624861852] [2024-11-13 13:34:07,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624861852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:34:07,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:34:07,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:34:07,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335141092] [2024-11-13 13:34:07,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:34:07,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:34:07,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:34:07,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:34:07,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:34:07,786 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 13:34:07,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:34:07,818 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2024-11-13 13:34:07,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:34:07,819 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 13:34:07,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:34:07,820 INFO L225 Difference]: With dead ends: 39 [2024-11-13 13:34:07,820 INFO L226 Difference]: Without dead ends: 33 [2024-11-13 13:34:07,820 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 13:34:07,821 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 13:34:07,821 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 13:34:07,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-13 13:34:07,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-13 13:34:07,826 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 13:34:07,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2024-11-13 13:34:07,827 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 11 [2024-11-13 13:34:07,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:34:07,827 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-11-13 13:34:07,827 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 13:34:07,828 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2024-11-13 13:34:07,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 13:34:07,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:34:07,828 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:34:07,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 13:34:07,829 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:34:07,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:34:07,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1576478087, now seen corresponding path program 1 times [2024-11-13 13:34:07,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:34:07,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001551568] [2024-11-13 13:34:07,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:34:07,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:34:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:08,135 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 13:34:08,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:34:08,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001551568] [2024-11-13 13:34:08,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001551568] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:34:08,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164611286] [2024-11-13 13:34:08,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:34:08,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:34:08,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c3d7667-811c-4f7c-aaed-8f225366fad9/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:34:08,140 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c3d7667-811c-4f7c-aaed-8f225366fad9/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:34:08,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c3d7667-811c-4f7c-aaed-8f225366fad9/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 13:34:08,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:08,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 13:34:08,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:34:08,404 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 13:34:08,405 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:34:08,519 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 13:34:08,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164611286] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:34:08,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:34:08,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-13 13:34:08,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38576155] [2024-11-13 13:34:08,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:34:08,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 13:34:08,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:34:08,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 13:34:08,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-13 13:34:08,525 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 13:34:08,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:34:08,653 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2024-11-13 13:34:08,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 13:34:08,657 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 13:34:08,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:34:08,657 INFO L225 Difference]: With dead ends: 40 [2024-11-13 13:34:08,657 INFO L226 Difference]: Without dead ends: 34 [2024-11-13 13:34:08,658 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 13:34:08,659 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 13:34:08,659 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 13:34:08,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-13 13:34:08,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-13 13:34:08,667 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 13:34:08,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2024-11-13 13:34:08,670 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 12 [2024-11-13 13:34:08,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:34:08,670 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2024-11-13 13:34:08,670 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 13:34:08,671 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2024-11-13 13:34:08,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 13:34:08,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:34:08,671 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:34:08,694 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c3d7667-811c-4f7c-aaed-8f225366fad9/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 13:34:08,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c3d7667-811c-4f7c-aaed-8f225366fad9/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:34:08,878 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:34:08,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:34:08,878 INFO L85 PathProgramCache]: Analyzing trace with hash -24887305, now seen corresponding path program 2 times [2024-11-13 13:34:08,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:34:08,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328751334] [2024-11-13 13:34:08,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:34:08,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:34:08,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:09,471 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 13:34:09,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:34:09,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328751334] [2024-11-13 13:34:09,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328751334] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:34:09,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239804405] [2024-11-13 13:34:09,472 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 13:34:09,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:34:09,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c3d7667-811c-4f7c-aaed-8f225366fad9/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:34:09,474 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c3d7667-811c-4f7c-aaed-8f225366fad9/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:34:09,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c3d7667-811c-4f7c-aaed-8f225366fad9/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 13:34:09,575 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 13:34:09,575 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:34:09,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-13 13:34:09,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:35:04,837 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 13:35:04,837 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:35:41,822 WARN L286 SmtUtils]: Spent 7.14s 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 13:36:02,489 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 13:36:02,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239804405] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:36:02,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:36:02,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 24 [2024-11-13 13:36:02,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151090223] [2024-11-13 13:36:02,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:36:02,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-13 13:36:02,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:36:02,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-13 13:36:02,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=444, Unknown=14, NotChecked=0, Total=552 [2024-11-13 13:36:02,492 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 13:36:06,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 13:36:11,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-13 13:36:16,052 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 13:36:20,340 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 13:36:24,483 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 13:36:29,205 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 13:36:33,389 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 13:36:37,889 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 13:36:44,667 WARN L286 SmtUtils]: Spent 6.17s 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 13:36:49,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-13 13:36:53,398 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 13:36:55,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:36:55,124 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2024-11-13 13:36:55,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 13:36:55,125 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 13:36:55,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:36:55,126 INFO L225 Difference]: With dead ends: 50 [2024-11-13 13:36:55,126 INFO L226 Difference]: Without dead ends: 38 [2024-11-13 13:36:55,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 86.6s TimeCoverageRelationStatistics Valid=122, Invalid=566, Unknown=14, NotChecked=0, Total=702 [2024-11-13 13:36:55,128 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 5 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.5s IncrementalHoareTripleChecker+Time [2024-11-13 13:36:55,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 326 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 104 Invalid, 11 Unknown, 0 Unchecked, 44.5s Time] [2024-11-13 13:36:55,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-13 13:36:55,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-13 13:36:55,142 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 13:36:55,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-11-13 13:36:55,145 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 13 [2024-11-13 13:36:55,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:36:55,147 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-11-13 13:36:55,147 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 13:36:55,147 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-11-13 13:36:55,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-13 13:36:55,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:36:55,148 INFO L215 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:36:55,169 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c3d7667-811c-4f7c-aaed-8f225366fad9/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 13:36:55,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c3d7667-811c-4f7c-aaed-8f225366fad9/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:36:55,349 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:36:55,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:36:55,349 INFO L85 PathProgramCache]: Analyzing trace with hash -710557577, now seen corresponding path program 3 times [2024-11-13 13:36:55,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:36:55,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843269510] [2024-11-13 13:36:55,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:36:55,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:36:55,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:37:02,312 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 13:37:02,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:37:02,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843269510] [2024-11-13 13:37:02,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843269510] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:37:02,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47100777] [2024-11-13 13:37:02,312 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 13:37:02,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:37:02,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c3d7667-811c-4f7c-aaed-8f225366fad9/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:37:02,314 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c3d7667-811c-4f7c-aaed-8f225366fad9/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:37:02,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0c3d7667-811c-4f7c-aaed-8f225366fad9/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 13:37:02,525 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-13 13:37:02,525 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:37:02,527 WARN L253 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-13 13:37:02,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:37:46,126 WARN L286 SmtUtils]: Spent 7.65s 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 13:38:09,111 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (let ((.cse6 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) (.cse11 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse4 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256))) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse0 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse1 (mod (+ .cse6 .cse0) 256))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (not (= .cse0 0)) (<= 128 .cse1) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse5 (+ (- 256) .cse1))) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse5))) (let ((.cse3 (mod .cse5 .cse2))) (and (<= .cse2 |c_ULTIMATE.start_gcd_test_~a#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse3 0)) (<= (mod (+ (* 255 .cse0) |c_ULTIMATE.start_main1_~y~0#1| .cse2) 256) 127) (= .cse4 (mod (+ .cse3 (* 255 .cse2)) 256)) (not (= .cse2 0))))))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse10 (mod .cse7 256))) (let ((.cse9 (+ (- 256) .cse10))) (let ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse9))) (and (<= 128 (mod (+ (* 255 .cse7) .cse8) 256)) (= (mod .cse9 .cse8) 0) (<= 128 .cse10) (not (= .cse8 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= .cse8 |c_ULTIMATE.start_gcd_test_~a#1|))))))) .cse11) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse16 (mod (+ .cse6 .cse13) 256))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse15 (+ (- 256) .cse16))) (let ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse15))) (let ((.cse14 (mod .cse15 .cse12))) (and (<= .cse12 |c_ULTIMATE.start_gcd_test_~a#1|) (<= 128 (mod (+ (* 255 .cse13) |c_ULTIMATE.start_main1_~y~0#1| .cse12) 256)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse14 0)) (= .cse4 (mod (+ .cse14 (* 255 .cse12)) 256)) (not (= .cse12 0))))))) (not (= .cse13 0)) (<= 128 .cse16))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse17 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse18 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse17))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse17 .cse18)) (<= .cse18 |c_ULTIMATE.start_gcd_test_~a#1|) (<= 128 (+ .cse18 .cse17)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|)))) (<= .cse17 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse17 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse21 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse20 (mod (+ .cse6 .cse21) 256))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse20))) (and (<= (+ .cse19 .cse20) 127) (<= .cse19 |c_ULTIMATE.start_gcd_test_~a#1|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse20 .cse19)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse19 0))))) (not (= .cse20 0)) (not (= .cse21 0)) (<= .cse20 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse22 (mod .cse25 256))) (and (<= 128 .cse22) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse26 (+ (- 256) .cse22))) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse26))) (let ((.cse24 (mod .cse26 .cse23))) (and (= (mod (+ (* .cse23 255) .cse24) 256) .cse4) (<= (mod (+ (* 255 .cse25) .cse23) 256) 127) (not (= .cse23 0)) (not (= .cse24 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= .cse23 |c_ULTIMATE.start_gcd_test_~a#1|)))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse27 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (and (<= .cse27 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse27))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse27 .cse28)) (<= (+ .cse28 .cse27) 127) (<= .cse28 |c_ULTIMATE.start_gcd_test_~a#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse28 0))))) (not (= .cse27 0))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse31 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse30 (mod (+ .cse6 .cse31) 256))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse29 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse30))) (and (<= .cse29 |c_ULTIMATE.start_gcd_test_~a#1|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse30 .cse29)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= 128 (+ .cse29 .cse30))))) (not (= .cse30 0)) (not (= .cse31 0)) (<= .cse30 127))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse33 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse34 (mod (+ .cse6 .cse33) 256))) (let ((.cse35 (+ (- 256) .cse34))) (let ((.cse32 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse35))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= .cse32 |c_ULTIMATE.start_gcd_test_~a#1|) (<= 128 (mod (+ (* 255 .cse33) |c_ULTIMATE.start_main1_~y~0#1| .cse32) 256)) (not (= .cse33 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= 128 .cse34) (= (mod .cse35 .cse32) 0) (not (= .cse32 0)))))))) .cse11) (and .cse11 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse36 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse37 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse36))) (and (= (mod .cse36 .cse37) 0) (<= .cse36 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= .cse37 |c_ULTIMATE.start_gcd_test_~a#1|) (<= 128 (+ .cse37 .cse36)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse36 0))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse38 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse41 (mod .cse38 256))) (let ((.cse40 (+ (- 256) .cse41))) (let ((.cse39 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse40))) (and (<= (mod (+ (* 255 .cse38) .cse39) 256) 127) (= (mod .cse40 .cse39) 0) (<= 128 .cse41) (not (= .cse39 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= .cse39 |c_ULTIMATE.start_gcd_test_~a#1|))))))) .cse11) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse43 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse44 (mod (+ .cse6 .cse43) 256))) (let ((.cse45 (+ (- 256) .cse44))) (let ((.cse42 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse45))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= .cse42 |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse43 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= 128 .cse44) (<= (mod (+ (* 255 .cse43) |c_ULTIMATE.start_main1_~y~0#1| .cse42) 256) 127) (= (mod .cse45 .cse42) 0) (not (= .cse42 0)))))))) .cse11) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse48 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse46 (mod (+ .cse6 .cse48) 256))) (let ((.cse47 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse46))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (not (= .cse46 0)) (<= .cse47 |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse48 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= .cse46 127) (= (mod .cse46 .cse47) 0) (<= 128 (+ .cse47 .cse46))))))) .cse11) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse51 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse53 (mod .cse51 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse52 (+ (- 256) .cse53))) (let ((.cse49 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse52))) (let ((.cse50 (mod .cse52 .cse49))) (and (= (mod (+ (* .cse49 255) .cse50) 256) .cse4) (<= 128 (mod (+ (* 255 .cse51) .cse49) 256)) (not (= .cse49 0)) (not (= .cse50 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= .cse49 |c_ULTIMATE.start_gcd_test_~a#1|)))))) (<= 128 .cse53) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|))))))) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|)) is different from false [2024-11-13 13:38:53,404 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (let ((.cse0 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse14 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) (.cse1 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256))) (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 ((.cse4 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse5 (mod .cse4 256))) (let ((.cse6 (+ (- 256) .cse5))) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse6))) (let ((.cse3 (mod .cse6 .cse2))) (and (= .cse1 (mod (+ (* .cse2 255) .cse3) 256)) (<= (mod (+ (* 255 .cse4) .cse2) 256) 127) (<= 128 .cse5) (not (= .cse2 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse3 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= .cse2 |v_ULTIMATE.start_gcd_test_~a#1_26|))))))))) (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 ((.cse7 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse7))) (and (<= .cse7 127) (<= .cse8 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= 128 (+ .cse8 .cse7)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse7 .cse8)))))) .cse0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse10 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse10))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (<= .cse9 |v_ULTIMATE.start_gcd_test_~a#1_26|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|))) (<= (+ .cse9 .cse10) 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse9 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse10 .cse9))))) (<= .cse10 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse10 0))))) (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 ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse12 (mod (+ .cse14 .cse13) 256))) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse12))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= (+ .cse11 .cse12) 127) (not (= .cse13 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= .cse11 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse12 .cse11)) (<= .cse11 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))) .cse0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse15 (mod (+ .cse14 .cse16) 256))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (not (= .cse15 0)) (not (= .cse16 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse15))) (and (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse17 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse15 .cse17)) (<= 128 (+ .cse17 .cse15))))) (<= .cse15 127))))) (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 ((.cse19 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse20 (mod (+ .cse14 .cse19) 256))) (let ((.cse22 (+ (- 256) .cse20))) (let ((.cse18 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse22))) (let ((.cse21 (mod .cse22 .cse18))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= .cse18 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= 128 (mod (+ (* 255 .cse19) |c_ULTIMATE.start_main1_~y~0#1| .cse18) 256)) (not (= .cse19 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= 128 .cse20) (not (= .cse21 0)) (= .cse1 (mod (+ .cse21 (* 255 .cse18)) 256)) (not (= .cse18 0)))))))))) (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 ((.cse24 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse24))) (and (<= .cse23 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= (+ .cse23 .cse24) 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|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= .cse23 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse24 .cse23))))))) (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 ((.cse25 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse26 (mod (+ .cse14 .cse25) 256))) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse26))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (not (= .cse25 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= .cse26 127) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse26 .cse27)) (<= 128 (+ .cse27 .cse26)) (<= .cse27 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))) .cse0) (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 ((.cse29 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse30 (mod (+ .cse14 .cse29) 256))) (let ((.cse32 (+ (- 256) .cse30))) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse32))) (let ((.cse31 (mod .cse32 .cse28))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= .cse28 |v_ULTIMATE.start_gcd_test_~a#1_26|) (not (= .cse29 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= 128 .cse30) (not (= .cse31 0)) (<= (mod (+ (* 255 .cse29) |c_ULTIMATE.start_main1_~y~0#1| .cse28) 256) 127) (= .cse1 (mod (+ .cse31 (* 255 .cse28)) 256)) (not (= .cse28 0))))))))) .cse0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse34 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse33 (mod (+ .cse14 .cse34) 256))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (not (= .cse33 0)) (not (= .cse34 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse35 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse33))) (and (<= (+ .cse35 .cse33) 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse35 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (not (= .cse35 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse33 .cse35))))) (<= .cse33 127))))) (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 ((.cse38 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse39 (mod .cse38 256))) (let ((.cse40 (+ (- 256) .cse39))) (let ((.cse36 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse40))) (let ((.cse37 (mod .cse40 .cse36))) (and (= .cse1 (mod (+ (* .cse36 255) .cse37) 256)) (<= 128 (mod (+ (* 255 .cse38) .cse36) 256)) (<= 128 .cse39) (not (= .cse36 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse37 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= .cse36 |v_ULTIMATE.start_gcd_test_~a#1_26|))))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse41 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (and (<= .cse41 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse41 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse42 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse41))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (<= .cse42 |v_ULTIMATE.start_gcd_test_~a#1_26|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|))) (<= 128 (+ .cse42 .cse41)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod .cse41 .cse42)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse43 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse47 (mod (+ .cse14 .cse43) 256))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse46 (+ (- 256) .cse47))) (let ((.cse44 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse46))) (let ((.cse45 (mod .cse46 .cse44))) (and (<= 128 (mod (+ (* 255 .cse43) |c_ULTIMATE.start_main1_~y~0#1| .cse44) 256)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (<= .cse44 |v_ULTIMATE.start_gcd_test_~a#1_26|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|))) (not (= .cse45 0)) (= .cse1 (mod (+ .cse45 (* 255 .cse44)) 256)) (not (= .cse44 0))))))) (not (= .cse43 0)) (<= 128 .cse47))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse50 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse52 (mod (+ .cse14 .cse50) 256))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse51 (+ (- 256) .cse52))) (let ((.cse48 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse51))) (let ((.cse49 (mod .cse51 .cse48))) (and (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (<= .cse48 |v_ULTIMATE.start_gcd_test_~a#1_26|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|))) (not (= .cse49 0)) (<= (mod (+ (* 255 .cse50) |c_ULTIMATE.start_main1_~y~0#1| .cse48) 256) 127) (= .cse1 (mod (+ .cse49 (* 255 .cse48)) 256)) (not (= .cse48 0))))))) (not (= .cse50 0)) (<= 128 .cse52))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse55 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse57 (mod .cse55 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse56 (+ (- 256) .cse57))) (let ((.cse53 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse56))) (let ((.cse54 (mod .cse56 .cse53))) (and (= .cse1 (mod (+ (* .cse53 255) .cse54) 256)) (<= (mod (+ (* 255 .cse55) .cse53) 256) 127) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse53 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (not (= .cse53 0)) (not (= .cse54 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|)))))) (<= 128 .cse57) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse60 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse62 (mod .cse60 256))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int)) (let ((.cse61 (+ (- 256) .cse62))) (let ((.cse58 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse61))) (let ((.cse59 (mod .cse61 .cse58))) (and (= .cse1 (mod (+ (* .cse58 255) .cse59) 256)) (<= 128 (mod (+ (* 255 .cse60) .cse58) 256)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse58 |v_ULTIMATE.start_gcd_test_~a#1_26|))) (not (= .cse58 0)) (not (= .cse59 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|)))))) (<= 128 .cse62) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|))))))) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2024-11-13 13:39:59,860 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (let ((.cse21 (* |c_ULTIMATE.start_gcd_test_~a#1| 255)) (.cse22 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse6 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) (.cse0 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse1 (<= (mod |c_ULTIMATE.start_gcd_test_~a#1| 256) 127)) (.cse11 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|))) (or (and (or (and .cse0 .cse1 (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 ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse4 (mod (+ .cse6 .cse5) 256))) (let ((.cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse4))) (let ((.cse2 (mod .cse4 .cse3))) (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| .cse2)) (not (= .cse2 0)) (<= (+ .cse3 .cse4) 127) (not (= .cse5 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= (mod .cse2 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= .cse3 0)) (<= .cse3 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse8 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse7 (mod (+ .cse6 .cse8) 256))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (not (= .cse7 0)) (not (= .cse8 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse10 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse7))) (let ((.cse9 (mod .cse7 .cse10))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse9)) (not (= .cse9 0)) (<= (+ .cse10 .cse7) 127) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse10 0)) (<= .cse10 |v_ULTIMATE.start_gcd_test_~a#1_26|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse9 |c_ULTIMATE.start_gcd_test_~a#1|)))))) (<= .cse7 127)))))) .cse11) (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 ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse14 (mod .cse12 256))) (let ((.cse17 (+ (- 256) .cse14))) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse17))) (let ((.cse15 (mod .cse17 .cse13))) (let ((.cse16 (+ (- 256) (mod (+ (* .cse13 255) .cse15) 256)))) (and (<= 128 (mod (+ (* 255 .cse12) .cse13) 256)) (<= 128 .cse14) (not (= .cse13 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse15 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse16) |c_ULTIMATE.start_gcd_test_~a#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= (mod .cse16 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= .cse13 |v_ULTIMATE.start_gcd_test_~a#1_26|))))))))) .cse1) (and .cse11 (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 ((.cse23 (mod (+ .cse6 .cse20) 256))) (let ((.cse26 (+ (- 256) .cse23))) (let ((.cse18 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse26))) (let ((.cse24 (mod .cse26 .cse18))) (let ((.cse25 (+ (- 256) (mod (+ .cse24 (* 255 .cse18)) 256)))) (let ((.cse19 (mod .cse25 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= .cse18 |v_ULTIMATE.start_gcd_test_~a#1_26|) (not (= .cse19 0)) (<= 128 (mod (+ (* 255 .cse20) |c_ULTIMATE.start_main1_~y~0#1| .cse18) 256)) (= (mod (+ .cse21 .cse19) 256) .cse22) (not (= .cse20 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= 128 .cse23) (not (= .cse24 0)) (not (= .cse18 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse25) |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 ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse29 (mod (+ .cse6 .cse28) 256))) (let ((.cse32 (+ (- 256) .cse29))) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse32))) (let ((.cse30 (mod .cse32 .cse27))) (let ((.cse31 (+ (- 256) (mod (+ .cse30 (* 255 .cse27)) 256)))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= .cse27 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= 128 (mod (+ (* 255 .cse28) |c_ULTIMATE.start_main1_~y~0#1| .cse27) 256)) (not (= .cse28 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= 128 .cse29) (not (= .cse30 0)) (not (= .cse27 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse31) |c_ULTIMATE.start_gcd_test_~a#1|) (= (mod .cse31 |c_ULTIMATE.start_gcd_test_~a#1|) 0))))))))) .cse0 .cse1) (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 ((.cse34 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse33 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse34))) (let ((.cse35 (mod .cse34 .cse33))) (and (<= .cse33 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= (+ .cse33 .cse34) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (= (mod .cse35 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse33 0)) (not (= .cse35 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse35))))))) .cse0 .cse1) (and .cse11 (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 .cse21) 256) .cse22))))))))))) (and .cse11 (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 ((.cse43 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse45 (mod .cse43 256))) (let ((.cse49 (+ (- 256) .cse45))) (let ((.cse44 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse49))) (let ((.cse47 (mod .cse49 .cse44))) (let ((.cse48 (+ (- 256) (mod (+ (* .cse44 255) .cse47) 256)))) (let ((.cse46 (mod .cse48 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= 128 (mod (+ (* 255 .cse43) .cse44) 256)) (<= 128 .cse45) (not (= .cse44 0)) (not (= .cse46 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse47 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse48) |c_ULTIMATE.start_gcd_test_~a#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= .cse44 |v_ULTIMATE.start_gcd_test_~a#1_26|) (= (mod (+ .cse46 .cse21) 256) .cse22))))))))))) (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 ((.cse50 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse51 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse50))) (let ((.cse52 (mod .cse50 .cse51))) (and (<= .cse50 127) (<= .cse51 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= 128 (+ .cse51 .cse50)) (= (mod .cse52 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse52 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse52))))))) .cse0 .cse1) (and .cse11 (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 ((.cse55 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse54 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse55))) (let ((.cse53 (mod .cse55 .cse54))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse53 |c_ULTIMATE.start_gcd_test_~a#1|)) (<= .cse54 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= (+ .cse54 .cse55) 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 (= .cse54 0)) (not (= .cse53 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse53)))))))) (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 ((.cse57 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse58 (mod (+ .cse6 .cse57) 256))) (let ((.cse61 (+ (- 256) .cse58))) (let ((.cse56 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse61))) (let ((.cse59 (mod .cse61 .cse56))) (let ((.cse60 (+ (- 256) (mod (+ .cse59 (* 255 .cse56)) 256)))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= .cse56 |v_ULTIMATE.start_gcd_test_~a#1_26|) (not (= .cse57 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= 128 .cse58) (not (= .cse59 0)) (<= (mod (+ (* 255 .cse57) |c_ULTIMATE.start_main1_~y~0#1| .cse56) 256) 127) (not (= .cse56 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse60) |c_ULTIMATE.start_gcd_test_~a#1|) (= (mod .cse60 |c_ULTIMATE.start_gcd_test_~a#1|) 0))))))))) .cse1) (and .cse11 (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 ((.cse64 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse65 (mod (+ .cse6 .cse64) 256))) (let ((.cse68 (+ (- 256) .cse65))) (let ((.cse62 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse68))) (let ((.cse66 (mod .cse68 .cse62))) (let ((.cse67 (+ (- 256) (mod (+ .cse66 (* 255 .cse62)) 256)))) (let ((.cse63 (mod .cse67 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= .cse62 |v_ULTIMATE.start_gcd_test_~a#1_26|) (not (= .cse63 0)) (= (mod (+ .cse21 .cse63) 256) .cse22) (not (= .cse64 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= 128 .cse65) (not (= .cse66 0)) (<= (mod (+ (* 255 .cse64) |c_ULTIMATE.start_main1_~y~0#1| .cse62) 256) 127) (not (= .cse62 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse67) |c_ULTIMATE.start_gcd_test_~a#1|))))))))))) (and .cse11 (or (and .cse0 .cse1 (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 ((.cse70 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse71 (mod (+ .cse6 .cse70) 256))) (let ((.cse72 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse71))) (let ((.cse69 (mod .cse71 .cse72))) (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| .cse69)) (not (= .cse69 0)) (not (= .cse70 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= (mod .cse69 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= .cse71 127) (<= 128 (+ .cse72 .cse71)) (<= .cse72 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse76 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse73 (mod (+ .cse6 .cse76) 256))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (not (= .cse73 0)) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse75 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse73))) (let ((.cse74 (mod .cse73 .cse75))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse74)) (not (= .cse74 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= 128 (+ .cse75 .cse73)) (<= .cse75 |v_ULTIMATE.start_gcd_test_~a#1_26|) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse74 |c_ULTIMATE.start_gcd_test_~a#1|)))))) (not (= .cse76 0)) (<= .cse73 127))))))) (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 .cse1) (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))))))) .cse11))) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2024-11-13 13:40:49,039 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|) (let ((.cse1 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse0 (<= (+ |c_ULTIMATE.start_gcd_test_~a#1| 1) 0)) (.cse19 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse18 (* |c_ULTIMATE.start_main1_~y~0#1| 255))) (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 ((.cse4 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse6 (mod .cse4 256))) (let ((.cse9 (+ (- 256) .cse6))) (let ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse9))) (let ((.cse7 (mod .cse9 .cse5))) (let ((.cse8 (+ (- 256) (mod (+ (* .cse5 255) .cse7) 256)))) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse8))) (let ((.cse3 (mod .cse8 .cse2))) (and (= .cse1 (mod (+ (* .cse2 255) .cse3) 256)) (<= (mod (+ (* 255 .cse4) .cse5) 256) 127) (<= 128 .cse6) (not (= .cse5 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse2 |c_ULTIMATE.start_gcd_test_~a#1|)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse7 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse2 0)) (not (= .cse3 0)) (<= .cse5 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))))))))) (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 ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse14 (mod (+ .cse18 .cse12) 256))) (let ((.cse17 (+ (- 256) .cse14))) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse17))) (let ((.cse15 (mod .cse17 .cse11))) (let ((.cse16 (+ (- 256) (mod (+ .cse15 (* 255 .cse11)) 256)))) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse16))) (let ((.cse10 (mod .cse16 .cse13))) (and (not (= .cse10 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= .cse11 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= 128 (mod (+ (* 255 .cse12) |c_ULTIMATE.start_main1_~y~0#1| .cse11) 256)) (not (= .cse12 0)) (= .cse1 (mod (+ (* .cse13 255) .cse10) 256)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse13 0)) (<= 128 .cse14) (not (= .cse15 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse13 |c_ULTIMATE.start_gcd_test_~a#1|)) (not (= .cse11 0)))))))))))) .cse0) (and .cse19 (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 |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse23 (mod (+ .cse18 .cse21) 256))) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse23))) (let ((.cse22 (mod .cse23 .cse24))) (let ((.cse20 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse22))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (= (mod .cse20 |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|) (not (= .cse21 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= (mod .cse22 .cse20) |c_ULTIMATE.start_gcd_test_~a#1|) (<= .cse23 127) (not (= .cse20 0)) (<= 128 (+ .cse24 .cse23)) (<= .cse24 |v_ULTIMATE.start_gcd_test_~a#1_26|))))))))) (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 ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse29 (mod (+ .cse18 .cse27) 256))) (let ((.cse32 (+ (- 256) .cse29))) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse32))) (let ((.cse30 (mod .cse32 .cse26))) (let ((.cse31 (+ (- 256) (mod (+ .cse30 (* 255 .cse26)) 256)))) (let ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse31))) (let ((.cse25 (mod .cse31 .cse28))) (and (not (= .cse25 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= .cse26 |v_ULTIMATE.start_gcd_test_~a#1_26|) (not (= .cse27 0)) (= .cse1 (mod (+ (* .cse28 255) .cse25) 256)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse28 0)) (<= 128 .cse29) (not (= .cse30 0)) (<= (mod (+ (* 255 .cse27) |c_ULTIMATE.start_main1_~y~0#1| .cse26) 256) 127) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse28 |c_ULTIMATE.start_gcd_test_~a#1|)) (not (= .cse26 0)))))))))))) .cse0) (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 ((.cse36 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse35 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse36))) (let ((.cse34 (mod .cse36 .cse35))) (let ((.cse33 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse34))) (and (not (= .cse33 0)) (= (mod .cse34 .cse33) |c_ULTIMATE.start_gcd_test_~a#1|) (<= .cse35 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= (+ .cse35 .cse36) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (= (mod .cse33 |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse35 0)))))))) .cse19) (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 ((.cse39 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse41 (mod .cse39 256))) (let ((.cse44 (+ (- 256) .cse41))) (let ((.cse40 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse44))) (let ((.cse42 (mod .cse44 .cse40))) (let ((.cse43 (+ (- 256) (mod (+ (* .cse40 255) .cse42) 256)))) (let ((.cse37 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse43))) (let ((.cse38 (mod .cse43 .cse37))) (and (= .cse1 (mod (+ (* .cse37 255) .cse38) 256)) (<= 128 (mod (+ (* 255 .cse39) .cse40) 256)) (<= 128 .cse41) (not (= .cse40 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse37 |c_ULTIMATE.start_gcd_test_~a#1|)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse42 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse37 0)) (not (= .cse38 0)) (<= .cse40 |v_ULTIMATE.start_gcd_test_~a#1_26|))))))))))) .cse0) (and .cse19 (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 ((.cse47 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse48 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse47))) (let ((.cse46 (mod .cse47 .cse48))) (let ((.cse45 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse46))) (and (not (= .cse45 0)) (= (mod .cse46 .cse45) |c_ULTIMATE.start_gcd_test_~a#1|) (<= .cse47 127) (<= .cse48 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= 128 (+ .cse48 .cse47)) (= (mod .cse45 |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|)))))))) (and .cse19 (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 ((.cse52 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse51 (mod (+ .cse18 .cse52) 256))) (let ((.cse50 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse51))) (let ((.cse53 (mod .cse51 .cse50))) (let ((.cse49 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse53))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (= (mod .cse49 |c_ULTIMATE.start_gcd_test_~a#1|) |c_ULTIMATE.start_gcd_test_~b#1|) (<= (+ .cse50 .cse51) 127) (not (= .cse52 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= (mod .cse53 .cse49) |c_ULTIMATE.start_gcd_test_~a#1|) (not (= .cse50 0)) (not (= .cse49 0)) (<= .cse50 |v_ULTIMATE.start_gcd_test_~a#1_26|))))))))))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2024-11-13 13:41:16,486 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (let ((.cse11 (<= (+ |c_ULTIMATE.start_gcd_test_~a#1| 1) 0)) (.cse12 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse10 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) (.cse0 (<= 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 ((.cse3 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse4 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse3))) (let ((.cse2 (mod .cse3 .cse4))) (let ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse2))) (and (not (= .cse1 0)) (= (mod .cse1 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= (mod .cse2 .cse1) |c_ULTIMATE.start_gcd_test_~a#1|) (<= .cse3 127) (<= .cse4 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= 128 (+ .cse4 .cse3)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|)))))))) (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 ((.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse8 (mod (+ .cse10 .cse5) 256))) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse8))) (let ((.cse6 (mod .cse8 .cse9))) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse6))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (not (= .cse5 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= (mod .cse6 .cse7) |c_ULTIMATE.start_gcd_test_~a#1|) (<= .cse8 127) (= (mod .cse7 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= .cse7 0)) (<= 128 (+ .cse9 .cse8)) (<= .cse9 |v_ULTIMATE.start_gcd_test_~a#1_26|))))))))) (and .cse11 (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 ((.cse15 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse17 (mod .cse15 256))) (let ((.cse20 (+ (- 256) .cse17))) (let ((.cse16 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse20))) (let ((.cse18 (mod .cse20 .cse16))) (let ((.cse19 (+ (- 256) (mod (+ (* .cse16 255) .cse18) 256)))) (let ((.cse13 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse19))) (let ((.cse14 (mod .cse19 .cse13))) (and (= .cse12 (mod (+ (* .cse13 255) .cse14) 256)) (<= 128 (mod (+ (* 255 .cse15) .cse16) 256)) (<= 128 .cse17) (not (= .cse16 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse18 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse13 0)) (not (= .cse14 0)) (<= .cse16 |v_ULTIMATE.start_gcd_test_~a#1_26|) (= (mod .cse13 |c_ULTIMATE.start_gcd_test_~a#1|) 0)))))))))))) (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 ((.cse24 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse24))) (let ((.cse22 (mod .cse24 .cse23))) (let ((.cse21 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse22))) (and (not (= .cse21 0)) (= (mod .cse21 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (= (mod .cse22 .cse21) |c_ULTIMATE.start_gcd_test_~a#1|) (<= .cse23 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= (+ .cse23 .cse24) 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 (= .cse23 0))))))))) (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 ((.cse28 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse29 (mod (+ .cse10 .cse28) 256))) (let ((.cse32 (+ (- 256) .cse29))) (let ((.cse26 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse32))) (let ((.cse30 (mod .cse32 .cse26))) (let ((.cse31 (+ (- 256) (mod (+ .cse30 (* 255 .cse26)) 256)))) (let ((.cse27 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse31))) (let ((.cse25 (mod .cse31 .cse27))) (and (not (= .cse25 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= .cse26 |v_ULTIMATE.start_gcd_test_~a#1_26|) (= (mod .cse27 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= .cse28 0)) (= .cse12 (mod (+ (* .cse27 255) .cse25) 256)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse27 0)) (<= 128 .cse29) (not (= .cse30 0)) (<= (mod (+ (* 255 .cse28) |c_ULTIMATE.start_main1_~y~0#1| .cse26) 256) 127) (not (= .cse26 0)))))))))))) .cse11) (and .cse11 (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 ((.cse37 (mod (+ .cse10 .cse36) 256))) (let ((.cse40 (+ (- 256) .cse37))) (let ((.cse34 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse40))) (let ((.cse38 (mod .cse40 .cse34))) (let ((.cse39 (+ (- 256) (mod (+ .cse38 (* 255 .cse34)) 256)))) (let ((.cse35 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse39))) (let ((.cse33 (mod .cse39 .cse35))) (and (not (= .cse33 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= .cse34 |v_ULTIMATE.start_gcd_test_~a#1_26|) (= (mod .cse35 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= 128 (mod (+ (* 255 .cse36) |c_ULTIMATE.start_main1_~y~0#1| .cse34) 256)) (not (= .cse36 0)) (= .cse12 (mod (+ (* .cse35 255) .cse33) 256)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse35 0)) (<= 128 .cse37) (not (= .cse38 0)) (not (= .cse34 0))))))))))))) (and .cse11 (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 ((.cse43 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse45 (mod .cse43 256))) (let ((.cse48 (+ (- 256) .cse45))) (let ((.cse44 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse48))) (let ((.cse46 (mod .cse48 .cse44))) (let ((.cse47 (+ (- 256) (mod (+ (* .cse44 255) .cse46) 256)))) (let ((.cse41 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse47))) (let ((.cse42 (mod .cse47 .cse41))) (and (= .cse12 (mod (+ (* .cse41 255) .cse42) 256)) (<= (mod (+ (* 255 .cse43) .cse44) 256) 127) (<= 128 .cse45) (not (= .cse44 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse46 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse41 0)) (not (= .cse42 0)) (<= .cse44 |v_ULTIMATE.start_gcd_test_~a#1_26|) (= (mod .cse41 |c_ULTIMATE.start_gcd_test_~a#1|) 0)))))))))))) (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 ((.cse51 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse50 (mod (+ .cse10 .cse51) 256))) (let ((.cse49 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse50))) (let ((.cse52 (mod .cse50 .cse49))) (let ((.cse53 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse52))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= (+ .cse49 .cse50) 127) (not (= .cse51 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= (mod .cse52 .cse53) |c_ULTIMATE.start_gcd_test_~a#1|) (= (mod .cse53 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= .cse49 0)) (not (= .cse53 0)) (<= .cse49 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))))) .cse0))) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2024-11-13 13:41:44,009 WARN L851 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main1_~y~0#1| 0)) (let ((.cse15 (<= 0 |c_ULTIMATE.start_gcd_test_#res#1|)) (.cse7 (+ 256 |c_ULTIMATE.start_gcd_test_#res#1|)) (.cse10 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) (.cse0 (<= (+ 1 |c_ULTIMATE.start_gcd_test_#res#1|) 0))) (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 ((.cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse5 (mod (+ .cse10 .cse3) 256))) (let ((.cse9 (+ (- 256) .cse5))) (let ((.cse2 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse9))) (let ((.cse6 (mod .cse9 .cse2))) (let ((.cse8 (+ (- 256) (mod (+ .cse6 (* 255 .cse2)) 256)))) (let ((.cse4 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse8))) (let ((.cse1 (mod .cse8 .cse4))) (and (not (= .cse1 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= .cse2 |v_ULTIMATE.start_gcd_test_~a#1_26|) (not (= .cse3 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse4 0)) (<= 128 .cse5) (not (= .cse6 0)) (<= (mod (+ (* 255 .cse3) |c_ULTIMATE.start_main1_~y~0#1| .cse2) 256) 127) (= (mod (+ (* .cse4 255) .cse1) 256) .cse7) (not (= .cse2 0)) (= (mod .cse4 |c_ULTIMATE.start_gcd_test_#res#1|) 0)))))))))))) (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 ((.cse13 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse13))) (let ((.cse12 (mod .cse13 .cse14))) (let ((.cse11 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse12))) (and (not (= .cse11 0)) (= (mod .cse12 .cse11) |c_ULTIMATE.start_gcd_test_#res#1|) (<= .cse13 127) (<= .cse14 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= 128 (+ .cse14 .cse13)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= (mod .cse11 |c_ULTIMATE.start_gcd_test_#res#1|) 0))))))) .cse15) (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 ((.cse19 (mod (+ .cse10 .cse20) 256))) (let ((.cse18 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse19))) (let ((.cse16 (mod .cse19 .cse18))) (let ((.cse17 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse16))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (= (mod .cse16 .cse17) |c_ULTIMATE.start_gcd_test_#res#1|) (<= (+ .cse18 .cse19) 127) (not (= .cse20 0)) (= (mod .cse17 |c_ULTIMATE.start_gcd_test_#res#1|) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse18 0)) (not (= .cse17 0)) (<= .cse18 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))))) .cse15) (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 ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse25 (mod .cse23 256))) (let ((.cse28 (+ (- 256) .cse25))) (let ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse28))) (let ((.cse26 (mod .cse28 .cse24))) (let ((.cse27 (+ (- 256) (mod (+ (* .cse24 255) .cse26) 256)))) (let ((.cse21 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse27))) (let ((.cse22 (mod .cse27 .cse21))) (and (= .cse7 (mod (+ (* .cse21 255) .cse22) 256)) (<= (mod (+ (* 255 .cse23) .cse24) 256) 127) (<= 128 .cse25) (not (= .cse24 0)) (= (mod .cse21 |c_ULTIMATE.start_gcd_test_#res#1|) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse26 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse21 0)) (not (= .cse22 0)) (<= .cse24 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))))))))) (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 ((.cse32 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse31 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse32))) (let ((.cse30 (mod .cse32 .cse31))) (let ((.cse29 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse30))) (and (not (= .cse29 0)) (= (mod .cse30 .cse29) |c_ULTIMATE.start_gcd_test_#res#1|) (<= .cse31 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= (+ .cse31 .cse32) 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 (= .cse31 0)) (= (mod .cse29 |c_ULTIMATE.start_gcd_test_#res#1|) 0))))))) .cse15) (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 ((.cse35 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse36 (mod (+ .cse10 .cse35) 256))) (let ((.cse37 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse36))) (let ((.cse33 (mod .cse36 .cse37))) (let ((.cse34 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse33))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (= (mod .cse33 .cse34) |c_ULTIMATE.start_gcd_test_#res#1|) (not (= .cse35 0)) (= (mod .cse34 |c_ULTIMATE.start_gcd_test_#res#1|) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= .cse36 127) (not (= .cse34 0)) (<= 128 (+ .cse37 .cse36)) (<= .cse37 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))))) .cse15) (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 ((.cse40 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse42 (mod .cse40 256))) (let ((.cse45 (+ (- 256) .cse42))) (let ((.cse41 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse45))) (let ((.cse43 (mod .cse45 .cse41))) (let ((.cse44 (+ (- 256) (mod (+ (* .cse41 255) .cse43) 256)))) (let ((.cse38 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse44))) (let ((.cse39 (mod .cse44 .cse38))) (and (= .cse7 (mod (+ (* .cse38 255) .cse39) 256)) (<= 128 (mod (+ (* 255 .cse40) .cse41) 256)) (<= 128 .cse42) (not (= .cse41 0)) (= (mod .cse38 |c_ULTIMATE.start_gcd_test_#res#1|) 0) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse43 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse38 0)) (not (= .cse39 0)) (<= .cse41 |v_ULTIMATE.start_gcd_test_~a#1_26|))))))))))) .cse0) (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 ((.cse48 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse50 (mod (+ .cse10 .cse48) 256))) (let ((.cse53 (+ (- 256) .cse50))) (let ((.cse47 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse53))) (let ((.cse51 (mod .cse53 .cse47))) (let ((.cse52 (+ (- 256) (mod (+ .cse51 (* 255 .cse47)) 256)))) (let ((.cse49 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse52))) (let ((.cse46 (mod .cse52 .cse49))) (and (not (= .cse46 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= .cse47 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= 128 (mod (+ (* 255 .cse48) |c_ULTIMATE.start_main1_~y~0#1| .cse47) 256)) (not (= .cse48 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse49 0)) (<= 128 .cse50) (not (= .cse51 0)) (= (mod (+ (* .cse49 255) .cse46) 256) .cse7) (not (= .cse47 0)) (= (mod .cse49 |c_ULTIMATE.start_gcd_test_#res#1|) 0))))))))))) .cse0))) (not (= 0 |c_ULTIMATE.start_gcd_test_#res#1|)) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|)) is different from false [2024-11-13 13:42:10,988 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)) (let ((.cse20 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) (.cse9 (<= (+ |c_ULTIMATE.start_main1_~g~0#1| 1) 0)) (.cse3 (+ 256 |c_ULTIMATE.start_main1_~g~0#1|)) (.cse14 (<= 0 |c_ULTIMATE.start_main1_~g~0#1|))) (or (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 ((.cse0 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse2 (mod .cse0 256))) (let ((.cse8 (+ (- 256) .cse2))) (let ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse8))) (let ((.cse6 (mod .cse8 .cse1))) (let ((.cse7 (+ (- 256) (mod (+ (* .cse1 255) .cse6) 256)))) (let ((.cse4 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse7))) (let ((.cse5 (mod .cse7 .cse4))) (and (<= (mod (+ (* 255 .cse0) .cse1) 256) 127) (<= 128 .cse2) (not (= .cse1 0)) (= .cse3 (mod (+ (* .cse4 255) .cse5) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse6 0)) (= (mod .cse4 |c_ULTIMATE.start_main1_~g~0#1|) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse4 0)) (not (= .cse5 0)) (<= .cse1 |v_ULTIMATE.start_gcd_test_~a#1_26|))))))))))) .cse9) (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 ((.cse11 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse11))) (let ((.cse13 (mod .cse11 .cse12))) (let ((.cse10 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse13))) (and (not (= .cse10 0)) (<= .cse11 127) (<= .cse12 |v_ULTIMATE.start_gcd_test_~a#1_26|) (= (mod .cse13 .cse10) |c_ULTIMATE.start_main1_~g~0#1|) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (<= 128 (+ .cse12 .cse11)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (= (mod .cse10 |c_ULTIMATE.start_main1_~g~0#1|) 0))))))) .cse14) (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 ((.cse18 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse17 (mod (+ .cse20 .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|)))))))) .cse14) (and .cse9 (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 ((.cse24 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse25 (mod (+ .cse20 .cse24) 256))) (let ((.cse28 (+ (- 256) .cse25))) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse28))) (let ((.cse26 (mod .cse28 .cse23))) (let ((.cse27 (+ (- 256) (mod (+ .cse26 (* 255 .cse23)) 256)))) (let ((.cse21 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse27))) (let ((.cse22 (mod .cse27 .cse21))) (and (= (mod .cse21 |c_ULTIMATE.start_main1_~g~0#1|) 0) (not (= .cse22 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= .cse23 |v_ULTIMATE.start_gcd_test_~a#1_26|) (= (mod (+ (* .cse21 255) .cse22) 256) .cse3) (<= 128 (mod (+ (* 255 .cse24) |c_ULTIMATE.start_main1_~y~0#1| .cse23) 256)) (not (= .cse24 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse21 0)) (<= 128 .cse25) (not (= .cse26 0)) (not (= .cse23 0))))))))))))) (and .cse9 (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 ((.cse32 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse33 (mod (+ .cse20 .cse32) 256))) (let ((.cse36 (+ (- 256) .cse33))) (let ((.cse31 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse36))) (let ((.cse34 (mod .cse36 .cse31))) (let ((.cse35 (+ (- 256) (mod (+ .cse34 (* 255 .cse31)) 256)))) (let ((.cse29 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse35))) (let ((.cse30 (mod .cse35 .cse29))) (and (= (mod .cse29 |c_ULTIMATE.start_main1_~g~0#1|) 0) (not (= .cse30 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (<= .cse31 |v_ULTIMATE.start_gcd_test_~a#1_26|) (= (mod (+ (* .cse29 255) .cse30) 256) .cse3) (not (= .cse32 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse29 0)) (<= 128 .cse33) (not (= .cse34 0)) (<= (mod (+ (* 255 .cse32) |c_ULTIMATE.start_main1_~y~0#1| .cse31) 256) 127) (not (= .cse31 0))))))))))))) (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 ((.cse38 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse39 (mod (+ .cse20 .cse38) 256))) (let ((.cse41 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse39))) (let ((.cse40 (mod .cse39 .cse41))) (let ((.cse37 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse40))) (and (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_23| 1) 0) (= (mod .cse37 |c_ULTIMATE.start_main1_~g~0#1|) 0) (not (= .cse38 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (<= .cse39 127) (= (mod .cse40 .cse37) |c_ULTIMATE.start_main1_~g~0#1|) (not (= .cse37 0)) (<= 128 (+ .cse41 .cse39)) (<= .cse41 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))))) .cse14) (and .cse9 (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 ((.cse42 (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse44 (mod .cse42 256))) (let ((.cse49 (+ (- 256) .cse44))) (let ((.cse43 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse49))) (let ((.cse47 (mod .cse49 .cse43))) (let ((.cse48 (+ (- 256) (mod (+ (* .cse43 255) .cse47) 256)))) (let ((.cse45 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse48))) (let ((.cse46 (mod .cse48 .cse45))) (and (<= 128 (mod (+ (* 255 .cse42) .cse43) 256)) (<= 128 .cse44) (not (= .cse43 0)) (= .cse3 (mod (+ (* .cse45 255) .cse46) 256)) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_23|) (not (= .cse47 0)) (= (mod .cse45 |c_ULTIMATE.start_main1_~g~0#1|) 0) (<= |c_ULTIMATE.start_main1_~y~0#1| |v_ULTIMATE.start_gcd_test_~a#1_24|) (not (= .cse45 0)) (not (= .cse46 0)) (<= .cse43 |v_ULTIMATE.start_gcd_test_~a#1_26|)))))))))))) (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 ((.cse52 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse51 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| .cse52))) (let ((.cse53 (mod .cse52 .cse51))) (let ((.cse50 (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse53))) (and (not (= .cse50 0)) (<= .cse51 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= (+ .cse51 .cse52) 127) (= (mod .cse53 .cse50) |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 (= .cse51 0)) (= (mod .cse50 |c_ULTIMATE.start_main1_~g~0#1|) 0))))))) .cse14))) (<= 0 |c_ULTIMATE.start_main1_~y~0#1|) (<= |c_ULTIMATE.start_main1_~g~0#1| 127)) is different from false [2024-11-13 13:42:36,696 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2024-11-13 13:42:36,696 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:43:47,736 WARN L286 SmtUtils]: Spent 47.03s on a formula simplification. DAG size of input: 79 DAG size of output: 53 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 13:44:35,063 WARN L286 SmtUtils]: Spent 5.05s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:46:16,684 WARN L286 SmtUtils]: Spent 1.43m on a formula simplification. DAG size of input: 95 DAG size of output: 78 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 13:48:16,839 WARN L286 SmtUtils]: Spent 16.04s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:48:35,292 WARN L286 SmtUtils]: Spent 8.42s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:48:48,586 WARN L286 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:49:00,940 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)