./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_2+newton_2_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f 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_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_2_2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --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 edf451b08ccf28b9358a6fa7c10128ea1b9a8f09b01361f9cd588dc4a31f271a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 10:53:52,717 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 10:53:52,719 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 10:53:52,744 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 10:53:52,745 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 10:53:52,746 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 10:53:52,747 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 10:53:52,749 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 10:53:52,750 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 10:53:52,751 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 10:53:52,752 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 10:53:52,754 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 10:53:52,754 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 10:53:52,755 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 10:53:52,756 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 10:53:52,757 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 10:53:52,758 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 10:53:52,759 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 10:53:52,763 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 10:53:52,765 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 10:53:52,766 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 10:53:52,769 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 10:53:52,771 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 10:53:52,771 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 10:53:52,775 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 10:53:52,775 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 10:53:52,775 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 10:53:52,776 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 10:53:52,777 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 10:53:52,778 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 10:53:52,778 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 10:53:52,779 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 10:53:52,779 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 10:53:52,780 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 10:53:52,781 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 10:53:52,781 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 10:53:52,782 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 10:53:52,782 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 10:53:52,788 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 10:53:52,789 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 10:53:52,790 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 10:53:52,791 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 10:53:52,837 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 10:53:52,837 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 10:53:52,837 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 10:53:52,838 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 10:53:52,838 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 10:53:52,838 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 10:53:52,839 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 10:53:52,839 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 10:53:52,839 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 10:53:52,840 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 10:53:52,840 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 10:53:52,840 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 10:53:52,840 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 10:53:52,840 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 10:53:52,841 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 10:53:52,841 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 10:53:52,841 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 10:53:52,841 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 10:53:52,841 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 10:53:52,842 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 10:53:52,842 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 10:53:52,842 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 10:53:52,842 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 10:53:52,842 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 10:53:52,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 10:53:52,843 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 10:53:52,843 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 10:53:52,843 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 10:53:52,843 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 10:53:52,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 10:53:52,844 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 10:53:52,844 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 10:53:52,844 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 10:53:52,844 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/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_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> edf451b08ccf28b9358a6fa7c10128ea1b9a8f09b01361f9cd588dc4a31f271a [2022-11-16 10:53:53,082 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 10:53:53,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 10:53:53,121 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 10:53:53,122 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 10:53:53,124 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 10:53:53,125 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/combinations/gcd_2+newton_2_2.i [2022-11-16 10:53:53,196 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/data/02e656f7b/a0b45727fb534e799c2a032f8b4e74a2/FLAGcd72c218a [2022-11-16 10:53:53,640 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 10:53:53,641 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/sv-benchmarks/c/combinations/gcd_2+newton_2_2.i [2022-11-16 10:53:53,647 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/data/02e656f7b/a0b45727fb534e799c2a032f8b4e74a2/FLAGcd72c218a [2022-11-16 10:53:54,034 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/data/02e656f7b/a0b45727fb534e799c2a032f8b4e74a2 [2022-11-16 10:53:54,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 10:53:54,040 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 10:53:54,045 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 10:53:54,045 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 10:53:54,049 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 10:53:54,050 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:53:54" (1/1) ... [2022-11-16 10:53:54,051 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@206b85c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:54, skipping insertion in model container [2022-11-16 10:53:54,051 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:53:54" (1/1) ... [2022-11-16 10:53:54,058 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 10:53:54,074 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 10:53:54,282 WARN L229 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_202dc9d0-b474-41b1-bd46-6f1c2532eb01/sv-benchmarks/c/combinations/gcd_2+newton_2_2.i[1226,1239] [2022-11-16 10:53:54,303 WARN L229 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_202dc9d0-b474-41b1-bd46-6f1c2532eb01/sv-benchmarks/c/combinations/gcd_2+newton_2_2.i[2841,2854] [2022-11-16 10:53:54,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 10:53:54,313 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 10:53:54,326 WARN L229 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_202dc9d0-b474-41b1-bd46-6f1c2532eb01/sv-benchmarks/c/combinations/gcd_2+newton_2_2.i[1226,1239] [2022-11-16 10:53:54,335 WARN L229 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_202dc9d0-b474-41b1-bd46-6f1c2532eb01/sv-benchmarks/c/combinations/gcd_2+newton_2_2.i[2841,2854] [2022-11-16 10:53:54,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 10:53:54,350 INFO L208 MainTranslator]: Completed translation [2022-11-16 10:53:54,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:54 WrapperNode [2022-11-16 10:53:54,351 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 10:53:54,352 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 10:53:54,352 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 10:53:54,352 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 10:53:54,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:54" (1/1) ... [2022-11-16 10:53:54,370 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:54" (1/1) ... [2022-11-16 10:53:54,405 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 85 [2022-11-16 10:53:54,409 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 10:53:54,410 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 10:53:54,410 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 10:53:54,410 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 10:53:54,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:54" (1/1) ... [2022-11-16 10:53:54,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:54" (1/1) ... [2022-11-16 10:53:54,426 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:54" (1/1) ... [2022-11-16 10:53:54,427 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:54" (1/1) ... [2022-11-16 10:53:54,445 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:54" (1/1) ... [2022-11-16 10:53:54,448 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:54" (1/1) ... [2022-11-16 10:53:54,449 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:54" (1/1) ... [2022-11-16 10:53:54,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:54" (1/1) ... [2022-11-16 10:53:54,452 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 10:53:54,453 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 10:53:54,453 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 10:53:54,453 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 10:53:54,465 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:54" (1/1) ... [2022-11-16 10:53:54,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 10:53:54,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:53:54,502 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 10:53:54,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 10:53:54,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 10:53:54,551 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-11-16 10:53:54,551 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-11-16 10:53:54,551 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-11-16 10:53:54,553 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-11-16 10:53:54,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 10:53:54,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 10:53:54,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 10:53:54,639 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 10:53:54,641 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 10:53:54,836 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 10:53:54,846 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 10:53:54,851 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-16 10:53:54,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:53:54 BoogieIcfgContainer [2022-11-16 10:53:54,853 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 10:53:54,855 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 10:53:54,855 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 10:53:54,860 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 10:53:54,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 10:53:54" (1/3) ... [2022-11-16 10:53:54,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15147043 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:53:54, skipping insertion in model container [2022-11-16 10:53:54,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:54" (2/3) ... [2022-11-16 10:53:54,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15147043 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:53:54, skipping insertion in model container [2022-11-16 10:53:54,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 10:53:54" (3/3) ... [2022-11-16 10:53:54,864 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_2_2.i [2022-11-16 10:53:54,890 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 10:53:54,890 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-16 10:53:54,949 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 10:53:54,964 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=LoopsAndPotentialCycles, 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;@7a426d69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 10:53:54,964 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-16 10:53:54,969 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 30 states have internal predecessors, (39), 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) [2022-11-16 10:53:54,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 10:53:54,978 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:53:54,978 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:53:54,979 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 10:53:54,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:53:54,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1709385323, now seen corresponding path program 1 times [2022-11-16 10:53:55,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:53:55,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761228411] [2022-11-16 10:53:55,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:53:55,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:53:55,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:53:55,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:53:55,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:53:55,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761228411] [2022-11-16 10:53:55,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761228411] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:53:55,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:53:55,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 10:53:55,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683965802] [2022-11-16 10:53:55,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:53:55,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 10:53:55,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:53:55,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 10:53:55,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 10:53:55,476 INFO L87 Difference]: Start difference. First operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 30 states have internal predecessors, (39), 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 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) [2022-11-16 10:53:55,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:53:55,597 INFO L93 Difference]: Finished difference Result 90 states and 111 transitions. [2022-11-16 10:53:55,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 10:53:55,599 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 [2022-11-16 10:53:55,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:53:55,606 INFO L225 Difference]: With dead ends: 90 [2022-11-16 10:53:55,606 INFO L226 Difference]: Without dead ends: 36 [2022-11-16 10:53:55,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 10:53:55,614 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 30 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 10:53:55,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 107 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 10:53:55,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-16 10:53:55,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2022-11-16 10:53:55,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 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) [2022-11-16 10:53:55,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-11-16 10:53:55,654 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 11 [2022-11-16 10:53:55,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:53:55,655 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-11-16 10:53:55,655 INFO L496 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) [2022-11-16 10:53:55,655 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-11-16 10:53:55,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 10:53:55,657 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:53:55,657 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:53:55,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 10:53:55,658 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 10:53:55,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:53:55,659 INFO L85 PathProgramCache]: Analyzing trace with hash 65622039, now seen corresponding path program 1 times [2022-11-16 10:53:55,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:53:55,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721952647] [2022-11-16 10:53:55,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:53:55,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:53:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:53:55,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:53:55,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:53:55,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721952647] [2022-11-16 10:53:55,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721952647] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 10:53:55,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 10:53:55,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 10:53:55,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316663882] [2022-11-16 10:53:55,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 10:53:55,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 10:53:55,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:53:55,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 10:53:55,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 10:53:55,790 INFO L87 Difference]: Start difference. First operand 29 states and 32 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) [2022-11-16 10:53:55,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:53:55,818 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-11-16 10:53:55,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 10:53:55,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 [2022-11-16 10:53:55,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:53:55,820 INFO L225 Difference]: With dead ends: 36 [2022-11-16 10:53:55,820 INFO L226 Difference]: Without dead ends: 30 [2022-11-16 10:53:55,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 10:53:55,822 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 4 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 10:53:55,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 82 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 10:53:55,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-16 10:53:55,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-16 10:53:55,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 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) [2022-11-16 10:53:55,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-11-16 10:53:55,835 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2022-11-16 10:53:55,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:53:55,838 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-11-16 10:53:55,839 INFO L496 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) [2022-11-16 10:53:55,840 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-11-16 10:53:55,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 10:53:55,842 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:53:55,842 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:53:55,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 10:53:55,844 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 10:53:55,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:53:55,845 INFO L85 PathProgramCache]: Analyzing trace with hash -659390950, now seen corresponding path program 1 times [2022-11-16 10:53:55,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:53:55,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842984034] [2022-11-16 10:53:55,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:53:55,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:53:55,864 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 10:53:55,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [150177213] [2022-11-16 10:53:55,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:53:55,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:53:55,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:53:55,869 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:53:55,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 10:53:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 10:53:55,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-16 10:53:55,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:53:56,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:53:56,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:53:56,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:53:56,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:53:56,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842984034] [2022-11-16 10:53:56,118 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 10:53:56,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150177213] [2022-11-16 10:53:56,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150177213] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 10:53:56,119 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 10:53:56,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2022-11-16 10:53:56,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613441870] [2022-11-16 10:53:56,120 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 10:53:56,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 10:53:56,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:53:56,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 10:53:56,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-16 10:53:56,121 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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) [2022-11-16 10:53:56,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:53:56,213 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2022-11-16 10:53:56,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 10:53:56,214 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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 [2022-11-16 10:53:56,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:53:56,214 INFO L225 Difference]: With dead ends: 37 [2022-11-16 10:53:56,215 INFO L226 Difference]: Without dead ends: 31 [2022-11-16 10:53:56,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-16 10:53:56,216 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 10:53:56,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 179 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 10:53:56,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-16 10:53:56,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-11-16 10:53:56,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 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) [2022-11-16 10:53:56,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-11-16 10:53:56,222 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 12 [2022-11-16 10:53:56,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:53:56,223 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-11-16 10:53:56,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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) [2022-11-16 10:53:56,223 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-11-16 10:53:56,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 10:53:56,224 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:53:56,224 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:53:56,243 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 10:53:56,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:53:56,430 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 10:53:56,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:53:56,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1659957129, now seen corresponding path program 2 times [2022-11-16 10:53:56,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:53:56,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351372179] [2022-11-16 10:53:56,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:53:56,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:53:56,442 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 10:53:56,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1320847213] [2022-11-16 10:53:56,443 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 10:53:56,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:53:56,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:53:56,445 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:53:56,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 10:53:56,523 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 10:53:56,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 10:53:56,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-16 10:53:56,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:54:16,909 WARN L233 SmtUtils]: Spent 19.40s on a formula simplification. DAG size of input: 72 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 10:54:18,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:54:18,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:56:28,873 WARN L233 SmtUtils]: Spent 1.94m on a formula simplification. DAG size of input: 129 DAG size of output: 35 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 10:56:30,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:56:30,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 10:56:30,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351372179] [2022-11-16 10:56:30,633 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 10:56:30,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320847213] [2022-11-16 10:56:30,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320847213] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 10:56:30,633 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 10:56:30,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-11-16 10:56:30,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751535911] [2022-11-16 10:56:30,634 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 10:56:30,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-16 10:56:30,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 10:56:30,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-16 10:56:30,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=195, Unknown=1, NotChecked=0, Total=240 [2022-11-16 10:56:30,636 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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) [2022-11-16 10:56:35,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 10:56:35,687 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-11-16 10:56:35,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 10:56:35,688 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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 [2022-11-16 10:56:35,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 10:56:35,689 INFO L225 Difference]: With dead ends: 38 [2022-11-16 10:56:35,689 INFO L226 Difference]: Without dead ends: 32 [2022-11-16 10:56:35,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 147.0s TimeCoverageRelationStatistics Valid=51, Invalid=220, Unknown=1, NotChecked=0, Total=272 [2022-11-16 10:56:35,691 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 4 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 10:56:35,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 258 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 23 Unchecked, 0.0s Time] [2022-11-16 10:56:35,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-16 10:56:35,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-11-16 10:56:35,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 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) [2022-11-16 10:56:35,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-11-16 10:56:35,706 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 13 [2022-11-16 10:56:35,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 10:56:35,706 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-11-16 10:56:35,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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) [2022-11-16 10:56:35,707 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-11-16 10:56:35,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 10:56:35,708 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 10:56:35,708 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 10:56:35,719 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 10:56:35,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:56:35,909 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 10:56:35,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 10:56:35,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1682229690, now seen corresponding path program 3 times [2022-11-16 10:56:35,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 10:56:35,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991319239] [2022-11-16 10:56:35,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 10:56:35,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 10:56:35,920 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 10:56:35,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [895148230] [2022-11-16 10:56:35,920 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 10:56:35,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 10:56:35,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 10:56:35,922 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 10:56:35,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 10:56:36,099 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-16 10:56:36,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 10:56:36,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-16 10:56:36,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 10:56:59,028 WARN L233 SmtUtils]: Spent 16.23s on a formula simplification. DAG size of input: 55 DAG size of output: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 10:57:40,437 WARN L233 SmtUtils]: Spent 31.60s on a formula simplification. DAG size of input: 88 DAG size of output: 80 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 10:58:07,628 WARN L233 SmtUtils]: Spent 20.99s on a formula simplification. DAG size of input: 65 DAG size of output: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 10:58:20,974 WARN L233 SmtUtils]: Spent 10.18s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 10:58:46,165 WARN L233 SmtUtils]: Spent 19.66s on a formula simplification. DAG size of input: 61 DAG size of output: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 10:58:48,573 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 10:58:48,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 10:59:56,262 WARN L233 SmtUtils]: Spent 42.96s on a formula simplification. DAG size of input: 88 DAG size of output: 61 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:01:30,510 WARN L855 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (let ((.cse7 (< |c_ULTIMATE.start_gcd_test_~b#1| 0))) (let ((.cse26 (not .cse7)) (.cse2 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (and (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse1 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse0 (mod .cse1 256))) (let ((.cse3 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse0) 256))) (or (= .cse0 0) (<= (mod (+ .cse1 .cse2) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse3) 256) 0)) (not (<= .cse0 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse1 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse0) (<= .cse3 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse6 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse5 (mod (+ .cse6 .cse2) 256))) (let ((.cse4 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse5)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse4 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse5 127) (not (<= (mod .cse6 256) 127)) (<= (mod (+ .cse6 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse4) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse5) (= .cse6 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse7) (or .cse7 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse10 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse9 (mod .cse10 256))) (let ((.cse8 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse9)) 256))) (or (<= .cse8 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse9) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse8) 256) 0)) (<= (mod (+ .cse10 .cse2) 256) 127) (<= .cse9 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse10 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse13 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse12 (mod (+ .cse13 .cse2) 256))) (let ((.cse11 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse12)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse11 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse12 127) (<= (mod .cse13 256) 127) (<= (mod (+ .cse13 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse11) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse12)))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse14 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse16 (mod (+ .cse14 .cse2) 256))) (let ((.cse15 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse16)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse14 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse15 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse16 127) (not (<= (mod .cse14 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse15) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse16) (= .cse14 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse18 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse17 (mod .cse18 256))) (let ((.cse19 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse17) 256))) (or (= .cse17 0) (not (<= (mod (+ .cse18 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse18 .cse2) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse19) 256) 0)) (not (<= .cse17 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse17) (<= .cse19 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse7) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse20 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse21 (mod .cse20 256))) (let ((.cse22 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse21) 256))) (or (not (<= (mod (+ .cse20 .cse2) 256) 127)) (= .cse21 0) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse22) 256) 0)) (not (<= .cse21 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse20 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse21) (<= .cse22 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse25 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse23 (mod (+ .cse25 .cse2) 256))) (let ((.cse24 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse23) 256))) (or (not (<= .cse23 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse24) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse23) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse23 0) (<= .cse24 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse25 256) 127)) (<= (mod (+ .cse25 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (= .cse25 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse7) (or .cse26 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse29 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse28 (mod .cse29 256))) (let ((.cse27 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse28)) 256))) (or (<= .cse27 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse28) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse27) 256) 0)) (not (<= (mod (+ .cse29 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse29 .cse2) 256) 127) (<= .cse28 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse31 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse30 (mod (+ .cse31 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse32 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse30) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse30 127)) (<= (mod (+ .cse31 .cse2) 256) 127) (<= (mod .cse31 256) 127) (= 0 .cse30) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse30) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse32) 256) 0)) (<= .cse32 |c_ULTIMATE.start_main1_~y~0#1|)))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse35 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse33 (mod (+ .cse35 .cse2) 256))) (let ((.cse34 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse33) 256))) (or (not (<= .cse33 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse34) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse33) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse33 0) (<= .cse34 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod .cse35 256) 127) (<= (mod (+ .cse35 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse37 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse38 (mod .cse37 256))) (let ((.cse36 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse38)) 256))) (or (<= .cse36 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse37 .cse2) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse38) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse36) 256) 0)) (<= .cse38 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse37 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse7) (or .cse26 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse39 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse40 (mod (+ .cse39 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse41 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse40) 256))) (or (not (<= (mod (+ .cse39 .cse2) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse40 127)) (= 0 .cse40) (not (<= (mod .cse39 256) 127)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse40) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse41) 256) 0)) (<= .cse41 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse42 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse43 (mod .cse42 256))) (let ((.cse44 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse43) 256))) (or (not (<= (mod (+ .cse42 .cse2) 256) 127)) (= .cse43 0) (not (<= (mod (+ .cse42 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse44) 256) 0)) (not (<= .cse43 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse43) (<= .cse44 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))))) (or .cse26 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse45 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse46 (mod .cse45 256))) (let ((.cse47 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse46) 256))) (or (not (<= (mod (+ .cse45 .cse2) 256) 127)) (= .cse46 0) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse47) 256) 0)) (not (<= .cse46 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse45 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse46) (<= .cse47 |c_ULTIMATE.start_main1_~y~0#1|)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse48 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse49 (mod (+ .cse48 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse50 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse49)) 256))) (or (not (<= (mod (+ .cse48 .cse2) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod .cse48 256) 127)) (<= .cse49 127) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse49) (<= .cse50 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse50) 256) 0)) (= .cse48 0)))))))))) (or .cse26 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse51 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse52 (mod (+ .cse51 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse53 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse52)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod (+ .cse51 .cse2) 256) 127) (not (<= (mod .cse51 256) 127)) (<= .cse52 127) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse52) (<= .cse53 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse53) 256) 0)) (= .cse51 0)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse55 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse54 (mod .cse55 256))) (let ((.cse56 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse54) 256))) (or (= .cse54 0) (<= (mod (+ .cse55 .cse2) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse56) 256) 0)) (not (<= .cse54 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse55 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse54) (<= .cse56 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))))) (or .cse7 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse58 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse59 (mod .cse58 256))) (let ((.cse57 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse59)) 256))) (or (<= .cse57 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse58 .cse2) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse59) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse57) 256) 0)) (not (<= (mod (+ .cse58 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse59 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse62 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse60 (mod (+ .cse62 .cse2) 256))) (let ((.cse61 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse60) 256))) (or (not (<= .cse60 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse61) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse60) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse62 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse60 0) (<= .cse61 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod .cse62 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse26 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse64 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse63 (mod (+ .cse64 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse65 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse63) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse63 127)) (<= (mod (+ .cse64 .cse2) 256) 127) (= 0 .cse63) (not (<= (mod .cse64 256) 127)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse63) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse65) 256) 0)) (<= .cse65 |c_ULTIMATE.start_main1_~y~0#1|) (= .cse64 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse67 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse66 (mod .cse67 256))) (let ((.cse68 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse66) 256))) (or (= .cse66 0) (not (<= (mod (+ .cse67 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse67 .cse2) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse68) 256) 0)) (not (<= .cse66 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse66) (<= .cse68 |c_ULTIMATE.start_main1_~y~0#1|)))))))))) (or .cse7 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse69 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse71 (mod (+ .cse69 .cse2) 256))) (let ((.cse70 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse71)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse69 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse70 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse71 127) (<= (mod .cse69 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse70) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse71)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse74 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse73 (mod .cse74 256))) (let ((.cse72 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse73)) 256))) (or (<= .cse72 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse73) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse72) 256) 0)) (not (<= (mod (+ .cse74 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse74 .cse2) 256) 127) (<= .cse73 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse26 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse75 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse76 (mod (+ .cse75 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse77 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse76)) 256))) (or (not (<= (mod (+ .cse75 .cse2) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod .cse75 256) 127) (<= .cse76 127) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse76) (<= .cse77 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse77) 256) 0))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse79 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse80 (mod .cse79 256))) (let ((.cse78 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse80)) 256))) (or (<= .cse78 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse79 .cse2) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse80) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse78) 256) 0)) (<= .cse80 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse79 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))))) (or .cse26 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse83 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse82 (mod .cse83 256))) (let ((.cse81 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse82)) 256))) (or (<= .cse81 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse82) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse81) 256) 0)) (<= (mod (+ .cse83 .cse2) 256) 127) (<= .cse82 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse83 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse84 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse85 (mod (+ .cse84 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse86 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse85)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod (+ .cse84 .cse2) 256) 127) (<= (mod .cse84 256) 127) (<= .cse85 127) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse85) (<= .cse86 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse86) 256) 0))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))))) (or .cse7 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse89 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse87 (mod (+ .cse89 .cse2) 256))) (let ((.cse88 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse87) 256))) (or (not (<= .cse87 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse88) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse87) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse89 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse87 0) (<= .cse88 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse89 256) 127))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse90 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse91 (mod .cse90 256))) (let ((.cse92 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse91) 256))) (or (not (<= (mod (+ .cse90 .cse2) 256) 127)) (= .cse91 0) (not (<= (mod (+ .cse90 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse92) 256) 0)) (not (<= .cse91 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse91) (<= .cse92 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse26 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse94 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse95 (mod .cse94 256))) (let ((.cse93 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse95)) 256))) (or (<= .cse93 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse94 .cse2) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse95) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse93) 256) 0)) (not (<= (mod (+ .cse94 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse95 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse96 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse97 (mod (+ .cse96 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse98 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse97) 256))) (or (not (<= (mod (+ .cse96 .cse2) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse97 127)) (<= (mod .cse96 256) 127) (= 0 .cse97) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse97) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse98) 256) 0)) (<= .cse98 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0)))))))) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|))) is different from true [2022-11-16 11:01:55,657 WARN L855 $PredicateComparison]: unable to prove that (or (let ((.cse2 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse1 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse0 (mod .cse1 256))) (let ((.cse3 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse0) 256))) (or (= .cse0 0) (<= (mod (+ .cse1 .cse2) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse3) 256) 0)) (not (<= .cse0 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse1 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse0) (<= .cse3 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse5 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse6 (mod .cse5 256))) (let ((.cse4 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse6)) 256))) (or (<= .cse4 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse5 .cse2) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse6) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse4) 256) 0)) (not (<= (mod (+ .cse5 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse6 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse9 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse7 (mod (+ .cse9 .cse2) 256))) (let ((.cse8 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse7) 256))) (or (not (<= .cse7 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse8) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse7) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse9 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse7 0) (<= .cse8 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse9 256) 127))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse10 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse12 (mod (+ .cse10 .cse2) 256))) (let ((.cse11 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse12)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse10 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse11 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse12 127) (not (<= (mod .cse10 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse11) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse12) (= .cse10 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse13 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse14 (mod .cse13 256))) (let ((.cse15 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse14) 256))) (or (not (<= (mod (+ .cse13 .cse2) 256) 127)) (= .cse14 0) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse15) 256) 0)) (not (<= .cse14 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse13 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse14) (<= .cse15 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse18 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse16 (mod (+ .cse18 .cse2) 256))) (let ((.cse17 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse16) 256))) (or (not (<= .cse16 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse17) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse16) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse16 0) (<= .cse17 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse18 256) 127)) (<= (mod (+ .cse18 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (= .cse18 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse21 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (mod .cse21 256))) (let ((.cse19 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse20)) 256))) (or (<= .cse19 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse20) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse19) 256) 0)) (<= (mod (+ .cse21 .cse2) 256) 127) (<= .cse20 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse21 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse22 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse24 (mod (+ .cse22 .cse2) 256))) (let ((.cse23 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse24)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse22 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse23 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse24 127) (<= (mod .cse22 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse23) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse24)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse27 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse25 (mod (+ .cse27 .cse2) 256))) (let ((.cse26 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse25) 256))) (or (not (<= .cse25 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse26) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse25) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse25 0) (<= .cse26 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod .cse27 256) 127) (<= (mod (+ .cse27 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse28 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse29 (mod .cse28 256))) (let ((.cse30 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse29) 256))) (or (not (<= (mod (+ .cse28 .cse2) 256) 127)) (= .cse29 0) (not (<= (mod (+ .cse28 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse30) 256) 0)) (not (<= .cse29 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse29) (<= .cse30 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse33 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse31 (mod (+ .cse33 .cse2) 256))) (let ((.cse32 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse31) 256))) (or (not (<= .cse31 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse32) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse31) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse33 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse31 0) (<= .cse32 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod .cse33 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse36 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse35 (mod (+ .cse36 .cse2) 256))) (let ((.cse34 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse35)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse34 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse35 127) (not (<= (mod .cse36 256) 127)) (<= (mod (+ .cse36 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse34) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse35) (= .cse36 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse39 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse38 (mod (+ .cse39 .cse2) 256))) (let ((.cse37 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse38)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse37 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse38 127) (<= (mod .cse39 256) 127) (<= (mod (+ .cse39 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse37) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse38)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse42 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse41 (mod .cse42 256))) (let ((.cse40 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse41)) 256))) (or (<= .cse40 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse41) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse40) 256) 0)) (not (<= (mod (+ .cse42 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse42 .cse2) 256) 127) (<= .cse41 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse44 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse45 (mod .cse44 256))) (let ((.cse43 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse45)) 256))) (or (<= .cse43 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse44 .cse2) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse45) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse43) 256) 0)) (<= .cse45 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse44 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse47 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse46 (mod .cse47 256))) (let ((.cse48 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse46) 256))) (or (= .cse46 0) (not (<= (mod (+ .cse47 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse47 .cse2) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse48) 256) 0)) (not (<= .cse46 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse46) (<= .cse48 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))))) (< |c_ULTIMATE.start_gcd_test_~b#1| 0) (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|))) is different from true [2022-11-16 11:02:18,122 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-16 11:02:18,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:02:18,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991319239] [2022-11-16 11:02:18,122 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 11:02:18,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895148230] [2022-11-16 11:02:18,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895148230] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:02:18,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:02:18,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-11-16 11:02:18,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258141309] [2022-11-16 11:02:18,123 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:02:18,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-16 11:02:18,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:02:18,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-16 11:02:18,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=247, Unknown=7, NotChecked=66, Total=380 [2022-11-16 11:02:18,124 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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) [2022-11-16 11:02:21,089 WARN L855 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (or (let ((.cse2 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse1 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse0 (mod .cse1 256))) (let ((.cse3 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse0) 256))) (or (= .cse0 0) (<= (mod (+ .cse1 .cse2) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse3) 256) 0)) (not (<= .cse0 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse1 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse0) (<= .cse3 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse5 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse6 (mod .cse5 256))) (let ((.cse4 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse6)) 256))) (or (<= .cse4 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse5 .cse2) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse6) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse4) 256) 0)) (not (<= (mod (+ .cse5 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse6 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse9 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse7 (mod (+ .cse9 .cse2) 256))) (let ((.cse8 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse7) 256))) (or (not (<= .cse7 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse8) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse7) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse9 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse7 0) (<= .cse8 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse9 256) 127))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse10 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse12 (mod (+ .cse10 .cse2) 256))) (let ((.cse11 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse12)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse10 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse11 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse12 127) (not (<= (mod .cse10 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse11) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse12) (= .cse10 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse13 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse14 (mod .cse13 256))) (let ((.cse15 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse14) 256))) (or (not (<= (mod (+ .cse13 .cse2) 256) 127)) (= .cse14 0) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse15) 256) 0)) (not (<= .cse14 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse13 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse14) (<= .cse15 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse18 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse16 (mod (+ .cse18 .cse2) 256))) (let ((.cse17 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse16) 256))) (or (not (<= .cse16 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse17) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse16) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse16 0) (<= .cse17 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse18 256) 127)) (<= (mod (+ .cse18 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (= .cse18 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse21 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (mod .cse21 256))) (let ((.cse19 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse20)) 256))) (or (<= .cse19 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse20) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse19) 256) 0)) (<= (mod (+ .cse21 .cse2) 256) 127) (<= .cse20 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse21 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse22 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse24 (mod (+ .cse22 .cse2) 256))) (let ((.cse23 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse24)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse22 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse23 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse24 127) (<= (mod .cse22 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse23) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse24)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse27 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse25 (mod (+ .cse27 .cse2) 256))) (let ((.cse26 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse25) 256))) (or (not (<= .cse25 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse26) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse25) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse25 0) (<= .cse26 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod .cse27 256) 127) (<= (mod (+ .cse27 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse28 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse29 (mod .cse28 256))) (let ((.cse30 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse29) 256))) (or (not (<= (mod (+ .cse28 .cse2) 256) 127)) (= .cse29 0) (not (<= (mod (+ .cse28 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse30) 256) 0)) (not (<= .cse29 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse29) (<= .cse30 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse33 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse31 (mod (+ .cse33 .cse2) 256))) (let ((.cse32 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse31) 256))) (or (not (<= .cse31 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse32) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse31) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse33 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse31 0) (<= .cse32 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod .cse33 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse36 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse35 (mod (+ .cse36 .cse2) 256))) (let ((.cse34 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse35)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse34 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse35 127) (not (<= (mod .cse36 256) 127)) (<= (mod (+ .cse36 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse34) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse35) (= .cse36 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse39 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse38 (mod (+ .cse39 .cse2) 256))) (let ((.cse37 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse38)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse37 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse38 127) (<= (mod .cse39 256) 127) (<= (mod (+ .cse39 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse37) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse38)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse42 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse41 (mod .cse42 256))) (let ((.cse40 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse41)) 256))) (or (<= .cse40 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse41) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse40) 256) 0)) (not (<= (mod (+ .cse42 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse42 .cse2) 256) 127) (<= .cse41 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse44 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse45 (mod .cse44 256))) (let ((.cse43 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse45)) 256))) (or (<= .cse43 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse44 .cse2) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse45) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse43) 256) 0)) (<= .cse45 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse44 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse47 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse46 (mod .cse47 256))) (let ((.cse48 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse46) 256))) (or (= .cse46 0) (not (<= (mod (+ .cse47 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse47 .cse2) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse48) 256) 0)) (not (<= .cse46 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse46) (<= .cse48 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))))) (< |c_ULTIMATE.start_gcd_test_~b#1| 0) (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|))) (= |c_ULTIMATE.start_main1_~y~0#1| |c_ULTIMATE.start_gcd_test_~b#1|)) is different from true [2022-11-16 11:02:23,150 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse8 (< |c_ULTIMATE.start_gcd_test_~b#1| 0))) (let ((.cse0 (not .cse8))) (and .cse0 (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (= |c_ULTIMATE.start_main1_~y~0#1| |c_ULTIMATE.start_gcd_test_~b#1|) (or (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (let ((.cse3 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (and (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse2 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse1 (mod .cse2 256))) (let ((.cse4 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse1) 256))) (or (= .cse1 0) (<= (mod (+ .cse2 .cse3) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse4) 256) 0)) (not (<= .cse1 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse2 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse1) (<= .cse4 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse7 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse6 (mod (+ .cse7 .cse3) 256))) (let ((.cse5 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse6)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse5 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse6 127) (not (<= (mod .cse7 256) 127)) (<= (mod (+ .cse7 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse5) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse6) (= .cse7 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse8) (or .cse8 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse11 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse10 (mod .cse11 256))) (let ((.cse9 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse10)) 256))) (or (<= .cse9 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse10) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse9) 256) 0)) (<= (mod (+ .cse11 .cse3) 256) 127) (<= .cse10 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse11 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse14 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse13 (mod (+ .cse14 .cse3) 256))) (let ((.cse12 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse13)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= .cse12 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse13 127) (<= (mod .cse14 256) 127) (<= (mod (+ .cse14 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse12) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse13)))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse15 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse17 (mod (+ .cse15 .cse3) 256))) (let ((.cse16 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse17)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse15 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse16 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse17 127) (not (<= (mod .cse15 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse16) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse17) (= .cse15 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse19 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse18 (mod .cse19 256))) (let ((.cse20 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse18) 256))) (or (= .cse18 0) (not (<= (mod (+ .cse19 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse19 .cse3) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse20) 256) 0)) (not (<= .cse18 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse18) (<= .cse20 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse8) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse21 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse22 (mod .cse21 256))) (let ((.cse23 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse22) 256))) (or (not (<= (mod (+ .cse21 .cse3) 256) 127)) (= .cse22 0) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse23) 256) 0)) (not (<= .cse22 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse21 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse22) (<= .cse23 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse26 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse24 (mod (+ .cse26 .cse3) 256))) (let ((.cse25 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse24) 256))) (or (not (<= .cse24 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse25) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse24) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse24 0) (<= .cse25 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse26 256) 127)) (<= (mod (+ .cse26 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (= .cse26 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse8) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse29 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse28 (mod .cse29 256))) (let ((.cse27 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse28)) 256))) (or (<= .cse27 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse28) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse27) 256) 0)) (not (<= (mod (+ .cse29 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse29 .cse3) 256) 127) (<= .cse28 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse31 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse30 (mod (+ .cse31 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse32 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse30) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse30 127)) (<= (mod (+ .cse31 .cse3) 256) 127) (<= (mod .cse31 256) 127) (= 0 .cse30) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse30) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse32) 256) 0)) (<= .cse32 |c_ULTIMATE.start_main1_~y~0#1|)))))))))) (or (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse35 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse33 (mod (+ .cse35 .cse3) 256))) (let ((.cse34 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse33) 256))) (or (not (<= .cse33 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse34) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse33) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (= .cse33 0) (<= .cse34 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod .cse35 256) 127) (<= (mod (+ .cse35 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse37 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse38 (mod .cse37 256))) (let ((.cse36 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse38)) 256))) (or (<= .cse36 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse37 .cse3) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse38) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse36) 256) 0)) (<= .cse38 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse37 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse8) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse39 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse40 (mod (+ .cse39 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse41 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse40) 256))) (or (not (<= (mod (+ .cse39 .cse3) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse40 127)) (= 0 .cse40) (not (<= (mod .cse39 256) 127)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse40) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse41) 256) 0)) (<= .cse41 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse42 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse43 (mod .cse42 256))) (let ((.cse44 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse43) 256))) (or (not (<= (mod (+ .cse42 .cse3) 256) 127)) (= .cse43 0) (not (<= (mod (+ .cse42 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse44) 256) 0)) (not (<= .cse43 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse43) (<= .cse44 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse45 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse46 (mod .cse45 256))) (let ((.cse47 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse46) 256))) (or (not (<= (mod (+ .cse45 .cse3) 256) 127)) (= .cse46 0) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse47) 256) 0)) (not (<= .cse46 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse45 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse46) (<= .cse47 |c_ULTIMATE.start_main1_~y~0#1|)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse48 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse49 (mod (+ .cse48 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse50 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse49)) 256))) (or (not (<= (mod (+ .cse48 .cse3) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod .cse48 256) 127)) (<= .cse49 127) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse49) (<= .cse50 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse50) 256) 0)) (= .cse48 0)))))))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse51 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse52 (mod (+ .cse51 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse53 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse52)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod (+ .cse51 .cse3) 256) 127) (not (<= (mod .cse51 256) 127)) (<= .cse52 127) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse52) (<= .cse53 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse53) 256) 0)) (= .cse51 0)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse55 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse54 (mod .cse55 256))) (let ((.cse56 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse54) 256))) (or (= .cse54 0) (<= (mod (+ .cse55 .cse3) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse56) 256) 0)) (not (<= .cse54 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse55 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse54) (<= .cse56 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))))) (or .cse8 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse58 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse59 (mod .cse58 256))) (let ((.cse57 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse59)) 256))) (or (<= .cse57 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse58 .cse3) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse59) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse57) 256) 0)) (not (<= (mod (+ .cse58 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse59 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse62 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse60 (mod (+ .cse62 .cse3) 256))) (let ((.cse61 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse60) 256))) (or (not (<= .cse60 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse61) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse60) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse62 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse60 0) (<= .cse61 |c_ULTIMATE.start_main1_~y~0#1|) (<= (mod .cse62 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse64 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse63 (mod (+ .cse64 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse65 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse63) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse63 127)) (<= (mod (+ .cse64 .cse3) 256) 127) (= 0 .cse63) (not (<= (mod .cse64 256) 127)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse63) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse65) 256) 0)) (<= .cse65 |c_ULTIMATE.start_main1_~y~0#1|) (= .cse64 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse67 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse66 (mod .cse67 256))) (let ((.cse68 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse66) 256))) (or (= .cse66 0) (not (<= (mod (+ .cse67 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse67 .cse3) 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse68) 256) 0)) (not (<= .cse66 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse66) (<= .cse68 |c_ULTIMATE.start_main1_~y~0#1|)))))))))) (or .cse8 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse69 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse71 (mod (+ .cse69 .cse3) 256))) (let ((.cse70 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse71)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse69 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse70 |c_ULTIMATE.start_main1_~y~0#1|) (<= .cse71 127) (<= (mod .cse69 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse70) 256) 0)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse71)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse74 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse73 (mod .cse74 256))) (let ((.cse72 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse73)) 256))) (or (<= .cse72 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse73) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse72) 256) 0)) (not (<= (mod (+ .cse74 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse74 .cse3) 256) 127) (<= .cse73 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse75 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse76 (mod (+ .cse75 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse77 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse76)) 256))) (or (not (<= (mod (+ .cse75 .cse3) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod .cse75 256) 127) (<= .cse76 127) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse76) (<= .cse77 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse77) 256) 0))))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse79 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse80 (mod .cse79 256))) (let ((.cse78 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse80)) 256))) (or (<= .cse78 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse79 .cse3) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse80) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse78) 256) 0)) (<= .cse80 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse79 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse83 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse82 (mod .cse83 256))) (let ((.cse81 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse82)) 256))) (or (<= .cse81 |c_ULTIMATE.start_main1_~y~0#1|) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse82) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse81) 256) 0)) (<= (mod (+ .cse83 .cse3) 256) 127) (<= .cse82 127) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse83 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse84 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse85 (mod (+ .cse84 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse86 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse85)) 256))) (or (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod (+ .cse84 .cse3) 256) 127) (<= (mod .cse84 256) 127) (<= .cse85 127) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse85) (<= .cse86 |c_ULTIMATE.start_main1_~y~0#1|) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse86) 256) 0))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))))) (or .cse8 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse89 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse87 (mod (+ .cse89 .cse3) 256))) (let ((.cse88 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse87) 256))) (or (not (<= .cse87 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse88) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse87) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse89 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (= .cse87 0) (<= .cse88 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod .cse89 256) 127))))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse90 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse91 (mod .cse90 256))) (let ((.cse92 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse91) 256))) (or (not (<= (mod (+ .cse90 .cse3) 256) 127)) (= .cse91 0) (not (<= (mod (+ .cse90 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse92) 256) 0)) (not (<= .cse91 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse91) (<= .cse92 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse94 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse95 (mod .cse94 256))) (let ((.cse93 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse95)) 256))) (or (<= .cse93 |c_ULTIMATE.start_main1_~y~0#1|) (not (<= (mod (+ .cse94 .cse3) 256) 127)) (< (+ 256 |v_ULTIMATE.start_gcd_test_~a#1_20|) .cse95) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse93) 256) 0)) (not (<= (mod (+ .cse94 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= .cse95 127) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (forall ((|v_ULTIMATE.start_gcd_test_~a#1_20| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse96 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse97 (mod (+ .cse96 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (let ((.cse98 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse97) 256))) (or (not (<= (mod (+ .cse96 .cse3) 256) 127)) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse97 127)) (<= (mod .cse96 256) 127) (= 0 .cse97) (< |v_ULTIMATE.start_gcd_test_~a#1_20| .cse97) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_20| .cse98) 256) 0)) (<= .cse98 |c_ULTIMATE.start_main1_~y~0#1|)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_21| 0))))))) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|)))))) is different from true [2022-11-16 11:02:34,928 WARN L233 SmtUtils]: Spent 7.71s on a formula simplification. DAG size of input: 54 DAG size of output: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:02:35,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:02:35,323 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-11-16 11:02:35,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 11:02:35,324 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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 14 [2022-11-16 11:02:35,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:02:35,325 INFO L225 Difference]: With dead ends: 46 [2022-11-16 11:02:35,325 INFO L226 Difference]: Without dead ends: 36 [2022-11-16 11:02:35,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 191.2s TimeCoverageRelationStatistics Valid=86, Invalid=340, Unknown=10, NotChecked=164, Total=600 [2022-11-16 11:02:35,328 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 9 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:02:35,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 222 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 79 Unchecked, 0.1s Time] [2022-11-16 11:02:35,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-16 11:02:35,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-11-16 11:02:35,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 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) [2022-11-16 11:02:35,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-11-16 11:02:35,345 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 14 [2022-11-16 11:02:35,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:02:35,345 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-11-16 11:02:35,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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) [2022-11-16 11:02:35,346 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-11-16 11:02:35,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 11:02:35,347 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:02:35,347 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:02:35,355 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 11:02:35,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:02:35,552 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:02:35,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:02:35,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1722496713, now seen corresponding path program 4 times [2022-11-16 11:02:35,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:02:35,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212585187] [2022-11-16 11:02:35,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:02:35,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:02:35,561 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 11:02:35,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1553730670] [2022-11-16 11:02:35,561 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 11:02:35,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:02:35,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:02:35,562 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:02:35,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 11:02:35,723 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 11:02:35,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:02:35,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-16 11:02:35,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:02:49,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:02:49,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212585187] [2022-11-16 11:02:49,282 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 11:02:49,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553730670] [2022-11-16 11:02:49,283 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-11-16 11:02:49,287 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 139 [2022-11-16 11:02:49,288 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 11:02:49,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:02:49,484 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:625) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:198) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 51 more [2022-11-16 11:02:49,487 INFO L158 Benchmark]: Toolchain (without parser) took 535446.99ms. Allocated memory was 109.1MB in the beginning and 169.9MB in the end (delta: 60.8MB). Free memory was 64.8MB in the beginning and 122.9MB in the end (delta: -58.1MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. [2022-11-16 11:02:49,487 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 109.1MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:02:49,488 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.89ms. Allocated memory is still 109.1MB. Free memory was 64.6MB in the beginning and 82.4MB in the end (delta: -17.8MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2022-11-16 11:02:49,488 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.28ms. Allocated memory is still 109.1MB. Free memory was 82.4MB in the beginning and 80.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:02:49,488 INFO L158 Benchmark]: Boogie Preprocessor took 42.50ms. Allocated memory is still 109.1MB. Free memory was 80.6MB in the beginning and 79.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:02:49,489 INFO L158 Benchmark]: RCFGBuilder took 400.39ms. Allocated memory is still 109.1MB. Free memory was 79.2MB in the beginning and 66.8MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-16 11:02:49,489 INFO L158 Benchmark]: TraceAbstraction took 534631.61ms. Allocated memory was 109.1MB in the beginning and 169.9MB in the end (delta: 60.8MB). Free memory was 66.3MB in the beginning and 122.9MB in the end (delta: -56.6MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2022-11-16 11:02:49,491 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.49ms. Allocated memory is still 109.1MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.89ms. Allocated memory is still 109.1MB. Free memory was 64.6MB in the beginning and 82.4MB in the end (delta: -17.8MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.28ms. Allocated memory is still 109.1MB. Free memory was 82.4MB in the beginning and 80.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.50ms. Allocated memory is still 109.1MB. Free memory was 80.6MB in the beginning and 79.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 400.39ms. Allocated memory is still 109.1MB. Free memory was 79.2MB in the beginning and 66.8MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 534631.61ms. Allocated memory was 109.1MB in the beginning and 169.9MB in the end (delta: 60.8MB). Free memory was 66.3MB in the beginning and 122.9MB in the end (delta: -56.6MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_2+newton_2_2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --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 edf451b08ccf28b9358a6fa7c10128ea1b9a8f09b01361f9cd588dc4a31f271a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 11:02:51,504 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:02:51,506 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:02:51,543 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:02:51,543 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:02:51,547 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:02:51,550 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:02:51,556 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:02:51,558 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:02:51,563 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:02:51,564 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:02:51,565 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:02:51,565 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:02:51,566 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:02:51,567 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:02:51,568 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:02:51,569 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:02:51,570 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:02:51,573 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:02:51,581 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:02:51,586 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:02:51,588 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:02:51,589 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:02:51,590 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:02:51,593 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:02:51,594 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:02:51,594 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:02:51,595 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:02:51,595 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:02:51,596 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:02:51,596 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:02:51,597 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:02:51,598 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:02:51,601 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:02:51,607 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:02:51,608 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:02:51,608 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:02:51,609 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:02:51,609 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:02:51,611 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:02:51,611 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:02:51,616 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-16 11:02:51,674 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:02:51,674 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:02:51,675 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:02:51,676 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:02:51,677 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:02:51,677 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:02:51,678 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:02:51,678 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:02:51,679 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:02:51,679 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:02:51,680 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:02:51,680 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:02:51,680 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:02:51,680 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:02:51,681 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:02:51,681 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:02:51,681 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 11:02:51,681 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 11:02:51,682 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 11:02:51,682 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:02:51,682 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:02:51,682 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:02:51,682 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:02:51,683 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:02:51,683 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:02:51,683 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:02:51,684 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:02:51,684 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:02:51,684 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:02:51,684 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:02:51,684 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-16 11:02:51,685 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 11:02:51,685 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:02:51,685 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:02:51,685 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:02:51,686 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 11:02:51,686 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/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_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> edf451b08ccf28b9358a6fa7c10128ea1b9a8f09b01361f9cd588dc4a31f271a [2022-11-16 11:02:52,097 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:02:52,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:02:52,126 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:02:52,127 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:02:52,128 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:02:52,130 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/combinations/gcd_2+newton_2_2.i [2022-11-16 11:02:52,194 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/data/fb60f530f/589d1a59dd1b407c8771083b044cf11e/FLAG62cd55065 [2022-11-16 11:02:52,684 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:02:52,685 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/sv-benchmarks/c/combinations/gcd_2+newton_2_2.i [2022-11-16 11:02:52,702 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/data/fb60f530f/589d1a59dd1b407c8771083b044cf11e/FLAG62cd55065 [2022-11-16 11:02:53,061 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/data/fb60f530f/589d1a59dd1b407c8771083b044cf11e [2022-11-16 11:02:53,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:02:53,066 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:02:53,069 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:02:53,069 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:02:53,073 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:02:53,074 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:02:53" (1/1) ... [2022-11-16 11:02:53,075 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f8fd6cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:02:53, skipping insertion in model container [2022-11-16 11:02:53,076 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:02:53" (1/1) ... [2022-11-16 11:02:53,087 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:02:53,112 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:02:53,250 WARN L229 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_202dc9d0-b474-41b1-bd46-6f1c2532eb01/sv-benchmarks/c/combinations/gcd_2+newton_2_2.i[1226,1239] [2022-11-16 11:02:53,274 WARN L229 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_202dc9d0-b474-41b1-bd46-6f1c2532eb01/sv-benchmarks/c/combinations/gcd_2+newton_2_2.i[2841,2854] [2022-11-16 11:02:53,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:02:53,287 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:02:53,336 WARN L229 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_202dc9d0-b474-41b1-bd46-6f1c2532eb01/sv-benchmarks/c/combinations/gcd_2+newton_2_2.i[1226,1239] [2022-11-16 11:02:53,348 WARN L229 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_202dc9d0-b474-41b1-bd46-6f1c2532eb01/sv-benchmarks/c/combinations/gcd_2+newton_2_2.i[2841,2854] [2022-11-16 11:02:53,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:02:53,366 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:02:53,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:02:53 WrapperNode [2022-11-16 11:02:53,373 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:02:53,374 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:02:53,374 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:02:53,374 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:02:53,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:02:53" (1/1) ... [2022-11-16 11:02:53,404 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:02:53" (1/1) ... [2022-11-16 11:02:53,436 INFO L138 Inliner]: procedures = 28, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 80 [2022-11-16 11:02:53,437 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:02:53,438 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:02:53,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:02:53,439 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:02:53,448 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:02:53" (1/1) ... [2022-11-16 11:02:53,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:02:53" (1/1) ... [2022-11-16 11:02:53,462 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:02:53" (1/1) ... [2022-11-16 11:02:53,462 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:02:53" (1/1) ... [2022-11-16 11:02:53,475 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:02:53" (1/1) ... [2022-11-16 11:02:53,479 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:02:53" (1/1) ... [2022-11-16 11:02:53,480 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:02:53" (1/1) ... [2022-11-16 11:02:53,481 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:02:53" (1/1) ... [2022-11-16 11:02:53,484 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:02:53,485 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:02:53,485 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:02:53,485 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:02:53,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:02:53" (1/1) ... [2022-11-16 11:02:53,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:02:53,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:02:53,528 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:02:53,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:02:53,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:02:53,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-16 11:02:53,572 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-11-16 11:02:53,572 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-11-16 11:02:53,572 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-11-16 11:02:53,572 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-11-16 11:02:53,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:02:53,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:02:53,690 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:02:53,692 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:03:02,754 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:03:02,766 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:03:02,767 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-16 11:03:02,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:03:02 BoogieIcfgContainer [2022-11-16 11:03:02,772 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:03:02,775 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:03:02,775 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:03:02,778 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:03:02,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:02:53" (1/3) ... [2022-11-16 11:03:02,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@142a469 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:03:02, skipping insertion in model container [2022-11-16 11:03:02,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:02:53" (2/3) ... [2022-11-16 11:03:02,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@142a469 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:03:02, skipping insertion in model container [2022-11-16 11:03:02,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:03:02" (3/3) ... [2022-11-16 11:03:02,783 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_2+newton_2_2.i [2022-11-16 11:03:02,803 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:03:02,804 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-16 11:03:02,866 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:03:02,891 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=LoopsAndPotentialCycles, 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;@43d3daa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:03:02,892 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-16 11:03:02,896 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 30 states have internal predecessors, (39), 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) [2022-11-16 11:03:02,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 11:03:02,904 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:03:02,905 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:03:02,905 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:03:02,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:03:02,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1709385323, now seen corresponding path program 1 times [2022-11-16 11:03:02,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:03:02,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1198205988] [2022-11-16 11:03:02,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:03:02,925 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:03:02,925 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:03:02,931 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:03:02,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-16 11:03:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:03:03,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 11:03:03,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:03:03,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:03:03,182 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:03:03,182 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:03:03,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1198205988] [2022-11-16 11:03:03,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1198205988] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:03:03,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:03:03,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:03:03,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883707078] [2022-11-16 11:03:03,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:03:03,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:03:03,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:03:03,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:03:03,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:03:03,235 INFO L87 Difference]: Start difference. First operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 30 states have internal predecessors, (39), 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 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) [2022-11-16 11:03:03,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:03:03,280 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2022-11-16 11:03:03,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:03:03,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 [2022-11-16 11:03:03,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:03:03,289 INFO L225 Difference]: With dead ends: 68 [2022-11-16 11:03:03,289 INFO L226 Difference]: Without dead ends: 30 [2022-11-16 11:03:03,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:03:03,297 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:03:03,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 4 Unchecked, 0.0s Time] [2022-11-16 11:03:03,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-16 11:03:03,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-16 11:03:03,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 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) [2022-11-16 11:03:03,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-11-16 11:03:03,346 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 11 [2022-11-16 11:03:03,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:03:03,347 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-11-16 11:03:03,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) [2022-11-16 11:03:03,348 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-11-16 11:03:03,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 11:03:03,350 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:03:03,350 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:03:03,373 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-16 11:03:03,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:03:03,573 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:03:03,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:03:03,574 INFO L85 PathProgramCache]: Analyzing trace with hash 65622039, now seen corresponding path program 1 times [2022-11-16 11:03:03,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:03:03,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1493127521] [2022-11-16 11:03:03,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:03:03,576 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:03:03,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:03:03,578 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:03:03,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-16 11:03:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:03:03,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:03:03,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:03:03,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:03:03,812 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:03:03,813 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:03:03,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1493127521] [2022-11-16 11:03:03,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1493127521] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:03:03,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:03:03,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:03:03,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081829528] [2022-11-16 11:03:03,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:03:03,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:03:03,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:03:03,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:03:03,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:03:03,817 INFO L87 Difference]: Start difference. First operand 30 states and 34 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) [2022-11-16 11:03:04,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:03:04,030 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-11-16 11:03:04,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:03:04,031 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 [2022-11-16 11:03:04,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:03:04,031 INFO L225 Difference]: With dead ends: 37 [2022-11-16 11:03:04,032 INFO L226 Difference]: Without dead ends: 31 [2022-11-16 11:03:04,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:03:04,033 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:03:04,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 84 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:03:04,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-16 11:03:04,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-11-16 11:03:04,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 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) [2022-11-16 11:03:04,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-11-16 11:03:04,041 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 11 [2022-11-16 11:03:04,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:03:04,041 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-11-16 11:03:04,041 INFO L496 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) [2022-11-16 11:03:04,042 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-11-16 11:03:04,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 11:03:04,042 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:03:04,042 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:03:04,060 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-16 11:03:04,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:03:04,255 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:03:04,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:03:04,256 INFO L85 PathProgramCache]: Analyzing trace with hash 149955676, now seen corresponding path program 1 times [2022-11-16 11:03:04,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:03:04,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [771288776] [2022-11-16 11:03:04,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:03:04,257 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:03:04,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:03:04,261 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:03:04,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-16 11:03:04,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:03:04,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:03:04,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:03:04,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:03:04,516 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:03:04,516 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:03:04,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [771288776] [2022-11-16 11:03:04,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [771288776] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:03:04,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:03:04,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:03:04,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375237352] [2022-11-16 11:03:04,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:03:04,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:03:04,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:03:04,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:03:04,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:03:04,519 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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) [2022-11-16 11:03:04,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:03:04,634 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-11-16 11:03:04,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:03:04,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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 12 [2022-11-16 11:03:04,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:03:04,637 INFO L225 Difference]: With dead ends: 38 [2022-11-16 11:03:04,637 INFO L226 Difference]: Without dead ends: 30 [2022-11-16 11:03:04,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:03:04,639 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:03:04,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 84 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:03:04,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-16 11:03:04,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-16 11:03:04,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 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) [2022-11-16 11:03:04,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-11-16 11:03:04,645 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 12 [2022-11-16 11:03:04,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:03:04,645 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-11-16 11:03:04,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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) [2022-11-16 11:03:04,648 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-11-16 11:03:04,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 11:03:04,650 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:03:04,650 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:03:04,667 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-11-16 11:03:04,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:03:04,863 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:03:04,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:03:04,864 INFO L85 PathProgramCache]: Analyzing trace with hash -659390950, now seen corresponding path program 1 times [2022-11-16 11:03:04,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:03:04,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [245097577] [2022-11-16 11:03:04,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:03:04,865 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:03:04,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:03:04,869 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:03:04,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-16 11:03:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:03:04,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 11:03:04,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:03:05,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:03:05,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:03:06,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:03:06,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:03:06,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [245097577] [2022-11-16 11:03:06,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [245097577] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:03:06,419 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:03:06,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-11-16 11:03:06,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592897064] [2022-11-16 11:03:06,419 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:03:06,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-16 11:03:06,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:03:06,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-16 11:03:06,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-11-16 11:03:06,421 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 14 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) [2022-11-16 11:03:08,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:03:08,918 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-11-16 11:03:08,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 11:03:08,920 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 14 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 [2022-11-16 11:03:08,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:03:08,921 INFO L225 Difference]: With dead ends: 47 [2022-11-16 11:03:08,921 INFO L226 Difference]: Without dead ends: 33 [2022-11-16 11:03:08,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2022-11-16 11:03:08,924 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 42 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:03:08,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 224 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-16 11:03:08,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-16 11:03:08,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-11-16 11:03:08,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 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) [2022-11-16 11:03:08,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-11-16 11:03:08,931 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 12 [2022-11-16 11:03:08,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:03:08,931 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-11-16 11:03:08,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 14 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) [2022-11-16 11:03:08,932 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-11-16 11:03:08,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 11:03:08,932 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:03:08,932 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:03:08,956 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-16 11:03:09,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:03:09,157 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:03:09,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:03:09,158 INFO L85 PathProgramCache]: Analyzing trace with hash -2084161321, now seen corresponding path program 2 times [2022-11-16 11:03:09,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:03:09,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1786069215] [2022-11-16 11:03:09,159 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:03:09,159 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:03:09,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:03:09,161 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:03:09,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_202dc9d0-b474-41b1-bd46-6f1c2532eb01/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-16 11:03:14,741 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:03:14,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:03:14,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-16 11:03:14,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:03:53,855 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:03:53,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:06:53,447 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_gcd_test_~a#1| (_ BitVec 8)) (|v_ULTIMATE.start_main1_~y~0#1_6| (_ BitVec 8))) (let ((.cse0 ((_ sign_extend 24) |v_ULTIMATE.start_main1_~y~0#1_6|))) (let ((.cse3 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (bvneg ((_ sign_extend 24) |ULTIMATE.start_gcd_test_~a#1|)))) .cse0))))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse0 .cse3))))) (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse3 .cse2))))) (or (not (bvsgt .cse0 (_ bv0 32))) (bvsge .cse0 .cse1) (not (= ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse2 .cse1))) (_ bv0 32))))))))) is different from false [2022-11-16 11:06:55,477 WARN L855 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_gcd_test_~a#1| (_ BitVec 8)) (|v_ULTIMATE.start_main1_~y~0#1_6| (_ BitVec 8))) (let ((.cse0 ((_ sign_extend 24) |v_ULTIMATE.start_main1_~y~0#1_6|))) (let ((.cse3 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem ((_ sign_extend 24) ((_ extract 7 0) (bvneg ((_ sign_extend 24) |ULTIMATE.start_gcd_test_~a#1|)))) .cse0))))) (let ((.cse2 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse0 .cse3))))) (let ((.cse1 ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse3 .cse2))))) (or (not (bvsgt .cse0 (_ bv0 32))) (bvsge .cse0 .cse1) (not (= ((_ sign_extend 24) ((_ extract 7 0) (bvsrem .cse2 .cse1))) (_ bv0 32))))))))) is different from true [2022-11-16 11:07:05,910 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:07:05,910 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:07:05,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1786069215] [2022-11-16 11:07:05,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1786069215] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:07:05,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:07:05,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2022-11-16 11:07:05,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444104179] [2022-11-16 11:07:05,911 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:07:05,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-16 11:07:05,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:07:05,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-16 11:07:05,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=422, Unknown=48, NotChecked=44, Total=600 [2022-11-16 11:07:05,913 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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) [2022-11-16 11:07:22,920 WARN L233 SmtUtils]: Spent 12.35s on a formula simplification. DAG size of input: 34 DAG size of output: 3 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:07:43,608 WARN L233 SmtUtils]: Spent 8.74s on a formula simplification. DAG size of input: 40 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:07:45,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []