./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_3+newton_2_6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a 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_20d3b722-45b2-4819-9a80-93c5c3a0b59d/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20d3b722-45b2-4819-9a80-93c5c3a0b59d/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20d3b722-45b2-4819-9a80-93c5c3a0b59d/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20d3b722-45b2-4819-9a80-93c5c3a0b59d/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_3+newton_2_6.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20d3b722-45b2-4819-9a80-93c5c3a0b59d/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20d3b722-45b2-4819-9a80-93c5c3a0b59d/bin/uautomizer-Dbtcem3rbc --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 3d09a4cc0bc23b63ede1d1b9d8e202055edfb550f267c616041c6cb452339e6a --- 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-5e519f3 [2022-11-02 21:00:48,326 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:00:48,328 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:00:48,357 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:00:48,357 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:00:48,358 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:00:48,360 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:00:48,362 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:00:48,363 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:00:48,365 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:00:48,366 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:00:48,367 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:00:48,367 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:00:48,368 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:00:48,370 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:00:48,371 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:00:48,372 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:00:48,373 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:00:48,375 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:00:48,377 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:00:48,379 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:00:48,380 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:00:48,382 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:00:48,383 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:00:48,386 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:00:48,387 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:00:48,387 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:00:48,388 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:00:48,389 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:00:48,390 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:00:48,391 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:00:48,392 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:00:48,393 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:00:48,393 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:00:48,395 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:00:48,395 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:00:48,396 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:00:48,396 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:00:48,397 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:00:48,397 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:00:48,398 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:00:48,399 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20d3b722-45b2-4819-9a80-93c5c3a0b59d/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 21:00:48,423 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:00:48,423 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:00:48,423 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:00:48,424 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:00:48,425 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:00:48,425 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:00:48,426 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:00:48,426 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:00:48,426 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:00:48,427 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:00:48,427 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:00:48,427 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:00:48,427 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:00:48,427 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:00:48,428 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:00:48,428 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:00:48,428 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:00:48,428 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:00:48,429 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:00:48,429 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:00:48,429 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:00:48,429 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:00:48,430 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:00:48,430 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:00:48,430 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:00:48,430 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:00:48,431 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:00:48,431 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:00:48,431 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:00:48,431 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:00:48,432 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 21:00:48,432 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 21:00:48,432 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:00:48,432 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_20d3b722-45b2-4819-9a80-93c5c3a0b59d/bin/uautomizer-Dbtcem3rbc/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_20d3b722-45b2-4819-9a80-93c5c3a0b59d/bin/uautomizer-Dbtcem3rbc 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 -> 3d09a4cc0bc23b63ede1d1b9d8e202055edfb550f267c616041c6cb452339e6a [2022-11-02 21:00:48,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:00:48,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:00:48,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:00:48,702 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:00:48,703 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:00:48,705 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20d3b722-45b2-4819-9a80-93c5c3a0b59d/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/combinations/gcd_3+newton_2_6.i [2022-11-02 21:00:48,792 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20d3b722-45b2-4819-9a80-93c5c3a0b59d/bin/uautomizer-Dbtcem3rbc/data/ee6a87db8/0d0f642243fe4ba1ba5a918c646aa3b2/FLAG7762ebf11 [2022-11-02 21:00:49,369 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:00:49,371 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20d3b722-45b2-4819-9a80-93c5c3a0b59d/sv-benchmarks/c/combinations/gcd_3+newton_2_6.i [2022-11-02 21:00:49,382 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20d3b722-45b2-4819-9a80-93c5c3a0b59d/bin/uautomizer-Dbtcem3rbc/data/ee6a87db8/0d0f642243fe4ba1ba5a918c646aa3b2/FLAG7762ebf11 [2022-11-02 21:00:49,718 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20d3b722-45b2-4819-9a80-93c5c3a0b59d/bin/uautomizer-Dbtcem3rbc/data/ee6a87db8/0d0f642243fe4ba1ba5a918c646aa3b2 [2022-11-02 21:00:49,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:00:49,722 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:00:49,724 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:00:49,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:00:49,728 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:00:49,729 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:00:49" (1/1) ... [2022-11-02 21:00:49,731 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14fc7324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:49, skipping insertion in model container [2022-11-02 21:00:49,732 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:00:49" (1/1) ... [2022-11-02 21:00:49,743 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:00:49,765 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:00:49,962 WARN L230 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_20d3b722-45b2-4819-9a80-93c5c3a0b59d/sv-benchmarks/c/combinations/gcd_3+newton_2_6.i[1226,1239] [2022-11-02 21:00:49,986 WARN L230 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_20d3b722-45b2-4819-9a80-93c5c3a0b59d/sv-benchmarks/c/combinations/gcd_3+newton_2_6.i[2841,2854] [2022-11-02 21:00:49,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:00:49,996 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:00:50,013 WARN L230 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_20d3b722-45b2-4819-9a80-93c5c3a0b59d/sv-benchmarks/c/combinations/gcd_3+newton_2_6.i[1226,1239] [2022-11-02 21:00:50,027 WARN L230 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_20d3b722-45b2-4819-9a80-93c5c3a0b59d/sv-benchmarks/c/combinations/gcd_3+newton_2_6.i[2841,2854] [2022-11-02 21:00:50,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:00:50,047 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:00:50,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:50 WrapperNode [2022-11-02 21:00:50,048 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:00:50,049 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:00:50,049 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:00:50,049 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:00:50,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:50" (1/1) ... [2022-11-02 21:00:50,079 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:50" (1/1) ... [2022-11-02 21:00:50,103 INFO L138 Inliner]: procedures = 27, calls = 16, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 77 [2022-11-02 21:00:50,104 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:00:50,105 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:00:50,105 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:00:50,105 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:00:50,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:50" (1/1) ... [2022-11-02 21:00:50,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:50" (1/1) ... [2022-11-02 21:00:50,115 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:50" (1/1) ... [2022-11-02 21:00:50,115 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:50" (1/1) ... [2022-11-02 21:00:50,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:50" (1/1) ... [2022-11-02 21:00:50,123 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:50" (1/1) ... [2022-11-02 21:00:50,124 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:50" (1/1) ... [2022-11-02 21:00:50,125 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:50" (1/1) ... [2022-11-02 21:00:50,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:00:50,128 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:00:50,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:00:50,129 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:00:50,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:50" (1/1) ... [2022-11-02 21:00:50,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:00:50,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20d3b722-45b2-4819-9a80-93c5c3a0b59d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:00:50,164 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20d3b722-45b2-4819-9a80-93c5c3a0b59d/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:00:50,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20d3b722-45b2-4819-9a80-93c5c3a0b59d/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:00:50,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:00:50,209 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-11-02 21:00:50,209 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-11-02 21:00:50,210 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-11-02 21:00:50,210 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-11-02 21:00:50,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:00:50,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:00:50,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:00:50,283 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:00:50,286 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:00:50,589 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:00:50,604 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:00:50,604 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 21:00:50,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:00:50 BoogieIcfgContainer [2022-11-02 21:00:50,610 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:00:50,612 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:00:50,613 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:00:50,616 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:00:50,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:00:49" (1/3) ... [2022-11-02 21:00:50,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a8ab9f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:00:50, skipping insertion in model container [2022-11-02 21:00:50,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:50" (2/3) ... [2022-11-02 21:00:50,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a8ab9f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:00:50, skipping insertion in model container [2022-11-02 21:00:50,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:00:50" (3/3) ... [2022-11-02 21:00:50,621 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_3+newton_2_6.i [2022-11-02 21:00:50,640 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:00:50,640 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-02 21:00:50,716 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:00:50,732 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;@97b4228, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:00:50,734 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-02 21:00:50,741 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-02 21:00:50,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 21:00:50,750 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:50,751 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:00:50,752 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:00:50,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:50,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1709385323, now seen corresponding path program 1 times [2022-11-02 21:00:50,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:50,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529307164] [2022-11-02 21:00:50,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:50,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:50,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:51,192 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-02 21:00:51,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:51,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529307164] [2022-11-02 21:00:51,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529307164] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:00:51,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:00:51,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 21:00:51,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454912374] [2022-11-02 21:00:51,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:00:51,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 21:00:51,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:51,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 21:00:51,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:00:51,249 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-02 21:00:51,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:51,347 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2022-11-02 21:00:51,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 21:00:51,350 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-02 21:00:51,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:51,358 INFO L225 Difference]: With dead ends: 90 [2022-11-02 21:00:51,358 INFO L226 Difference]: Without dead ends: 36 [2022-11-02 21:00:51,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 21:00:51,366 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 23 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:51,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 119 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 21:00:51,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-02 21:00:51,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2022-11-02 21:00:51,411 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-02 21:00:51,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-11-02 21:00:51,416 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 11 [2022-11-02 21:00:51,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:51,417 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-11-02 21:00:51,417 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-02 21:00:51,417 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-11-02 21:00:51,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 21:00:51,419 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:51,420 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:00:51,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:00:51,420 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:00:51,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:51,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1776235347, now seen corresponding path program 1 times [2022-11-02 21:00:51,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:51,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200130438] [2022-11-02 21:00:51,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:51,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:51,630 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-02 21:00:51,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:51,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200130438] [2022-11-02 21:00:51,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200130438] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:00:51,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:00:51,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:00:51,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079371008] [2022-11-02 21:00:51,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:00:51,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:00:51,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:51,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:00:51,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:00:51,635 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-02 21:00:51,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:51,704 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-11-02 21:00:51,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 21:00:51,705 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-02 21:00:51,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:51,705 INFO L225 Difference]: With dead ends: 36 [2022-11-02 21:00:51,706 INFO L226 Difference]: Without dead ends: 30 [2022-11-02 21:00:51,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:00:51,707 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:51,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 130 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:00:51,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-02 21:00:51,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-02 21:00:51,713 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-02 21:00:51,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-11-02 21:00:51,714 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2022-11-02 21:00:51,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:51,715 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-11-02 21:00:51,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-02 21:00:51,715 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-11-02 21:00:51,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 21:00:51,716 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:51,716 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:00:51,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:00:51,717 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:00:51,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:51,718 INFO L85 PathProgramCache]: Analyzing trace with hash 830014046, now seen corresponding path program 1 times [2022-11-02 21:00:51,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:51,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191510624] [2022-11-02 21:00:51,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:51,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:51,729 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 21:00:51,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1393165352] [2022-11-02 21:00:51,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:51,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:00:51,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20d3b722-45b2-4819-9a80-93c5c3a0b59d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:00:51,732 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20d3b722-45b2-4819-9a80-93c5c3a0b59d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:00:51,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20d3b722-45b2-4819-9a80-93c5c3a0b59d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 21:00:51,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:51,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-02 21:00:51,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:01:13,148 WARN L234 SmtUtils]: Spent 17.92s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 21:01:31,455 WARN L234 SmtUtils]: Spent 9.15s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 21:01:54,090 WARN L234 SmtUtils]: Spent 13.53s on a formula simplification. DAG size of input: 40 DAG size of output: 32 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 21:02:08,178 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-02 21:02:08,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:02:23,956 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-02 21:02:23,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:23,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191510624] [2022-11-02 21:02:23,957 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 21:02:23,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393165352] [2022-11-02 21:02:23,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393165352] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:02:23,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 21:02:23,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2022-11-02 21:02:23,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790140798] [2022-11-02 21:02:23,959 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 21:02:23,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-02 21:02:23,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:23,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-02 21:02:23,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=202, Unknown=16, NotChecked=0, Total=272 [2022-11-02 21:02:23,961 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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-02 21:02:31,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:31,696 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-11-02 21:02:31,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 21:02:31,696 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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-02 21:02:31,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:31,698 INFO L225 Difference]: With dead ends: 42 [2022-11-02 21:02:31,698 INFO L226 Difference]: Without dead ends: 33 [2022-11-02 21:02:31,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 95.8s TimeCoverageRelationStatistics Valid=74, Invalid=250, Unknown=18, NotChecked=0, Total=342 [2022-11-02 21:02:31,700 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 5 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:31,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 231 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 19 Unchecked, 0.1s Time] [2022-11-02 21:02:31,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-02 21:02:31,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2022-11-02 21:02:31,708 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-02 21:02:31,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-11-02 21:02:31,709 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 12 [2022-11-02 21:02:31,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:31,710 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-11-02 21:02:31,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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-02 21:02:31,710 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-11-02 21:02:31,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:02:31,711 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:31,712 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:31,756 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20d3b722-45b2-4819-9a80-93c5c3a0b59d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 21:02:31,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20d3b722-45b2-4819-9a80-93c5c3a0b59d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:02:31,927 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:02:31,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:31,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1561924787, now seen corresponding path program 2 times [2022-11-02 21:02:31,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:31,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077060016] [2022-11-02 21:02:31,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:31,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:31,959 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 21:02:31,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [278251214] [2022-11-02 21:02:31,960 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:02:31,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:02:31,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20d3b722-45b2-4819-9a80-93c5c3a0b59d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:02:31,961 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20d3b722-45b2-4819-9a80-93c5c3a0b59d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:02:31,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20d3b722-45b2-4819-9a80-93c5c3a0b59d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 21:02:32,080 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:02:32,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:02:32,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-02 21:02:32,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:02:38,877 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (let ((.cse3 (< |c_ULTIMATE.start_gcd_test_~a#1| 0))) (let ((.cse8 (+ |c_ULTIMATE.start_gcd_test_~a#1| 256)) (.cse2 (not .cse3)) (.cse7 (+ |c_ULTIMATE.start_gcd_test_~b#1| 256)) (.cse4 (* |c_ULTIMATE.start_gcd_test_~a#1| 255))) (or (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse0 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse1 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256))) (and (= (mod .cse0 256) |c_ULTIMATE.start_gcd_test_~b#1|) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse1) (= 0 .cse0) (<= .cse1 127) (not (= |v_ULTIMATE.start_gcd_test_~a#1_13| 0))))) .cse2) (and .cse3 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse6 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256)) (.cse5 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (mod (+ .cse4 .cse5) 256) 127) (not (<= .cse6 127)) (= .cse7 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse5) 256)) (= .cse8 .cse6) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0) (not (= 0 .cse5)))))) (and .cse3 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse9 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse10 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256))) (and (= (mod .cse9 256) |c_ULTIMATE.start_gcd_test_~b#1|) (= 0 .cse9) (not (<= .cse10 127)) (not (= |v_ULTIMATE.start_gcd_test_~a#1_13| 0)) (= .cse8 .cse10))))) (and .cse3 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse11 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (not (<= .cse11 127)) (not (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0)) (not (= |v_ULTIMATE.start_gcd_test_~a#1_13| 0)) (= .cse8 .cse11))))) (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse13 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256)) (.cse12 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse12) 256) 127) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse13) (<= .cse13 127) (= .cse7 (mod (+ .cse4 .cse12) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0) (not (= 0 .cse12))))) .cse2) (and .cse3 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse14 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256)) (.cse15 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (not (<= .cse14 127)) (= .cse7 (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse15) 256)) (not (<= (mod (+ .cse4 .cse15) 256) 127)) (= .cse8 .cse14) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0) (not (= 0 .cse15)))))) (and .cse2 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse16 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256))) (and (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse16) (not (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0)) (<= .cse16 127) (not (= |v_ULTIMATE.start_gcd_test_~a#1_13| 0)))))) (and .cse2 (exists ((|v_ULTIMATE.start_gcd_test_~a#1_13| Int)) (let ((.cse17 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| |v_ULTIMATE.start_gcd_test_~a#1_13|) 256)) (.cse18 (mod |v_ULTIMATE.start_gcd_test_~a#1_13| |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| .cse17) (not (<= (mod (+ |c_ULTIMATE.start_gcd_test_~a#1| .cse18) 256) 127)) (<= .cse17 127) (= .cse7 (mod (+ .cse4 .cse18) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_13| 0)))))))) (not (< |c_ULTIMATE.start_main1_~x~0#1| 0))) is different from false [2022-11-02 21:02:58,664 WARN L234 SmtUtils]: Spent 5.22s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 21:03:01,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 21:03:01,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:03:25,866 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse6 (< |c_ULTIMATE.start_gcd_test_~a#1| 0))) (let ((.cse17 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse3 (not .cse6)) (.cse2 (+ |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse0 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse1 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse0) 256))) (or (< 127 (mod .cse0 256)) (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse0) 256) 127) (= .cse0 0) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse1) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse1) 256) 0)) (< .cse1 .cse2))))) .cse3) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse4 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse5 (mod .cse4 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse4) 256) 127)) (= |ULTIMATE.start_gcd_test_~b#1| 0) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse5) 256) 0)) (not (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse4) 256) 127)) (not (<= .cse5 127)) (< .cse5 .cse2))))) .cse6) (or .cse3 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse7 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse8 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse7) 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse7) 256) 127)) (= |ULTIMATE.start_gcd_test_~b#1| 0) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse8) 256) 0)) (not (<= .cse8 127)) (< .cse8 .cse2) (not (<= (mod .cse7 256) 127))))))) (or .cse3 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse9 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse10 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse9) 256))) (or (< 127 (mod .cse9 256)) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse10) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse9) 256)) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse10) 256) 0)) (< .cse10 .cse2)))))) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse12 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse11 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse12) 256))) (or (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse11) 256) 0)) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse12) 256) 127) (= .cse12 0) (not (<= .cse11 127)) (< .cse11 .cse2) (not (<= (mod .cse12 256) 127)))))) .cse3) (or .cse6 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse13 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse14 (mod .cse13 256))) (or (< |ULTIMATE.start_gcd_test_~b#1| 0) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse13) 256) 127) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse14) 256) 0)) (not (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse13) 256) 127)) (not (<= .cse14 127)) (< .cse14 .cse2)))))) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse16 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse15 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse16) 256))) (or (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse15) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse16) 256)) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse15) 256) 0)) (< .cse15 .cse2) (<= (mod .cse16 256) 127))))) .cse17) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse19 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse18 (mod .cse19 256))) (or (< 127 .cse18) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse19) 256)) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse18) 256) 0)) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse19) 256)) (< .cse18 .cse2))))) .cse6) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse21 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse21) 256))) (or (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse20) 256) 0)) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse21) 256) 127) (not (<= .cse20 127)) (< .cse20 .cse2) (<= (mod .cse21 256) 127))))) .cse3) (or .cse17 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse22 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse23 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse22) 256))) (or (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse22) 256) 127) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse23) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse23) 256) 0)) (< .cse23 .cse2) (<= (mod .cse22 256) 127)))))) (or .cse6 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse25 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse24 (mod .cse25 256))) (or (< 127 .cse24) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse25) 256) 127) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse24) 256) 0)) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse25) 256)) (< .cse24 .cse2)))))) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse26 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse27 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse26) 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse26) 256) 127)) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse27) 256) 0)) (not (<= .cse27 127)) (< .cse27 .cse2) (<= (mod .cse26 256) 127))))) .cse3) (or .cse6 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse28 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse29 (mod .cse28 256))) (or (< |ULTIMATE.start_gcd_test_~b#1| 0) (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse28) 256) 127) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse28) 256) 127) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse29) 256) 0)) (not (<= .cse29 127)) (< .cse29 .cse2)))))) (or .cse6 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse31 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse30 (mod .cse31 256))) (or (< 127 .cse30) (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse31) 256) 127) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse31) 256) 127) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse30) 256) 0)) (< .cse30 .cse2)))))) (or .cse6 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse32 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse33 (mod .cse32 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse32) 256) 127)) (< |ULTIMATE.start_gcd_test_~b#1| 0) (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse32) 256) 127) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse33) 256) 0)) (not (<= .cse33 127)) (< .cse33 .cse2)))))) (or .cse6 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse35 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse34 (mod .cse35 256))) (or (< 127 .cse34) (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse35) 256) 127) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse35) 256)) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse34) 256) 0)) (< .cse34 .cse2))))))))) (not (< 0 |c_ULTIMATE.start_main1_~x~0#1|))) is different from false [2022-11-02 21:03:27,889 WARN L855 $PredicateComparison]: unable to prove that (or (let ((.cse6 (< |c_ULTIMATE.start_gcd_test_~a#1| 0))) (let ((.cse17 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse3 (not .cse6)) (.cse2 (+ |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse0 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse1 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse0) 256))) (or (< 127 (mod .cse0 256)) (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse0) 256) 127) (= .cse0 0) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse1) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse1) 256) 0)) (< .cse1 .cse2))))) .cse3) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse4 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse5 (mod .cse4 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse4) 256) 127)) (= |ULTIMATE.start_gcd_test_~b#1| 0) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse5) 256) 0)) (not (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse4) 256) 127)) (not (<= .cse5 127)) (< .cse5 .cse2))))) .cse6) (or .cse3 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse7 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse8 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse7) 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse7) 256) 127)) (= |ULTIMATE.start_gcd_test_~b#1| 0) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse8) 256) 0)) (not (<= .cse8 127)) (< .cse8 .cse2) (not (<= (mod .cse7 256) 127))))))) (or .cse3 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse9 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse10 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse9) 256))) (or (< 127 (mod .cse9 256)) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse10) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse9) 256)) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse10) 256) 0)) (< .cse10 .cse2)))))) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse12 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse11 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse12) 256))) (or (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse11) 256) 0)) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse12) 256) 127) (= .cse12 0) (not (<= .cse11 127)) (< .cse11 .cse2) (not (<= (mod .cse12 256) 127)))))) .cse3) (or .cse6 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse13 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse14 (mod .cse13 256))) (or (< |ULTIMATE.start_gcd_test_~b#1| 0) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse13) 256) 127) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse14) 256) 0)) (not (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse13) 256) 127)) (not (<= .cse14 127)) (< .cse14 .cse2)))))) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse16 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse15 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse16) 256))) (or (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse15) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse16) 256)) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse15) 256) 0)) (< .cse15 .cse2) (<= (mod .cse16 256) 127))))) .cse17) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse19 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse18 (mod .cse19 256))) (or (< 127 .cse18) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse19) 256)) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse18) 256) 0)) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse19) 256)) (< .cse18 .cse2))))) .cse6) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse21 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse21) 256))) (or (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse20) 256) 0)) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse21) 256) 127) (not (<= .cse20 127)) (< .cse20 .cse2) (<= (mod .cse21 256) 127))))) .cse3) (or .cse17 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse22 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse23 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse22) 256))) (or (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse22) 256) 127) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse23) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse23) 256) 0)) (< .cse23 .cse2) (<= (mod .cse22 256) 127)))))) (or .cse6 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse25 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse24 (mod .cse25 256))) (or (< 127 .cse24) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse25) 256) 127) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse24) 256) 0)) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse25) 256)) (< .cse24 .cse2)))))) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse26 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse27 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse26) 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse26) 256) 127)) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse27) 256) 0)) (not (<= .cse27 127)) (< .cse27 .cse2) (<= (mod .cse26 256) 127))))) .cse3) (or .cse6 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse28 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse29 (mod .cse28 256))) (or (< |ULTIMATE.start_gcd_test_~b#1| 0) (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse28) 256) 127) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse28) 256) 127) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse29) 256) 0)) (not (<= .cse29 127)) (< .cse29 .cse2)))))) (or .cse6 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse31 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse30 (mod .cse31 256))) (or (< 127 .cse30) (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse31) 256) 127) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse31) 256) 127) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse30) 256) 0)) (< .cse30 .cse2)))))) (or .cse6 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse32 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse33 (mod .cse32 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse32) 256) 127)) (< |ULTIMATE.start_gcd_test_~b#1| 0) (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse32) 256) 127) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse33) 256) 0)) (not (<= .cse33 127)) (< .cse33 .cse2)))))) (or .cse6 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse35 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse34 (mod .cse35 256))) (or (< 127 .cse34) (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse35) 256) 127) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse35) 256)) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse34) 256) 0)) (< .cse34 .cse2))))))))) (not (< 0 |c_ULTIMATE.start_main1_~x~0#1|))) is different from true [2022-11-02 21:03:43,585 WARN L833 $PredicateComparison]: unable to prove that (or (< |c_ULTIMATE.start_gcd_test_~a#1| 0) (not (< 0 |c_ULTIMATE.start_main1_~x~0#1|)) (let ((.cse2 (+ |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse1 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse0 (mod .cse1 256))) (or (< 127 .cse0) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse1) 256)) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse0) 256) 0)) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse1) 256)) (< .cse0 .cse2))))) (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse3 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse4 (mod .cse3 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse3) 256) 127)) (= |ULTIMATE.start_gcd_test_~b#1| 0) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse4) 256) 0)) (not (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse3) 256) 127)) (not (<= .cse4 127)) (< .cse4 .cse2))))) (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse6 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse5 (mod .cse6 256))) (or (< 127 .cse5) (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse6) 256) 127) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse6) 256) 127) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse5) 256) 0)) (< .cse5 .cse2))))) (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse7 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse8 (mod .cse7 256))) (or (< |ULTIMATE.start_gcd_test_~b#1| 0) (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse7) 256) 127) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse7) 256) 127) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse8) 256) 0)) (not (<= .cse8 127)) (< .cse8 .cse2))))) (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse10 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse9 (mod .cse10 256))) (or (< 127 .cse9) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse10) 256) 127) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse9) 256) 0)) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse10) 256)) (< .cse9 .cse2))))) (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse11 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse12 (mod .cse11 256))) (or (< |ULTIMATE.start_gcd_test_~b#1| 0) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse11) 256) 127) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse12) 256) 0)) (not (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse11) 256) 127)) (not (<= .cse12 127)) (< .cse12 .cse2))))) (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse13 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse14 (mod .cse13 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse13) 256) 127)) (< |ULTIMATE.start_gcd_test_~b#1| 0) (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse13) 256) 127) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse14) 256) 0)) (not (<= .cse14 127)) (< .cse14 .cse2))))) (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse16 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse15 (mod .cse16 256))) (or (< 127 .cse15) (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse16) 256) 127) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse16) 256)) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse15) 256) 0)) (< .cse15 .cse2)))))))) is different from false [2022-11-02 21:03:45,596 WARN L855 $PredicateComparison]: unable to prove that (or (< |c_ULTIMATE.start_gcd_test_~a#1| 0) (not (< 0 |c_ULTIMATE.start_main1_~x~0#1|)) (let ((.cse2 (+ |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse1 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse0 (mod .cse1 256))) (or (< 127 .cse0) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse1) 256)) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse0) 256) 0)) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse1) 256)) (< .cse0 .cse2))))) (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse3 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse4 (mod .cse3 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse3) 256) 127)) (= |ULTIMATE.start_gcd_test_~b#1| 0) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse4) 256) 0)) (not (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse3) 256) 127)) (not (<= .cse4 127)) (< .cse4 .cse2))))) (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse6 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse5 (mod .cse6 256))) (or (< 127 .cse5) (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse6) 256) 127) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse6) 256) 127) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse5) 256) 0)) (< .cse5 .cse2))))) (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse7 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse8 (mod .cse7 256))) (or (< |ULTIMATE.start_gcd_test_~b#1| 0) (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse7) 256) 127) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse7) 256) 127) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse8) 256) 0)) (not (<= .cse8 127)) (< .cse8 .cse2))))) (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse10 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse9 (mod .cse10 256))) (or (< 127 .cse9) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse10) 256) 127) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse9) 256) 0)) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse10) 256)) (< .cse9 .cse2))))) (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse11 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse12 (mod .cse11 256))) (or (< |ULTIMATE.start_gcd_test_~b#1| 0) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse11) 256) 127) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse12) 256) 0)) (not (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse11) 256) 127)) (not (<= .cse12 127)) (< .cse12 .cse2))))) (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse13 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse14 (mod .cse13 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse13) 256) 127)) (< |ULTIMATE.start_gcd_test_~b#1| 0) (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse13) 256) 127) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse14) 256) 0)) (not (<= .cse14 127)) (< .cse14 .cse2))))) (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse16 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse15 (mod .cse16 256))) (or (< 127 .cse15) (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse16) 256) 127) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse16) 256)) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse15) 256) 0)) (< .cse15 .cse2)))))))) is different from true [2022-11-02 21:03:46,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 21:03:46,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:46,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077060016] [2022-11-02 21:03:46,236 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 21:03:46,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278251214] [2022-11-02 21:03:46,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278251214] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:03:46,236 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 21:03:46,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2022-11-02 21:03:46,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289200220] [2022-11-02 21:03:46,237 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 21:03:46,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-02 21:03:46,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:46,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-02 21:03:46,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=141, Unknown=7, NotChecked=78, Total=272 [2022-11-02 21:03:46,238 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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-02 21:03:48,302 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_main1_~x~0#1|) (or (< |c_ULTIMATE.start_gcd_test_~a#1| 0) (not (< 0 |c_ULTIMATE.start_main1_~x~0#1|)) (let ((.cse2 (+ |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse1 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse0 (mod .cse1 256))) (or (< 127 .cse0) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse1) 256)) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse0) 256) 0)) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse1) 256)) (< .cse0 .cse2))))) (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse3 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse4 (mod .cse3 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse3) 256) 127)) (= |ULTIMATE.start_gcd_test_~b#1| 0) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse4) 256) 0)) (not (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse3) 256) 127)) (not (<= .cse4 127)) (< .cse4 .cse2))))) (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse6 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse5 (mod .cse6 256))) (or (< 127 .cse5) (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse6) 256) 127) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse6) 256) 127) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse5) 256) 0)) (< .cse5 .cse2))))) (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse7 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse8 (mod .cse7 256))) (or (< |ULTIMATE.start_gcd_test_~b#1| 0) (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse7) 256) 127) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse7) 256) 127) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse8) 256) 0)) (not (<= .cse8 127)) (< .cse8 .cse2))))) (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse10 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse9 (mod .cse10 256))) (or (< 127 .cse9) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse10) 256) 127) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse9) 256) 0)) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse10) 256)) (< .cse9 .cse2))))) (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse11 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse12 (mod .cse11 256))) (or (< |ULTIMATE.start_gcd_test_~b#1| 0) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse11) 256) 127) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse12) 256) 0)) (not (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse11) 256) 127)) (not (<= .cse12 127)) (< .cse12 .cse2))))) (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse13 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse14 (mod .cse13 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse13) 256) 127)) (< |ULTIMATE.start_gcd_test_~b#1| 0) (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse13) 256) 127) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse14) 256) 0)) (not (<= .cse14 127)) (< .cse14 .cse2))))) (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse16 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse15 (mod .cse16 256))) (or (< 127 .cse15) (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse16) 256) 127) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse16) 256)) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse15) 256) 0)) (< .cse15 .cse2))))))))) is different from true [2022-11-02 21:03:50,328 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse6 (< |c_ULTIMATE.start_gcd_test_~a#1| 0))) (let ((.cse0 (not .cse6))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_main1_~x~0#1|) .cse0 (or (let ((.cse17 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse3 (+ |c_ULTIMATE.start_main1_~x~0#1| 1))) (and (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse1 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse2 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse1) 256))) (or (< 127 (mod .cse1 256)) (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse1) 256) 127) (= .cse1 0) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse2) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse2) 256) 0)) (< .cse2 .cse3))))) .cse0) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse4 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse5 (mod .cse4 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse4) 256) 127)) (= |ULTIMATE.start_gcd_test_~b#1| 0) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse5) 256) 0)) (not (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse4) 256) 127)) (not (<= .cse5 127)) (< .cse5 .cse3))))) .cse6) (or .cse0 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse7 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse8 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse7) 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse7) 256) 127)) (= |ULTIMATE.start_gcd_test_~b#1| 0) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse8) 256) 0)) (not (<= .cse8 127)) (< .cse8 .cse3) (not (<= (mod .cse7 256) 127))))))) (or .cse0 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse9 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse10 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse9) 256))) (or (< 127 (mod .cse9 256)) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse10) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse9) 256)) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse10) 256) 0)) (< .cse10 .cse3)))))) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse12 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse11 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse12) 256))) (or (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse11) 256) 0)) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse12) 256) 127) (= .cse12 0) (not (<= .cse11 127)) (< .cse11 .cse3) (not (<= (mod .cse12 256) 127)))))) .cse0) (or .cse6 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse13 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse14 (mod .cse13 256))) (or (< |ULTIMATE.start_gcd_test_~b#1| 0) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse13) 256) 127) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse14) 256) 0)) (not (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse13) 256) 127)) (not (<= .cse14 127)) (< .cse14 .cse3)))))) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse16 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse15 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse16) 256))) (or (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse15) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse16) 256)) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse15) 256) 0)) (< .cse15 .cse3) (<= (mod .cse16 256) 127))))) .cse17) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse19 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse18 (mod .cse19 256))) (or (< 127 .cse18) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse19) 256)) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse18) 256) 0)) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse19) 256)) (< .cse18 .cse3))))) .cse6) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse21 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse21) 256))) (or (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse20) 256) 0)) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse21) 256) 127) (not (<= .cse20 127)) (< .cse20 .cse3) (<= (mod .cse21 256) 127))))) .cse0) (or .cse17 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse22 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse23 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse22) 256))) (or (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse22) 256) 127) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 .cse23) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse23) 256) 0)) (< .cse23 .cse3) (<= (mod .cse22 256) 127)))))) (or .cse6 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse25 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse24 (mod .cse25 256))) (or (< 127 .cse24) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse25) 256) 127) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse24) 256) 0)) (< 127 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse25) 256)) (< .cse24 .cse3)))))) (or (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse26 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse27 (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse26) 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse26) 256) 127)) (< |ULTIMATE.start_gcd_test_~b#1| 0) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse27) 256) 0)) (not (<= .cse27 127)) (< .cse27 .cse3) (<= (mod .cse26 256) 127))))) .cse0) (or .cse6 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse28 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse29 (mod .cse28 256))) (or (< |ULTIMATE.start_gcd_test_~b#1| 0) (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse28) 256) 127) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse28) 256) 127) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse29) 256) 0)) (not (<= .cse29 127)) (< .cse29 .cse3)))))) (or .cse6 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse31 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse30 (mod .cse31 256))) (or (< 127 .cse30) (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse31) 256) 127) (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse31) 256) 127) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse30) 256) 0)) (< .cse30 .cse3)))))) (or .cse6 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse32 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse33 (mod .cse32 256))) (or (not (<= (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse32) 256) 127)) (< |ULTIMATE.start_gcd_test_~b#1| 0) (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse32) 256) 127) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse33) 256) 0)) (not (<= .cse33 127)) (< .cse33 .cse3)))))) (or .cse6 (forall ((|ULTIMATE.start_gcd_test_~b#1| Int)) (let ((.cse35 (mod |c_ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse34 (mod .cse35 256))) (or (< 127 .cse34) (<= (mod (+ (* |ULTIMATE.start_gcd_test_~b#1| 255) .cse35) 256) 127) (<= 0 |ULTIMATE.start_gcd_test_~b#1|) (< 127 (mod (+ |ULTIMATE.start_gcd_test_~b#1| .cse35) 256)) (not (= (mod (mod |ULTIMATE.start_gcd_test_~b#1| .cse34) 256) 0)) (< .cse34 .cse3)))))))) (not (< 0 |c_ULTIMATE.start_main1_~x~0#1|)))))) is different from true [2022-11-02 21:04:32,256 WARN L234 SmtUtils]: Spent 28.54s on a formula simplification. DAG size of input: 78 DAG size of output: 58 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 21:04:32,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:04:32,276 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-11-02 21:04:32,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 21:04:32,277 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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-02 21:04:32,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:04:32,277 INFO L225 Difference]: With dead ends: 44 [2022-11-02 21:04:32,278 INFO L226 Difference]: Without dead ends: 35 [2022-11-02 21:04:32,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 77.2s TimeCoverageRelationStatistics Valid=55, Invalid=163, Unknown=12, NotChecked=150, Total=380 [2022-11-02 21:04:32,279 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:04:32,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 210 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 70 Unchecked, 0.0s Time] [2022-11-02 21:04:32,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-02 21:04:32,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2022-11-02 21:04:32,290 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-02 21:04:32,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-11-02 21:04:32,291 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 13 [2022-11-02 21:04:32,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:04:32,291 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-11-02 21:04:32,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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-02 21:04:32,296 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-11-02 21:04:32,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 21:04:32,299 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:04:32,299 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:04:32,322 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20d3b722-45b2-4819-9a80-93c5c3a0b59d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 21:04:32,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20d3b722-45b2-4819-9a80-93c5c3a0b59d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:32,500 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 21:04:32,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:04:32,501 INFO L85 PathProgramCache]: Analyzing trace with hash -2052984139, now seen corresponding path program 1 times [2022-11-02 21:04:32,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:04:32,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302904292] [2022-11-02 21:04:32,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:32,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:04:32,508 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 21:04:32,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [147008528] [2022-11-02 21:04:32,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:04:32,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:04:32,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20d3b722-45b2-4819-9a80-93c5c3a0b59d/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:04:32,510 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20d3b722-45b2-4819-9a80-93c5c3a0b59d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:04:32,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_20d3b722-45b2-4819-9a80-93c5c3a0b59d/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 21:04:32,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:04:32,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-02 21:04:32,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:04:42,381 WARN L234 SmtUtils]: Spent 9.31s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)