./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_1+newton_3_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_1+newton_3_2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 29d96db4a6009ca50700370626b51b87675af883de25c8c867b510f89e0e2698 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 11:42:19,453 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:42:19,455 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:42:19,486 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:42:19,486 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:42:19,488 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:42:19,490 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:42:19,492 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:42:19,497 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:42:19,508 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:42:19,510 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:42:19,516 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:42:19,516 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:42:19,520 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:42:19,521 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:42:19,523 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:42:19,524 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:42:19,525 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:42:19,527 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:42:19,530 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:42:19,532 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:42:19,533 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:42:19,541 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:42:19,542 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:42:19,546 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:42:19,547 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:42:19,547 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:42:19,548 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:42:19,549 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:42:19,550 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:42:19,556 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:42:19,557 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:42:19,558 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:42:19,559 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:42:19,560 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:42:19,561 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:42:19,564 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:42:19,564 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:42:19,565 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:42:19,566 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:42:19,568 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:42:19,570 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 11:42:19,612 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:42:19,618 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:42:19,619 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:42:19,619 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:42:19,621 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:42:19,621 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:42:19,622 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:42:19,622 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:42:19,623 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:42:19,623 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:42:19,624 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:42:19,625 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:42:19,625 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:42:19,625 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:42:19,625 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:42:19,626 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:42:19,626 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:42:19,626 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:42:19,626 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:42:19,627 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:42:19,627 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:42:19,627 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:42:19,627 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:42:19,628 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:42:19,628 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:42:19,628 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:42:19,630 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:42:19,630 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:42:19,631 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:42:19,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:42:19,631 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:42:19,631 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:42:19,632 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:42:19,632 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_8065ea6f-1ab6-4d87-b270-dde3978e70aa/bin/uautomizer-tPACEb0tL8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 29d96db4a6009ca50700370626b51b87675af883de25c8c867b510f89e0e2698 [2022-11-16 11:42:20,021 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:42:20,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:42:20,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:42:20,054 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:42:20,055 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:42:20,057 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/combinations/gcd_1+newton_3_2.i [2022-11-16 11:42:20,139 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/bin/uautomizer-tPACEb0tL8/data/30669dfb2/87d6b4b43fcc4eff913432a67b757f8b/FLAGdb4a9ea4f [2022-11-16 11:42:20,761 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:42:20,762 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/sv-benchmarks/c/combinations/gcd_1+newton_3_2.i [2022-11-16 11:42:20,775 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/bin/uautomizer-tPACEb0tL8/data/30669dfb2/87d6b4b43fcc4eff913432a67b757f8b/FLAGdb4a9ea4f [2022-11-16 11:42:21,094 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/bin/uautomizer-tPACEb0tL8/data/30669dfb2/87d6b4b43fcc4eff913432a67b757f8b [2022-11-16 11:42:21,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:42:21,103 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:42:21,111 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:42:21,111 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:42:21,116 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:42:21,117 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:42:21" (1/1) ... [2022-11-16 11:42:21,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c3bcb47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:21, skipping insertion in model container [2022-11-16 11:42:21,121 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:42:21" (1/1) ... [2022-11-16 11:42:21,130 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:42:21,161 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:42:21,379 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/sv-benchmarks/c/combinations/gcd_1+newton_3_2.i[1226,1239] [2022-11-16 11:42:21,406 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/sv-benchmarks/c/combinations/gcd_1+newton_3_2.i[2828,2841] [2022-11-16 11:42:21,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:42:21,418 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:42:21,434 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/sv-benchmarks/c/combinations/gcd_1+newton_3_2.i[1226,1239] [2022-11-16 11:42:21,447 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/sv-benchmarks/c/combinations/gcd_1+newton_3_2.i[2828,2841] [2022-11-16 11:42:21,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:42:21,465 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:42:21,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:21 WrapperNode [2022-11-16 11:42:21,466 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:42:21,468 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:42:21,468 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:42:21,468 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:42:21,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:21" (1/1) ... [2022-11-16 11:42:21,499 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:21" (1/1) ... [2022-11-16 11:42:21,540 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 90 [2022-11-16 11:42:21,543 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:42:21,544 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:42:21,544 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:42:21,544 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:42:21,555 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:21" (1/1) ... [2022-11-16 11:42:21,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:21" (1/1) ... [2022-11-16 11:42:21,560 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:21" (1/1) ... [2022-11-16 11:42:21,560 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:21" (1/1) ... [2022-11-16 11:42:21,565 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:21" (1/1) ... [2022-11-16 11:42:21,576 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:21" (1/1) ... [2022-11-16 11:42:21,578 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:21" (1/1) ... [2022-11-16 11:42:21,579 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:21" (1/1) ... [2022-11-16 11:42:21,582 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:42:21,583 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:42:21,583 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:42:21,583 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:42:21,584 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:21" (1/1) ... [2022-11-16 11:42:21,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:42:21,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:42:21,632 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:42:21,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:42:21,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:42:21,683 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-11-16 11:42:21,683 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-11-16 11:42:21,683 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-11-16 11:42:21,686 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-11-16 11:42:21,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:42:21,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:42:21,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:42:21,797 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:42:21,800 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:42:22,204 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:42:22,226 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:42:22,226 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-16 11:42:22,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:42:22 BoogieIcfgContainer [2022-11-16 11:42:22,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:42:22,231 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:42:22,232 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:42:22,241 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:42:22,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:42:21" (1/3) ... [2022-11-16 11:42:22,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d2de089 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:42:22, skipping insertion in model container [2022-11-16 11:42:22,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:42:21" (2/3) ... [2022-11-16 11:42:22,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d2de089 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:42:22, skipping insertion in model container [2022-11-16 11:42:22,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:42:22" (3/3) ... [2022-11-16 11:42:22,247 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_1+newton_3_2.i [2022-11-16 11:42:22,270 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:42:22,270 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-16 11:42:22,382 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:42:22,392 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;@15921773, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:42:22,393 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-16 11:42:22,398 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:42:22,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 11:42:22,409 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:22,410 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:42:22,411 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:42:22,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:22,420 INFO L85 PathProgramCache]: Analyzing trace with hash -247750664, now seen corresponding path program 1 times [2022-11-16 11:42:22,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:22,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450345025] [2022-11-16 11:42:22,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:22,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:22,566 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 11:42:22,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1810919325] [2022-11-16 11:42:22,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:22,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:42:22,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:42:22,572 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:42:22,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 11:42:22,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:22,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-16 11:42:22,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:42:22,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:42:22,725 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:42:22,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:22,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450345025] [2022-11-16 11:42:22,726 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 11:42:22,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810919325] [2022-11-16 11:42:22,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810919325] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:22,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:22,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:42:22,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650806702] [2022-11-16 11:42:22,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:22,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:42:22,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:22,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:42:22,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:42:22,785 INFO L87 Difference]: Start difference. First operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:22,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:42:22,825 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2022-11-16 11:42:22,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:42:22,829 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-16 11:42:22,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:42:22,837 INFO L225 Difference]: With dead ends: 72 [2022-11-16 11:42:22,837 INFO L226 Difference]: Without dead ends: 32 [2022-11-16 11:42:22,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:42:22,845 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:42:22,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:42:22,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-11-16 11:42:22,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-11-16 11:42:22,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:42:22,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-11-16 11:42:22,895 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 11 [2022-11-16 11:42:22,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:42:22,896 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-11-16 11:42:22,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:22,897 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-11-16 11:42:22,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 11:42:22,898 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:22,898 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:42:22,905 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 11:42:23,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-11-16 11:42:23,105 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:42:23,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:23,108 INFO L85 PathProgramCache]: Analyzing trace with hash -251444748, now seen corresponding path program 1 times [2022-11-16 11:42:23,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:23,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929606359] [2022-11-16 11:42:23,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:23,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:23,148 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 11:42:23,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1306856096] [2022-11-16 11:42:23,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:23,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:42:23,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:42:23,155 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:42:23,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 11:42:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:23,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:42:23,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:42:23,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:42:23,347 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:42:23,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:23,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929606359] [2022-11-16 11:42:23,348 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 11:42:23,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306856096] [2022-11-16 11:42:23,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306856096] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:42:23,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:42:23,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:42:23,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602668459] [2022-11-16 11:42:23,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:42:23,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:42:23,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:23,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:42:23,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:42:23,361 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:23,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:42:23,404 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-11-16 11:42:23,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:42:23,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-16 11:42:23,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:42:23,407 INFO L225 Difference]: With dead ends: 39 [2022-11-16 11:42:23,407 INFO L226 Difference]: Without dead ends: 33 [2022-11-16 11:42:23,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:42:23,411 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:42:23,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 66 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:42:23,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-16 11:42:23,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-11-16 11:42:23,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:42:23,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2022-11-16 11:42:23,429 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 11 [2022-11-16 11:42:23,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:42:23,429 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2022-11-16 11:42:23,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:23,430 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-11-16 11:42:23,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 11:42:23,430 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:23,431 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:42:23,443 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 11:42:23,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:42:23,631 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:42:23,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:23,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1673157840, now seen corresponding path program 1 times [2022-11-16 11:42:23,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:23,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889571098] [2022-11-16 11:42:23,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:23,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:23,658 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 11:42:23,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1991399910] [2022-11-16 11:42:23,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:23,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:42:23,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:42:23,663 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:42:23,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 11:42:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:42:23,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-16 11:42:23,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:42:23,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:42:23,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:42:23,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:42:23,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:42:23,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889571098] [2022-11-16 11:42:23,906 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 11:42:23,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991399910] [2022-11-16 11:42:23,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991399910] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:42:23,911 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:42:23,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-11-16 11:42:23,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106997027] [2022-11-16 11:42:23,912 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:42:23,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:42:23,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:42:23,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:42:23,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:42:23,914 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:24,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:42:24,031 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-11-16 11:42:24,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:42:24,032 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-16 11:42:24,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:42:24,033 INFO L225 Difference]: With dead ends: 39 [2022-11-16 11:42:24,033 INFO L226 Difference]: Without dead ends: 34 [2022-11-16 11:42:24,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:42:24,035 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:42:24,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 185 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:42:24,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-16 11:42:24,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-11-16 11:42:24,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:42:24,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2022-11-16 11:42:24,046 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 12 [2022-11-16 11:42:24,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:42:24,047 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2022-11-16 11:42:24,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:42:24,047 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-11-16 11:42:24,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 11:42:24,048 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:42:24,048 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:42:24,060 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 11:42:24,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:42:24,249 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:42:24,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:42:24,250 INFO L85 PathProgramCache]: Analyzing trace with hash -276630798, now seen corresponding path program 2 times [2022-11-16 11:42:24,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:42:24,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146291758] [2022-11-16 11:42:24,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:42:24,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:42:24,272 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 11:42:24,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [461284364] [2022-11-16 11:42:24,276 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:42:24,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:42:24,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:42:24,278 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:42:24,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 11:42:35,228 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:42:35,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:42:35,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-16 11:42:35,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:43:26,726 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (< 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~a#1_14|) 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256) |v_ULTIMATE.start_gcd_test_~a#1_14|) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0))) (not (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2022-11-16 11:43:45,419 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (< 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~a#1_14|) 0) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256) |v_ULTIMATE.start_gcd_test_~a#1_14|) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0))) (not (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2022-11-16 11:44:07,439 WARN L833 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse0 (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256) |v_ULTIMATE.start_gcd_test_~a#1_14|) 256))) (and (= .cse0 |c_ULTIMATE.start_gcd_test_#res#1|) (< 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse0) 256) 0) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~a#1_14|) 0) (not (= .cse0 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))) is different from false [2022-11-16 11:44:26,861 WARN L833 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse0 (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256) |v_ULTIMATE.start_gcd_test_~a#1_14|) 256))) (and (< 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse0) 256) 0) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~a#1_14|) 0) (not (= .cse0 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))) is different from false [2022-11-16 11:44:28,864 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse0 (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256) |v_ULTIMATE.start_gcd_test_~a#1_14|) 256))) (and (< 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse0) 256) 0) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~a#1_14|) 0) (not (= .cse0 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))) is different from true [2022-11-16 11:44:45,425 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-16 11:44:45,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:45:44,744 WARN L855 $PredicateComparison]: unable to prove that (or (let ((.cse27 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse18 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse28 (mod (+ .cse27 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse29 (mod (+ .cse27 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse9 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse13 (<= .cse29 127)) (.cse23 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse28) 256) 0))) (.cse8 (not .cse18)) (.cse25 (= .cse28 0)) (.cse2 (<= .cse28 127)) (.cse17 (mod .cse27 256))) (let ((.cse19 (<= .cse17 127)) (.cse12 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse29)) 256) 0))) (.cse3 (not .cse2)) (.cse15 (or .cse23 .cse8 .cse25)) (.cse6 (= .cse29 0)) (.cse7 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse29) 256) 0))) (.cse10 (not .cse13)) (.cse14 (not .cse9)) (.cse16 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse28)) 256) 0)))) (and (or (let ((.cse5 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse17)) 256) 0)) .cse18))) (let ((.cse1 (or .cse14 (and (or .cse16 .cse8) .cse5))) (.cse4 (or .cse14 (and .cse5 .cse15)))) (and (or (let ((.cse0 (or (and .cse5 (or .cse6 .cse7 .cse8)) .cse9))) (and (or (and .cse0 .cse1) .cse2) (or .cse3 (and .cse4 .cse0)))) .cse10) (or (let ((.cse11 (or .cse9 (and (or .cse12 .cse8) .cse5)))) (and (or (and .cse1 .cse11) .cse2) (or (and .cse4 .cse11) .cse3))) .cse13)))) .cse19) (or (not .cse19) (let ((.cse22 (or .cse18 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse17) 256) 0)) (= .cse17 0))) (.cse24 (= .cse27 0))) (let ((.cse21 (or .cse14 (and .cse22 (or .cse24 .cse16 .cse8))))) (and (or (let ((.cse20 (or (and (or .cse24 .cse12 .cse8) .cse22) .cse9))) (and (or .cse2 (and .cse20 .cse21)) (or (and (or .cse14 (and .cse22 (or .cse23 .cse24 .cse8 .cse25))) .cse20) .cse3))) .cse13) (or (let ((.cse26 (or .cse9 (and .cse22 (or .cse24 .cse6 .cse7 .cse8))))) (and (or .cse3 (and (or .cse14 (and .cse22 .cse15)) .cse26)) (or (and .cse26 .cse21) .cse2))) .cse10)))))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) is different from true [2022-11-16 11:47:18,896 WARN L233 SmtUtils]: Spent 1.01m on a formula simplification. DAG size of input: 67 DAG size of output: 61 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:47:40,830 WARN L233 SmtUtils]: Spent 8.57s 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) [2022-11-16 11:48:45,827 WARN L233 SmtUtils]: Spent 30.17s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:49:31,373 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main1_~y~0#1_6| Int) (|v_ULTIMATE.start_main1_~x~0#1_5| Int)) (let ((.cse0 (mod (mod (mod (* 255 |v_ULTIMATE.start_main1_~x~0#1_5|) 256) |v_ULTIMATE.start_main1_~y~0#1_6|) 256))) (or (= .cse0 0) (not (= 0 (mod |v_ULTIMATE.start_main1_~x~0#1_5| |v_ULTIMATE.start_main1_~y~0#1_6|))) (<= 0 |v_ULTIMATE.start_main1_~x~0#1_5|) (not (= (mod (mod |v_ULTIMATE.start_main1_~y~0#1_6| .cse0) 256) 0)) (< (+ 128 |v_ULTIMATE.start_main1_~x~0#1_5|) 0) (<= |v_ULTIMATE.start_main1_~y~0#1_6| 0)))) is different from false [2022-11-16 11:49:33,376 WARN L855 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main1_~y~0#1_6| Int) (|v_ULTIMATE.start_main1_~x~0#1_5| Int)) (let ((.cse0 (mod (mod (mod (* 255 |v_ULTIMATE.start_main1_~x~0#1_5|) 256) |v_ULTIMATE.start_main1_~y~0#1_6|) 256))) (or (= .cse0 0) (not (= 0 (mod |v_ULTIMATE.start_main1_~x~0#1_5| |v_ULTIMATE.start_main1_~y~0#1_6|))) (<= 0 |v_ULTIMATE.start_main1_~x~0#1_5|) (not (= (mod (mod |v_ULTIMATE.start_main1_~y~0#1_6| .cse0) 256) 0)) (< (+ 128 |v_ULTIMATE.start_main1_~x~0#1_5|) 0) (<= |v_ULTIMATE.start_main1_~y~0#1_6| 0)))) is different from true [2022-11-16 11:49:50,119 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-16 11:49:50,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:49:50,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146291758] [2022-11-16 11:49:50,120 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 11:49:50,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461284364] [2022-11-16 11:49:50,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461284364] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:49:50,120 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:49:50,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 19 [2022-11-16 11:49:50,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134134563] [2022-11-16 11:49:50,121 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:49:50,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-16 11:49:50,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:49:50,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-16 11:49:50,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=121, Unknown=18, NotChecked=162, Total=342 [2022-11-16 11:49:50,122 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:50:40,853 WARN L233 SmtUtils]: Spent 44.73s on a formula simplification. DAG size of input: 45 DAG size of output: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:50:42,957 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main1_~x~0#1| 127) (= (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|) 0) (<= |c_ULTIMATE.start_gcd_test_~a#1| 127) (<= |c_ULTIMATE.start_gcd_test_~b#1| 127) (<= 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 128)) (<= 0 (+ 128 |c_ULTIMATE.start_main1_~x~0#1|)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (or (let ((.cse2 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (let ((.cse0 (<= .cse2 127))) (and (let ((.cse1 (mod (mod .cse2 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (not .cse0) (= 0 .cse1) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse1) 256) 0)))) (let ((.cse3 (mod (+ .cse2 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse3 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) 256) 0)) .cse0 (= .cse3 0)))))) (< |c_ULTIMATE.start_gcd_test_~b#1| 0) (not (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (< 0 |c_ULTIMATE.start_gcd_test_~b#1|) (or (not (= (mod |c_ULTIMATE.start_main1_~x~0#1| |c_ULTIMATE.start_main1_~y~0#1|) 0)) (let ((.cse6 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse5 (<= .cse6 127))) (and (let ((.cse4 (mod (+ .cse6 (- 256)) |c_ULTIMATE.start_main1_~y~0#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| (+ (- 256) (mod (+ .cse4 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) 256))) 256) 0)) .cse5 (= .cse4 0))) (let ((.cse7 (mod (mod .cse6 |c_ULTIMATE.start_main1_~y~0#1|) 256))) (or (not .cse5) (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse7) 256) 0)) (= .cse7 0)))))) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|)) (<= 0 |c_ULTIMATE.start_main1_~x~0#1|))) is different from false [2022-11-16 11:50:44,961 WARN L855 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main1_~x~0#1| 127) (= (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|) 0) (<= |c_ULTIMATE.start_gcd_test_~a#1| 127) (<= |c_ULTIMATE.start_gcd_test_~b#1| 127) (<= 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 128)) (<= 0 (+ 128 |c_ULTIMATE.start_main1_~x~0#1|)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (or (let ((.cse2 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (let ((.cse0 (<= .cse2 127))) (and (let ((.cse1 (mod (mod .cse2 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (not .cse0) (= 0 .cse1) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse1) 256) 0)))) (let ((.cse3 (mod (+ .cse2 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse3 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) 256) 0)) .cse0 (= .cse3 0)))))) (< |c_ULTIMATE.start_gcd_test_~b#1| 0) (not (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (< 0 |c_ULTIMATE.start_gcd_test_~b#1|) (or (not (= (mod |c_ULTIMATE.start_main1_~x~0#1| |c_ULTIMATE.start_main1_~y~0#1|) 0)) (let ((.cse6 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse5 (<= .cse6 127))) (and (let ((.cse4 (mod (+ .cse6 (- 256)) |c_ULTIMATE.start_main1_~y~0#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| (+ (- 256) (mod (+ .cse4 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) 256))) 256) 0)) .cse5 (= .cse4 0))) (let ((.cse7 (mod (mod .cse6 |c_ULTIMATE.start_main1_~y~0#1|) 256))) (or (not .cse5) (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse7) 256) 0)) (= .cse7 0)))))) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|)) (<= 0 |c_ULTIMATE.start_main1_~x~0#1|))) is different from true [2022-11-16 11:50:46,970 WARN L833 $PredicateComparison]: unable to prove that (and (or (let ((.cse12 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse13 (mod (+ .cse12 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse1 (<= .cse13 127)) (.cse9 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse8 (mod .cse12 256))) (let ((.cse0 (<= .cse8 127)) (.cse2 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse13)) 256) 0))) (.cse5 (= .cse13 0)) (.cse6 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse13) 256) 0))) (.cse3 (not .cse9)) (.cse7 (not .cse1))) (and (or .cse0 (let ((.cse4 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse8)) 256) 0)) .cse9))) (and (or .cse1 (and (or .cse2 .cse3) .cse4)) (or (and .cse4 (or .cse5 .cse6 .cse3)) .cse7)))) (or (not .cse0) (let ((.cse11 (or .cse9 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse8) 256) 0)) (= .cse8 0))) (.cse10 (= .cse12 0))) (and (or (and (or .cse10 .cse2 .cse3) .cse11) .cse1) (or (and .cse11 (or .cse10 .cse5 .cse6 .cse3)) .cse7))))))))) (< |c_ULTIMATE.start_gcd_test_~b#1| 0) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (<= |c_ULTIMATE.start_gcd_test_~b#1| 127) (< 0 |c_ULTIMATE.start_gcd_test_~b#1|) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (let ((.cse14 (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256))) (and (<= .cse14 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |c_ULTIMATE.start_gcd_test_~b#1|) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse14) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (let ((.cse15 (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256))) (and (not (<= .cse15 127)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |c_ULTIMATE.start_gcd_test_~b#1|) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= (+ |c_ULTIMATE.start_gcd_test_~a#1| 256) .cse15) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))))) is different from false [2022-11-16 11:50:49,558 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_gcd_test_~b#1| 127) (or (let ((.cse27 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse18 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse28 (mod (+ .cse27 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse29 (mod (+ .cse27 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse9 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse13 (<= .cse29 127)) (.cse23 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse28) 256) 0))) (.cse8 (not .cse18)) (.cse25 (= .cse28 0)) (.cse2 (<= .cse28 127)) (.cse17 (mod .cse27 256))) (let ((.cse19 (<= .cse17 127)) (.cse12 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse29)) 256) 0))) (.cse3 (not .cse2)) (.cse15 (or .cse23 .cse8 .cse25)) (.cse6 (= .cse29 0)) (.cse7 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse29) 256) 0))) (.cse10 (not .cse13)) (.cse14 (not .cse9)) (.cse16 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse28)) 256) 0)))) (and (or (let ((.cse5 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse17)) 256) 0)) .cse18))) (let ((.cse1 (or .cse14 (and (or .cse16 .cse8) .cse5))) (.cse4 (or .cse14 (and .cse5 .cse15)))) (and (or (let ((.cse0 (or (and .cse5 (or .cse6 .cse7 .cse8)) .cse9))) (and (or (and .cse0 .cse1) .cse2) (or .cse3 (and .cse4 .cse0)))) .cse10) (or (let ((.cse11 (or .cse9 (and (or .cse12 .cse8) .cse5)))) (and (or (and .cse1 .cse11) .cse2) (or (and .cse4 .cse11) .cse3))) .cse13)))) .cse19) (or (not .cse19) (let ((.cse22 (or .cse18 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse17) 256) 0)) (= .cse17 0))) (.cse24 (= .cse27 0))) (let ((.cse21 (or .cse14 (and .cse22 (or .cse24 .cse16 .cse8))))) (and (or (let ((.cse20 (or (and (or .cse24 .cse12 .cse8) .cse22) .cse9))) (and (or .cse2 (and .cse20 .cse21)) (or (and (or .cse14 (and .cse22 (or .cse23 .cse24 .cse8 .cse25))) .cse20) .cse3))) .cse13) (or (let ((.cse26 (or .cse9 (and .cse22 (or .cse24 .cse6 .cse7 .cse8))))) (and (or .cse3 (and (or .cse14 (and .cse22 .cse15)) .cse26)) (or (and .cse26 .cse21) .cse2))) .cse10)))))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (< 0 |c_ULTIMATE.start_gcd_test_~b#1|) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (let ((.cse30 (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256))) (and (<= .cse30 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |c_ULTIMATE.start_gcd_test_~b#1|) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse30) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (let ((.cse31 (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256))) (and (not (<= .cse31 127)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |c_ULTIMATE.start_gcd_test_~b#1|) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= (+ |c_ULTIMATE.start_gcd_test_~a#1| 256) .cse31) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))))) is different from false [2022-11-16 11:50:51,563 WARN L855 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_gcd_test_~b#1| 127) (or (let ((.cse27 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse18 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse28 (mod (+ .cse27 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse29 (mod (+ .cse27 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse9 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse13 (<= .cse29 127)) (.cse23 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse28) 256) 0))) (.cse8 (not .cse18)) (.cse25 (= .cse28 0)) (.cse2 (<= .cse28 127)) (.cse17 (mod .cse27 256))) (let ((.cse19 (<= .cse17 127)) (.cse12 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse29)) 256) 0))) (.cse3 (not .cse2)) (.cse15 (or .cse23 .cse8 .cse25)) (.cse6 (= .cse29 0)) (.cse7 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse29) 256) 0))) (.cse10 (not .cse13)) (.cse14 (not .cse9)) (.cse16 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse28)) 256) 0)))) (and (or (let ((.cse5 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse17)) 256) 0)) .cse18))) (let ((.cse1 (or .cse14 (and (or .cse16 .cse8) .cse5))) (.cse4 (or .cse14 (and .cse5 .cse15)))) (and (or (let ((.cse0 (or (and .cse5 (or .cse6 .cse7 .cse8)) .cse9))) (and (or (and .cse0 .cse1) .cse2) (or .cse3 (and .cse4 .cse0)))) .cse10) (or (let ((.cse11 (or .cse9 (and (or .cse12 .cse8) .cse5)))) (and (or (and .cse1 .cse11) .cse2) (or (and .cse4 .cse11) .cse3))) .cse13)))) .cse19) (or (not .cse19) (let ((.cse22 (or .cse18 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse17) 256) 0)) (= .cse17 0))) (.cse24 (= .cse27 0))) (let ((.cse21 (or .cse14 (and .cse22 (or .cse24 .cse16 .cse8))))) (and (or (let ((.cse20 (or (and (or .cse24 .cse12 .cse8) .cse22) .cse9))) (and (or .cse2 (and .cse20 .cse21)) (or (and (or .cse14 (and .cse22 (or .cse23 .cse24 .cse8 .cse25))) .cse20) .cse3))) .cse13) (or (let ((.cse26 (or .cse9 (and .cse22 (or .cse24 .cse6 .cse7 .cse8))))) (and (or .cse3 (and (or .cse14 (and .cse22 .cse15)) .cse26)) (or (and .cse26 .cse21) .cse2))) .cse10)))))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (< 0 |c_ULTIMATE.start_gcd_test_~b#1|) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (let ((.cse30 (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256))) (and (<= .cse30 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |c_ULTIMATE.start_gcd_test_~b#1|) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse30) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (let ((.cse31 (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256))) (and (not (<= .cse31 127)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |c_ULTIMATE.start_gcd_test_~b#1|) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= (+ |c_ULTIMATE.start_gcd_test_~a#1| 256) .cse31) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))))) is different from true [2022-11-16 11:51:48,427 WARN L233 SmtUtils]: Spent 48.79s on a formula simplification. DAG size of input: 45 DAG size of output: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:51:50,433 WARN L833 $PredicateComparison]: unable to prove that (and (or (not (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (not (<= |c_ULTIMATE.start_gcd_test_~a#1| 127)) (not (<= 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 128)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (< 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~a#1_14|) 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256) |v_ULTIMATE.start_gcd_test_~a#1_14|) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0))) (not (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2022-11-16 11:51:52,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-16 11:51:52,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:51:52,676 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-11-16 11:51:52,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:51:52,679 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-16 11:51:52,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:51:52,681 INFO L225 Difference]: With dead ends: 43 [2022-11-16 11:51:52,681 INFO L226 Difference]: Without dead ends: 38 [2022-11-16 11:51:52,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 287.2s TimeCoverageRelationStatistics Valid=58, Invalid=166, Unknown=26, NotChecked=350, Total=600 [2022-11-16 11:51:52,683 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:51:52,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 404 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 1 Unknown, 105 Unchecked, 2.3s Time] [2022-11-16 11:51:52,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-16 11:51:52,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2022-11-16 11:51:52,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:51:52,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-11-16 11:51:52,702 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 13 [2022-11-16 11:51:52,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:51:52,704 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-11-16 11:51:52,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:51:52,705 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-11-16 11:51:52,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 11:51:52,706 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:51:52,706 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:51:52,714 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-16 11:51:52,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:51:52,907 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:51:52,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:52,907 INFO L85 PathProgramCache]: Analyzing trace with hash 403427572, now seen corresponding path program 1 times [2022-11-16 11:51:52,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:52,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999865052] [2022-11-16 11:51:52,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:52,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:52,919 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 11:51:52,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1383560243] [2022-11-16 11:51:52,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:52,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:51:52,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:51:52,921 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:51:52,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 11:51:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:53,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-16 11:51:53,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:51:53,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:51:53,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:52:38,851 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse27 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse16 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse28 (mod (+ .cse27 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse29 (mod (+ .cse27 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse5 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse9 (<= .cse29 127)) (.cse3 (<= .cse28 127)) (.cse22 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse28) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|)))) (.cse24 (= .cse28 0)) (.cse25 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse29) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|)))) (.cse26 (= .cse29 0)) (.cse12 (not .cse16)) (.cse17 (mod .cse27 256))) (let ((.cse18 (<= .cse17 127)) (.cse11 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse29)) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|)))) (.cse6 (or .cse25 .cse26 .cse12)) (.cse14 (or .cse22 .cse12 .cse24)) (.cse0 (not .cse3)) (.cse8 (not .cse9)) (.cse13 (not .cse5)) (.cse15 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse28)) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))))) (and (or (let ((.cse7 (or .cse16 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| (+ (- 256) .cse17)) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|)))))) (let ((.cse4 (or (and .cse7 (or .cse15 .cse12)) .cse13)) (.cse2 (or .cse13 (and .cse14 .cse7)))) (and (or (let ((.cse1 (or .cse5 (and .cse6 .cse7)))) (and (or .cse0 (and .cse1 .cse2)) (or .cse3 (and .cse4 .cse1)))) .cse8) (or .cse9 (let ((.cse10 (or .cse5 (and (or .cse11 .cse12) .cse7)))) (and (or (and .cse4 .cse10) .cse3) (or .cse0 (and .cse10 .cse2)))))))) .cse18) (or (not .cse18) (let ((.cse21 (or .cse16 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_21| Int)) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_21| .cse17) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_21| |c_ULTIMATE.start_gcd_test_~b#1|))) (= .cse17 0))) (.cse23 (= .cse27 0))) (let ((.cse20 (or .cse13 (and .cse21 (or .cse23 .cse15 .cse12))))) (and (or (let ((.cse19 (or .cse5 (and .cse21 (or .cse23 .cse11 .cse12))))) (and (or .cse3 (and .cse19 .cse20)) (or .cse0 (and (or (and .cse21 (or .cse22 .cse23 .cse12 .cse24)) .cse13) .cse19)))) .cse9) (or (and (or (and .cse20 (or .cse5 (and (or .cse23 .cse25 .cse26 .cse12) .cse21))) .cse3) (or (and (or (and .cse6 .cse21) .cse5) (or .cse13 (and .cse21 .cse14))) .cse0)) .cse8)))))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) is different from false [2022-11-16 11:54:01,966 WARN L233 SmtUtils]: Spent 1.19m on a formula simplification. DAG size of input: 62 DAG size of output: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:54:01,988 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-16 11:54:01,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:01,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999865052] [2022-11-16 11:54:01,989 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 11:54:01,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383560243] [2022-11-16 11:54:01,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383560243] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:54:01,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:54:01,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2022-11-16 11:54:01,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915481387] [2022-11-16 11:54:01,990 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:54:01,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 11:54:01,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:54:01,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 11:54:01,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=37, Unknown=1, NotChecked=12, Total=72 [2022-11-16 11:54:01,992 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:02,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:54:02,394 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-11-16 11:54:02,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:54:02,395 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-16 11:54:02,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:54:02,396 INFO L225 Difference]: With dead ends: 44 [2022-11-16 11:54:02,397 INFO L226 Difference]: Without dead ends: 35 [2022-11-16 11:54:02,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 75.4s TimeCoverageRelationStatistics Valid=22, Invalid=37, Unknown=1, NotChecked=12, Total=72 [2022-11-16 11:54:02,398 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 8 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:54:02,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 176 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 18 Unchecked, 0.2s Time] [2022-11-16 11:54:02,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-16 11:54:02,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-11-16 11:54:02,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 11:54:02,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-11-16 11:54:02,409 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 13 [2022-11-16 11:54:02,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:54:02,409 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-11-16 11:54:02,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:54:02,410 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-11-16 11:54:02,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 11:54:02,411 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:54:02,411 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:54:02,419 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 11:54:02,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:54:02,618 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:54:02,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:02,619 INFO L85 PathProgramCache]: Analyzing trace with hash 66034544, now seen corresponding path program 3 times [2022-11-16 11:54:02,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:02,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894048354] [2022-11-16 11:54:02,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:02,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:02,629 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 11:54:02,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [86021709] [2022-11-16 11:54:02,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 11:54:02,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:54:02,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:54:02,645 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:54:02,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8065ea6f-1ab6-4d87-b270-dde3978e70aa/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 11:54:22,311 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-16 11:54:22,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:54:22,316 WARN L261 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-16 11:54:22,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:54:35,921 WARN L233 SmtUtils]: Spent 6.10s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:54:52,006 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_23|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_23|) 256) |c_ULTIMATE.start_main1_~y~0#1|) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_23| 0))) (< 0 |c_ULTIMATE.start_main1_~y~0#1|) (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2022-11-16 11:55:21,910 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse0 (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_23|) 256) |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse1 (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse0) 256))) (and (not (= .cse0 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_23|)) (not (= .cse1 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse0 .cse1) 256)) (= .cse1 |c_ULTIMATE.start_gcd_test_~a#1|) (< |v_ULTIMATE.start_gcd_test_~a#1_23| 0))))) (< 0 |c_ULTIMATE.start_main1_~y~0#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| 127)) is different from false [2022-11-16 11:55:45,665 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse0 (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_23|) 256) |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse1 (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse0) 256))) (and (not (= .cse0 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_23|)) (= (mod (mod .cse0 .cse1) 256) 0) (not (= .cse1 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 0) (= .cse1 |c_ULTIMATE.start_gcd_test_~a#1|) (< |v_ULTIMATE.start_gcd_test_~a#1_23| 0))))) (< 0 |c_ULTIMATE.start_main1_~y~0#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| 127)) is different from false [2022-11-16 11:56:09,926 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse0 (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_23|) 256) |c_ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse1 (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse0) 256))) (and (not (= .cse0 0)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_23|)) (= (mod (mod .cse0 .cse1) 256) 0) (not (= .cse1 0)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |c_ULTIMATE.start_main1_~y~0#1|) 0) (= .cse1 |c_ULTIMATE.start_gcd_test_#res#1|) (< |v_ULTIMATE.start_gcd_test_~a#1_23| 0))))) (< 0 |c_ULTIMATE.start_main1_~y~0#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| 127)) is different from false [2022-11-16 11:56:45,862 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main1_~y~0#1| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse0 (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_23|) 256) |ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse1 (mod (mod |ULTIMATE.start_main1_~y~0#1| .cse0) 256))) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_23|)) (= (mod (mod .cse0 .cse1) 256) 0) (< 0 |ULTIMATE.start_main1_~y~0#1|) (not (= .cse1 0)) (not (= .cse0 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_23| 0) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |ULTIMATE.start_main1_~y~0#1|) 0))))) (<= 0 |c_ULTIMATE.start___VERIFIER_assert_~cond#1|)) is different from false [2022-11-16 11:57:11,731 WARN L833 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main1_~y~0#1| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse0 (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_23|) 256) |ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse1 (mod (mod |ULTIMATE.start_main1_~y~0#1| .cse0) 256))) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_23|)) (= (mod (mod .cse0 .cse1) 256) 0) (< 0 |ULTIMATE.start_main1_~y~0#1|) (not (= .cse1 0)) (not (= .cse0 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_23| 0) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |ULTIMATE.start_main1_~y~0#1|) 0))))) is different from false [2022-11-16 11:57:13,735 WARN L855 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main1_~y~0#1| Int) (|v_ULTIMATE.start_gcd_test_~a#1_23| Int)) (let ((.cse0 (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_23|) 256) |ULTIMATE.start_main1_~y~0#1|) 256))) (let ((.cse1 (mod (mod |ULTIMATE.start_main1_~y~0#1| .cse0) 256))) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_23|)) (= (mod (mod .cse0 .cse1) 256) 0) (< 0 |ULTIMATE.start_main1_~y~0#1|) (not (= .cse1 0)) (not (= .cse0 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_23| 0) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_23| |ULTIMATE.start_main1_~y~0#1|) 0))))) is different from true [2022-11-16 11:57:13,735 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-16 11:57:13,735 INFO L328 TraceCheckSpWp]: Computing backward predicates...