./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_3+newton_2_5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 527bcce2 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8bb9cc6-c294-45ea-9a27-43725907e2d4/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8bb9cc6-c294-45ea-9a27-43725907e2d4/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8bb9cc6-c294-45ea-9a27-43725907e2d4/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8bb9cc6-c294-45ea-9a27-43725907e2d4/bin/uautomizer-verify-bycVGegfSx/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_3+newton_2_5.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8bb9cc6-c294-45ea-9a27-43725907e2d4/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8bb9cc6-c294-45ea-9a27-43725907e2d4/bin/uautomizer-verify-bycVGegfSx --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 b041289a049a7233b2a378ca6fc5bbde9d5c291c849eb6ce585cee09751124ba --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 22:12:52,940 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:12:53,054 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8bb9cc6-c294-45ea-9a27-43725907e2d4/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-21 22:12:53,061 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:12:53,062 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:12:53,102 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:12:53,104 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:12:53,104 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:12:53,105 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-21 22:12:53,110 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-21 22:12:53,111 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 22:12:53,111 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 22:12:53,112 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:12:53,114 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:12:53,114 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:12:53,115 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:12:53,115 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 22:12:53,116 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:12:53,116 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:12:53,117 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:12:53,117 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:12:53,118 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 22:12:53,118 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 22:12:53,119 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 22:12:53,119 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:12:53,120 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 22:12:53,120 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:12:53,121 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:12:53,122 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:12:53,122 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 22:12:53,123 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 22:12:53,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:12:53,124 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:12:53,124 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 22:12:53,124 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 22:12:53,124 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 22:12:53,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 22:12:53,125 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 22:12:53,125 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 22:12:53,125 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 22:12:53,126 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 22:12:53,126 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 22:12:53,126 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8bb9cc6-c294-45ea-9a27-43725907e2d4/bin/uautomizer-verify-bycVGegfSx/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_f8bb9cc6-c294-45ea-9a27-43725907e2d4/bin/uautomizer-verify-bycVGegfSx 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 -> b041289a049a7233b2a378ca6fc5bbde9d5c291c849eb6ce585cee09751124ba [2023-11-21 22:12:53,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:12:53,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:12:53,431 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:12:53,432 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:12:53,433 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:12:53,434 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8bb9cc6-c294-45ea-9a27-43725907e2d4/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/combinations/gcd_3+newton_2_5.i [2023-11-21 22:12:56,583 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:12:56,850 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:12:56,854 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8bb9cc6-c294-45ea-9a27-43725907e2d4/sv-benchmarks/c/combinations/gcd_3+newton_2_5.i [2023-11-21 22:12:56,869 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8bb9cc6-c294-45ea-9a27-43725907e2d4/bin/uautomizer-verify-bycVGegfSx/data/f1dccb3e4/9db7bb002eb34db1ad7fe56fe1e509cb/FLAG53cd00424 [2023-11-21 22:12:56,888 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8bb9cc6-c294-45ea-9a27-43725907e2d4/bin/uautomizer-verify-bycVGegfSx/data/f1dccb3e4/9db7bb002eb34db1ad7fe56fe1e509cb [2023-11-21 22:12:56,895 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:12:56,897 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:12:56,898 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:12:56,899 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:12:56,906 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:12:56,907 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:12:56" (1/1) ... [2023-11-21 22:12:56,908 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f501c3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:56, skipping insertion in model container [2023-11-21 22:12:56,908 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:12:56" (1/1) ... [2023-11-21 22:12:56,942 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:12:57,180 WARN L240 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_f8bb9cc6-c294-45ea-9a27-43725907e2d4/sv-benchmarks/c/combinations/gcd_3+newton_2_5.i[1226,1239] [2023-11-21 22:12:57,233 WARN L240 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_f8bb9cc6-c294-45ea-9a27-43725907e2d4/sv-benchmarks/c/combinations/gcd_3+newton_2_5.i[2841,2854] [2023-11-21 22:12:57,238 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:12:57,259 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:12:57,283 WARN L240 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_f8bb9cc6-c294-45ea-9a27-43725907e2d4/sv-benchmarks/c/combinations/gcd_3+newton_2_5.i[1226,1239] [2023-11-21 22:12:57,314 WARN L240 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_f8bb9cc6-c294-45ea-9a27-43725907e2d4/sv-benchmarks/c/combinations/gcd_3+newton_2_5.i[2841,2854] [2023-11-21 22:12:57,318 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:12:57,337 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:12:57,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:57 WrapperNode [2023-11-21 22:12:57,338 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:12:57,341 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:12:57,341 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:12:57,342 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:12:57,351 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:57" (1/1) ... [2023-11-21 22:12:57,372 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:57" (1/1) ... [2023-11-21 22:12:57,411 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 88 [2023-11-21 22:12:57,412 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:12:57,412 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:12:57,413 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:12:57,413 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:12:57,426 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:57" (1/1) ... [2023-11-21 22:12:57,426 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:57" (1/1) ... [2023-11-21 22:12:57,430 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:57" (1/1) ... [2023-11-21 22:12:57,453 INFO L187 HeapSplitter]: Split 10 memory accesses to 2 slices as follows [2, 8] [2023-11-21 22:12:57,455 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:57" (1/1) ... [2023-11-21 22:12:57,456 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:57" (1/1) ... [2023-11-21 22:12:57,467 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:57" (1/1) ... [2023-11-21 22:12:57,474 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:57" (1/1) ... [2023-11-21 22:12:57,476 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:57" (1/1) ... [2023-11-21 22:12:57,482 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:57" (1/1) ... [2023-11-21 22:12:57,485 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:12:57,489 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:12:57,490 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:12:57,490 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:12:57,491 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:57" (1/1) ... [2023-11-21 22:12:57,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:12:57,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8bb9cc6-c294-45ea-9a27-43725907e2d4/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:12:57,529 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8bb9cc6-c294-45ea-9a27-43725907e2d4/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 22:12:57,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8bb9cc6-c294-45ea-9a27-43725907e2d4/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 22:12:57,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 22:12:57,578 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2023-11-21 22:12:57,579 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2023-11-21 22:12:57,579 INFO L130 BoogieDeclarations]: Found specification of procedure f [2023-11-21 22:12:57,580 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2023-11-21 22:12:57,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-21 22:12:57,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-21 22:12:57,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:12:57,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:12:57,710 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:12:57,722 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:12:57,954 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:12:58,051 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:12:58,052 INFO L308 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-21 22:12:58,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:12:58 BoogieIcfgContainer [2023-11-21 22:12:58,054 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:12:58,056 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 22:12:58,057 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 22:12:58,060 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 22:12:58,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:12:56" (1/3) ... [2023-11-21 22:12:58,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40555d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:12:58, skipping insertion in model container [2023-11-21 22:12:58,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:12:57" (2/3) ... [2023-11-21 22:12:58,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40555d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:12:58, skipping insertion in model container [2023-11-21 22:12:58,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:12:58" (3/3) ... [2023-11-21 22:12:58,064 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_3+newton_2_5.i [2023-11-21 22:12:58,085 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 22:12:58,085 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-21 22:12:58,138 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 22:12:58,150 INFO L357 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, mHoare=true, 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;@7257a9b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:12:58,151 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-21 22:12:58,156 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 16 states have (on average 1.4375) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-21 22:12:58,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-21 22:12:58,164 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:12:58,165 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-21 22:12:58,166 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:12:58,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:12:58,173 INFO L85 PathProgramCache]: Analyzing trace with hash -584909265, now seen corresponding path program 1 times [2023-11-21 22:12:58,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:12:58,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367910814] [2023-11-21 22:12:58,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:12:58,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:12:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:12:58,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:12:58,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:12:58,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367910814] [2023-11-21 22:12:58,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367910814] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:12:58,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:12:58,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:12:58,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258734342] [2023-11-21 22:12:58,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:12:58,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:12:58,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:12:58,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:12:58,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:12:58,884 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.4375) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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) [2023-11-21 22:12:59,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:12:59,032 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2023-11-21 22:12:59,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:12:59,035 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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 6 [2023-11-21 22:12:59,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:12:59,041 INFO L225 Difference]: With dead ends: 37 [2023-11-21 22:12:59,042 INFO L226 Difference]: Without dead ends: 21 [2023-11-21 22:12:59,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:12:59,049 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:12:59,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 63 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:12:59,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-11-21 22:12:59,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-11-21 22:12:59,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-21 22:12:59,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2023-11-21 22:12:59,167 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 6 [2023-11-21 22:12:59,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:12:59,167 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2023-11-21 22:12:59,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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) [2023-11-21 22:12:59,168 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2023-11-21 22:12:59,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-21 22:12:59,169 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:12:59,170 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:12:59,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 22:12:59,170 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:12:59,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:12:59,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1018725074, now seen corresponding path program 1 times [2023-11-21 22:12:59,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:12:59,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248526512] [2023-11-21 22:12:59,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:12:59,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:12:59,212 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-21 22:12:59,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [100549232] [2023-11-21 22:12:59,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:12:59,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:12:59,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8bb9cc6-c294-45ea-9a27-43725907e2d4/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:12:59,216 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8bb9cc6-c294-45ea-9a27-43725907e2d4/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:12:59,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8bb9cc6-c294-45ea-9a27-43725907e2d4/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-21 22:12:59,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:12:59,304 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-21 22:12:59,312 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:13:00,877 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse8 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse0 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse1 (<= (+ |c_ULTIMATE.start_main1_~x~0#1| 1) 0)) (.cse6 (<= 128 .cse8)) (.cse3 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse4 (+ .cse8 (- 256))) (.cse5 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse7 (<= .cse8 127))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (= (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= |v_ULTIMATE.start_gcd_test_~b#1_22| 127) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_22| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_22|))) .cse0) (and .cse1 (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (let ((.cse2 (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_22|))) (and (not (= .cse2 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_22|)) (= (mod (+ .cse2 |v_ULTIMATE.start_gcd_test_~b#1_22|) 256) .cse3) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_22| 1) 0)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_22| 1) 0) (= (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_22|) 0))) .cse5)) .cse6) (and .cse7 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse8 |v_ULTIMATE.start_gcd_test_~b#1_22|) 256)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_22|)) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_22| 1) 0)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (= (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_22|)) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_22| 1) 0))) .cse0) (and .cse1 (or (and .cse6 (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (let ((.cse9 (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_22|))) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_22| 127) (not (= .cse9 0)) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (= (mod (+ .cse9 (* 255 |v_ULTIMATE.start_gcd_test_~b#1_22|)) 256) .cse3) (not (= |v_ULTIMATE.start_gcd_test_~b#1_22| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_22|)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_22| 127) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (= (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_22|) 0) (not (= |v_ULTIMATE.start_gcd_test_~b#1_22| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_22|))) .cse5))) (and .cse7 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse8 |v_ULTIMATE.start_gcd_test_~b#1_22|) 256)) (<= |v_ULTIMATE.start_gcd_test_~b#1_22| 127) (<= |c_ULTIMATE.start_gcd_test_~a#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_22| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_22|))))))))) is different from true [2023-11-21 22:13:03,597 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse3 (<= .cse4 127)) (.cse2 (+ .cse4 (- 256))) (.cse1 (<= 128 .cse4)) (.cse0 (<= (+ |c_ULTIMATE.start_main1_~x~0#1| 1) 0)) (.cse5 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|))) (or (and .cse0 (or (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_22| 127) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (= (mod .cse2 |v_ULTIMATE.start_gcd_test_~b#1_22|) 0) (not (= |v_ULTIMATE.start_gcd_test_~b#1_22| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_22|)))) (and .cse3 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (<= |v_ULTIMATE.start_gcd_test_~b#1_22| 127) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (= (mod (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_22|) 256) 0) (not (= |v_ULTIMATE.start_gcd_test_~b#1_22| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_22|)))))) (and (or (and .cse3 (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_22|)) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_22| 1) 0) (= (mod (mod .cse4 |v_ULTIMATE.start_gcd_test_~b#1_22|) 256) 0)))) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_22| 1) 0) (= (mod .cse2 |v_ULTIMATE.start_gcd_test_~b#1_22|) 0))) .cse1)) .cse0) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (= (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) 256) 0) (<= |v_ULTIMATE.start_gcd_test_~b#1_22| 127) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (not (= |v_ULTIMATE.start_gcd_test_~b#1_22| 0)) (<= 0 |v_ULTIMATE.start_gcd_test_~b#1_22|))) .cse5) (and (exists ((|v_ULTIMATE.start_gcd_test_~b#1_22| Int)) (and (= (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) 256) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~b#1_22|)) (<= |c_ULTIMATE.start_main1_~g~0#1| |v_ULTIMATE.start_gcd_test_~b#1_22|) (<= (+ |v_ULTIMATE.start_gcd_test_~b#1_22| 1) 0))) .cse5)))) is different from true [2023-11-21 22:13:03,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-21 22:13:03,841 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:13:05,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:13:05,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:13:05,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248526512] [2023-11-21 22:13:05,504 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-21 22:13:05,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100549232] [2023-11-21 22:13:05,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100549232] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:13:05,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-21 22:13:05,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-11-21 22:13:05,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247952140] [2023-11-21 22:13:05,506 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-21 22:13:05,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-21 22:13:05,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:13:05,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-21 22:13:05,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=42, Unknown=2, NotChecked=26, Total=90 [2023-11-21 22:13:05,509 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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) [2023-11-21 22:13:16,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:13:16,077 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2023-11-21 22:13:16,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 22:13:16,078 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 7 [2023-11-21 22:13:16,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:13:16,079 INFO L225 Difference]: With dead ends: 29 [2023-11-21 22:13:16,080 INFO L226 Difference]: Without dead ends: 24 [2023-11-21 22:13:16,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=38, Invalid=96, Unknown=6, NotChecked=42, Total=182 [2023-11-21 22:13:16,082 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 2 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-21 22:13:16,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 69 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 60 Unchecked, 0.5s Time] [2023-11-21 22:13:16,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-21 22:13:16,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-11-21 22:13:16,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-21 22:13:16,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2023-11-21 22:13:16,094 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 7 [2023-11-21 22:13:16,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:13:16,094 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2023-11-21 22:13:16,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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) [2023-11-21 22:13:16,095 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2023-11-21 22:13:16,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-21 22:13:16,096 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:13:16,096 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2023-11-21 22:13:16,123 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8bb9cc6-c294-45ea-9a27-43725907e2d4/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-21 22:13:16,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8bb9cc6-c294-45ea-9a27-43725907e2d4/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:13:16,311 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-21 22:13:16,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:13:16,312 INFO L85 PathProgramCache]: Analyzing trace with hash -2117450257, now seen corresponding path program 2 times [2023-11-21 22:13:16,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:13:16,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62066333] [2023-11-21 22:13:16,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:13:16,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:13:16,324 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-21 22:13:16,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [719288682] [2023-11-21 22:13:16,329 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 22:13:16,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:13:16,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8bb9cc6-c294-45ea-9a27-43725907e2d4/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:13:16,334 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8bb9cc6-c294-45ea-9a27-43725907e2d4/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:13:16,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f8bb9cc6-c294-45ea-9a27-43725907e2d4/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-21 22:13:16,492 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 22:13:16,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:13:16,494 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-21 22:13:16,496 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:13:25,885 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse14 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse9 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse12 (<= (+ |c_ULTIMATE.start_main1_~x~0#1| 1) 0)) (.cse18 (<= 128 .cse14)) (.cse4 (<= (+ |c_ULTIMATE.start_gcd_test_~a#1| 1) 0)) (.cse3 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse16 (+ .cse14 (- 256))) (.cse13 (<= .cse14 127)) (.cse5 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse6 (* |c_ULTIMATE.start_gcd_test_~a#1| 255)) (.cse2 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256))) (or (and (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (let ((.cse1 (mod |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse0 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_29|) 256))) (and (<= 128 .cse0) (= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse1) 256) .cse2) (not (= .cse1 0)) (= .cse3 .cse0) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_29| 1) 0)))) .cse4) (and .cse5 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (let ((.cse7 (mod |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse8 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_29|) 256))) (and (= (mod (+ .cse6 .cse7) 256) .cse2) (not (= .cse7 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_29| 1) 0) (<= .cse8 127) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse8)))))) .cse9) (and (or (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (let ((.cse10 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_29|) 256))) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= |v_ULTIMATE.start_gcd_test_~a#1_29| 0)) (<= .cse10 127) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse10)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (let ((.cse11 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_29|) 256))) (and (= (mod |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= |v_ULTIMATE.start_gcd_test_~a#1_29| 0)) (<= 128 .cse11) (= .cse3 .cse11))))) .cse9) (and .cse12 (or (and .cse13 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse14 |v_ULTIMATE.start_gcd_test_~a#1_29|) 256)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= |v_ULTIMATE.start_gcd_test_~a#1_29| 0))))) (and (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (let ((.cse15 (mod .cse16 |v_ULTIMATE.start_gcd_test_~a#1_29|))) (and (= .cse3 (mod (+ |v_ULTIMATE.start_gcd_test_~a#1_29| .cse15) 256)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_29| 1) 0) (not (= 0 .cse15))))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (let ((.cse17 (mod .cse16 |v_ULTIMATE.start_gcd_test_~a#1_29|))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_29|) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= |v_ULTIMATE.start_gcd_test_~a#1_29| 0)) (= .cse3 (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~a#1_29|) .cse17) 256)) (not (= 0 .cse17)))))) .cse18)))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (and (or (and .cse4 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (let ((.cse19 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_29|) 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_29|) (not (= |v_ULTIMATE.start_gcd_test_~a#1_29| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (<= 128 .cse19) (= .cse3 .cse19))))) (and .cse5 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (let ((.cse20 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_29|) 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_29|) (not (= |v_ULTIMATE.start_gcd_test_~a#1_29| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (<= .cse20 127) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse20)))))) .cse9) (and .cse12 (or (and .cse18 .cse4 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (let ((.cse21 (mod .cse16 |v_ULTIMATE.start_gcd_test_~a#1_29|))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_29|) (not (= |v_ULTIMATE.start_gcd_test_~a#1_29| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (= .cse3 (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~a#1_29|) .cse21) 256)) (not (= 0 .cse21)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_29|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse14 |v_ULTIMATE.start_gcd_test_~a#1_29|) 256)) (not (= |v_ULTIMATE.start_gcd_test_~a#1_29| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~a#1|) 256)))) .cse13 .cse5))) (and .cse12 (or (and .cse18 .cse4 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (let ((.cse22 (mod |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse3 (mod (+ |v_ULTIMATE.start_gcd_test_~a#1_29| (mod .cse16 |v_ULTIMATE.start_gcd_test_~a#1_29|)) 256)) (= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse22) 256) .cse2) (not (= .cse22 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_29| 1) 0))))) (and .cse13 .cse5 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (let ((.cse23 (mod |v_ULTIMATE.start_gcd_test_~a#1_29| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= (mod (+ .cse6 .cse23) 256) .cse2) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse14 |v_ULTIMATE.start_gcd_test_~a#1_29|) 256)) (not (= .cse23 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_29| 1) 0)))))))))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2023-11-21 22:13:48,462 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse10 (* |c_ULTIMATE.start_gcd_test_~a#1| 255))) (let ((.cse58 (mod .cse10 256)) (.cse22 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse0 (<= (+ |c_ULTIMATE.start_main1_~x~0#1| 1) 0)) (.cse23 (<= .cse22 127)) (.cse18 (<= 128 .cse22)) (.cse24 (<= 128 .cse58)) (.cse6 (+ .cse22 (- 256))) (.cse30 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse12 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse13 (<= (+ |c_ULTIMATE.start_gcd_test_~a#1| 1) 0)) (.cse1 (<= .cse58 127)) (.cse2 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse7 (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse35 (<= 0 |c_ULTIMATE.start_main1_~x~0#1|))) (or (and .cse0 (or (and (or (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (let ((.cse4 (mod .cse6 |v_ULTIMATE.start_gcd_test_~a#1_29|))) (let ((.cse5 (+ (mod (+ |v_ULTIMATE.start_gcd_test_~a#1_29| .cse4) 256) (- 256)))) (let ((.cse3 (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse5))) (and (= .cse2 (mod (+ .cse3 |v_ULTIMATE.start_gcd_test_~a#1_29| .cse4) 256)) (= (mod .cse5 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= .cse3 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_29| 1) 0)))))) .cse7) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (let ((.cse9 (mod .cse6 |v_ULTIMATE.start_gcd_test_~a#1_29|))) (let ((.cse8 (+ (mod (+ |v_ULTIMATE.start_gcd_test_~a#1_29| .cse9) 256) (- 256)))) (let ((.cse11 (mod .cse8 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse2 (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse8) |v_ULTIMATE.start_gcd_test_~a#1_29| .cse9) 256)) (<= (mod (+ .cse10 .cse11) 256) 127) (not (= .cse11 0)) (= .cse12 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse11) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_29| 1) 0)))))) .cse13) (and .cse13 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (let ((.cse15 (mod .cse6 |v_ULTIMATE.start_gcd_test_~a#1_29|))) (let ((.cse17 (+ (mod (+ |v_ULTIMATE.start_gcd_test_~a#1_29| .cse15) 256) (- 256)))) (let ((.cse16 (mod .cse17 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse14 (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse17))) (and (= .cse2 (mod (+ .cse14 |v_ULTIMATE.start_gcd_test_~a#1_29| .cse15) 256)) (<= 128 (mod (+ .cse10 .cse16) 256)) (= .cse12 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse16) 256)) (not (= .cse14 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_29| 1) 0)))))))) .cse18) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (let ((.cse20 (mod .cse22 |v_ULTIMATE.start_gcd_test_~a#1_29|))) (let ((.cse19 (mod .cse20 256))) (let ((.cse21 (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse19))) (and (not (= .cse19 0)) (= .cse2 (mod (+ (* .cse20 255) .cse21) 256)) (not (= .cse21 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse19 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_29| 1) 0)))))) .cse23 .cse13))) (and (or (and .cse7 .cse24 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (let ((.cse26 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_29|) 256))) (let ((.cse25 (+ (- 256) .cse26))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_29|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse25) 256)) (<= 128 .cse26) (= (mod .cse25 |c_ULTIMATE.start_gcd_test_~a#1|) 0)))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (let ((.cse28 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_29|) 256))) (let ((.cse27 (+ (- 256) .cse28))) (let ((.cse29 (mod .cse27 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_29|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse27) 256)) (<= 128 .cse28) (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse29) 256) 127) (= (mod (+ .cse10 .cse29) 256) .cse12) (not (= .cse29 0))))))) .cse30) (and .cse30 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (let ((.cse32 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_29|) 256))) (let ((.cse31 (+ (- 256) .cse32))) (let ((.cse33 (mod .cse31 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_29|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse31) 256)) (<= 128 .cse32) (<= 128 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse33) 256)) (= (mod (+ .cse10 .cse33) 256) .cse12))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (let ((.cse34 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_29|) 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_29|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse34) 256)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse34 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (<= .cse34 127) (not (= 0 .cse34))))) .cse30)) .cse35) (and .cse0 (or (and .cse23 .cse30 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (let ((.cse36 (mod (mod .cse22 |v_ULTIMATE.start_gcd_test_~a#1_29|) 256))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_29|) (not (= .cse36 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse36 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse36) 256) |c_ULTIMATE.start_gcd_test_~a#1|))))) (and .cse18 (or (and .cse30 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (let ((.cse37 (+ (- 256) (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~a#1_29|) (mod .cse6 |v_ULTIMATE.start_gcd_test_~a#1_29|)) 256)))) (let ((.cse38 (mod .cse37 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_29|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse37) 256)) (= (mod (+ .cse10 .cse38) 256) .cse12) (<= 128 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse38) 256))))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (let ((.cse39 (+ (- 256) (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~a#1_29|) (mod .cse6 |v_ULTIMATE.start_gcd_test_~a#1_29|)) 256)))) (and (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_29|) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse39) 256)) (= (mod .cse39 |c_ULTIMATE.start_gcd_test_~a#1|) 0)))) .cse7 .cse24) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (let ((.cse41 (+ (- 256) (mod (+ (* 255 |v_ULTIMATE.start_gcd_test_~a#1_29|) (mod .cse6 |v_ULTIMATE.start_gcd_test_~a#1_29|)) 256)))) (let ((.cse40 (mod .cse41 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse40) 256) 127) (<= 0 |v_ULTIMATE.start_gcd_test_~a#1_29|) (not (= .cse40 0)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse41) 256)) (= (mod (+ .cse10 .cse40) 256) .cse12))))) .cse30))))) (and (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (let ((.cse45 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_29|))) (let ((.cse42 (mod .cse45 256))) (let ((.cse44 (+ (- 256) .cse42))) (let ((.cse43 (mod .cse44 |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= 128 .cse42) (<= (mod (+ .cse10 .cse43) 256) 127) (not (= .cse43 0)) (= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse43) 256) .cse12) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_29| 1) 0) (= .cse2 (mod (+ (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse44) .cse45) 256)))))))) .cse13) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (let ((.cse49 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_29|))) (let ((.cse46 (mod .cse49 256))) (let ((.cse50 (+ (- 256) .cse46))) (let ((.cse47 (mod .cse50 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse48 (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse50))) (and (<= 128 .cse46) (<= 128 (mod (+ .cse10 .cse47) 256)) (not (= .cse48 0)) (= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse47) 256) .cse12) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_29| 1) 0) (= .cse2 (mod (+ .cse48 .cse49) 256)))))))) .cse13) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (let ((.cse53 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_29|))) (let ((.cse52 (mod .cse53 256))) (let ((.cse51 (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse52))) (and (not (= .cse51 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse52 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (= (mod (+ (* .cse53 255) .cse51) 256) .cse2) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_29| 1) 0) (<= .cse52 127) (not (= 0 .cse52))))))) .cse13) (and .cse1 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_29| Int)) (let ((.cse57 (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_29|))) (let ((.cse54 (mod .cse57 256))) (let ((.cse55 (+ (- 256) .cse54))) (let ((.cse56 (mod |v_ULTIMATE.start_gcd_test_~a#1_29| .cse55))) (and (<= 128 .cse54) (= (mod .cse55 |c_ULTIMATE.start_gcd_test_~a#1|) 0) (not (= .cse56 0)) (<= (+ |v_ULTIMATE.start_gcd_test_~a#1_29| 1) 0) (= .cse2 (mod (+ .cse56 .cse57) 256)))))))) .cse7)) .cse35))))) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false