./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/bitvector/gcd_3_true-unreach-call_true-no-overflow.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d3bd7b1f-edc4-45c5-8f5a-9236492060b3/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d3bd7b1f-edc4-45c5-8f5a-9236492060b3/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d3bd7b1f-edc4-45c5-8f5a-9236492060b3/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d3bd7b1f-edc4-45c5-8f5a-9236492060b3/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/gcd_3_true-unreach-call_true-no-overflow.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d3bd7b1f-edc4-45c5-8f5a-9236492060b3/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d3bd7b1f-edc4-45c5-8f5a-9236492060b3/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 02e9294118e002d2445af62127a7232f85fd6228 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d3bd7b1f-edc4-45c5-8f5a-9236492060b3/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d3bd7b1f-edc4-45c5-8f5a-9236492060b3/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d3bd7b1f-edc4-45c5-8f5a-9236492060b3/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d3bd7b1f-edc4-45c5-8f5a-9236492060b3/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/bitvector/gcd_3_true-unreach-call_true-no-overflow.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d3bd7b1f-edc4-45c5-8f5a-9236492060b3/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d3bd7b1f-edc4-45c5-8f5a-9236492060b3/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 02e9294118e002d2445af62127a7232f85fd6228 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 00:11:34,643 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 00:11:34,644 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 00:11:34,657 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 00:11:34,658 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 00:11:34,658 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 00:11:34,659 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 00:11:34,661 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 00:11:34,662 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 00:11:34,663 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 00:11:34,663 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 00:11:34,663 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 00:11:34,664 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 00:11:34,665 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 00:11:34,666 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 00:11:34,666 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 00:11:34,667 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 00:11:34,668 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 00:11:34,669 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 00:11:34,670 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 00:11:34,671 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 00:11:34,672 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 00:11:34,674 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 00:11:34,674 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 00:11:34,674 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 00:11:34,675 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 00:11:34,676 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 00:11:34,676 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 00:11:34,677 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 00:11:34,678 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 00:11:34,678 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 00:11:34,679 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 00:11:34,679 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 00:11:34,679 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 00:11:34,680 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 00:11:34,680 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 00:11:34,680 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d3bd7b1f-edc4-45c5-8f5a-9236492060b3/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-27 00:11:34,698 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 00:11:34,699 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 00:11:34,700 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 00:11:34,700 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 00:11:34,700 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 00:11:34,701 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 00:11:34,701 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 00:11:34,701 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 00:11:34,701 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 00:11:34,701 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 00:11:34,701 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 00:11:34,702 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 00:11:34,702 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 00:11:34,702 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 00:11:34,702 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 00:11:34,702 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 00:11:34,703 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 00:11:34,703 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 00:11:34,703 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 00:11:34,703 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 00:11:34,703 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 00:11:34,703 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 00:11:34,703 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 00:11:34,704 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 00:11:34,704 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 00:11:34,704 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 00:11:34,704 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 00:11:34,704 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 00:11:34,704 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 00:11:34,705 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 00:11:34,705 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 00:11:34,705 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 00:11:34,705 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 00:11:34,705 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 00:11:34,705 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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-vcloud-master/worker/working_dir_d3bd7b1f-edc4-45c5-8f5a-9236492060b3/bin-2019/utaipan 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(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 02e9294118e002d2445af62127a7232f85fd6228 [2018-10-27 00:11:34,731 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 00:11:34,741 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 00:11:34,744 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 00:11:34,745 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 00:11:34,745 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 00:11:34,746 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d3bd7b1f-edc4-45c5-8f5a-9236492060b3/bin-2019/utaipan/../../sv-benchmarks/c/bitvector/gcd_3_true-unreach-call_true-no-overflow.i [2018-10-27 00:11:34,794 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d3bd7b1f-edc4-45c5-8f5a-9236492060b3/bin-2019/utaipan/data/0066b96bb/6141c9a92e6445fc917ae4b2c9977f7d/FLAG7322cac8a [2018-10-27 00:11:35,197 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 00:11:35,199 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d3bd7b1f-edc4-45c5-8f5a-9236492060b3/sv-benchmarks/c/bitvector/gcd_3_true-unreach-call_true-no-overflow.i [2018-10-27 00:11:35,205 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d3bd7b1f-edc4-45c5-8f5a-9236492060b3/bin-2019/utaipan/data/0066b96bb/6141c9a92e6445fc917ae4b2c9977f7d/FLAG7322cac8a [2018-10-27 00:11:35,217 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d3bd7b1f-edc4-45c5-8f5a-9236492060b3/bin-2019/utaipan/data/0066b96bb/6141c9a92e6445fc917ae4b2c9977f7d [2018-10-27 00:11:35,220 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 00:11:35,221 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 00:11:35,222 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 00:11:35,222 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 00:11:35,225 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 00:11:35,226 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:11:35" (1/1) ... [2018-10-27 00:11:35,228 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@204f23ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:11:35, skipping insertion in model container [2018-10-27 00:11:35,229 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:11:35" (1/1) ... [2018-10-27 00:11:35,240 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 00:11:35,254 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 00:11:35,381 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 00:11:35,384 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 00:11:35,398 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 00:11:35,411 INFO L193 MainTranslator]: Completed translation [2018-10-27 00:11:35,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:11:35 WrapperNode [2018-10-27 00:11:35,412 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 00:11:35,413 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 00:11:35,413 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 00:11:35,413 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 00:11:35,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:11:35" (1/1) ... [2018-10-27 00:11:35,424 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:11:35" (1/1) ... [2018-10-27 00:11:35,429 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 00:11:35,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 00:11:35,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 00:11:35,429 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 00:11:35,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:11:35" (1/1) ... [2018-10-27 00:11:35,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:11:35" (1/1) ... [2018-10-27 00:11:35,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:11:35" (1/1) ... [2018-10-27 00:11:35,439 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:11:35" (1/1) ... [2018-10-27 00:11:35,442 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:11:35" (1/1) ... [2018-10-27 00:11:35,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:11:35" (1/1) ... [2018-10-27 00:11:35,447 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:11:35" (1/1) ... [2018-10-27 00:11:35,448 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 00:11:35,448 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 00:11:35,448 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 00:11:35,448 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 00:11:35,449 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:11:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bd7b1f-edc4-45c5-8f5a-9236492060b3/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 00:11:35,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 00:11:35,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 00:11:35,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 00:11:35,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 00:11:35,558 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 00:11:35,558 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 00:11:35,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-27 00:11:35,559 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-27 00:11:35,559 INFO L130 BoogieDeclarations]: Found specification of procedure gcd_test [2018-10-27 00:11:35,559 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd_test [2018-10-27 00:11:36,008 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 00:11:36,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:11:36 BoogieIcfgContainer [2018-10-27 00:11:36,009 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 00:11:36,009 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 00:11:36,009 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 00:11:36,012 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 00:11:36,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 12:11:35" (1/3) ... [2018-10-27 00:11:36,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53960156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:11:36, skipping insertion in model container [2018-10-27 00:11:36,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:11:35" (2/3) ... [2018-10-27 00:11:36,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53960156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:11:36, skipping insertion in model container [2018-10-27 00:11:36,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:11:36" (3/3) ... [2018-10-27 00:11:36,016 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_3_true-unreach-call_true-no-overflow.i [2018-10-27 00:11:36,026 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 00:11:36,032 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 00:11:36,046 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 00:11:36,077 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 00:11:36,078 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 00:11:36,078 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 00:11:36,078 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 00:11:36,078 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 00:11:36,078 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 00:11:36,078 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 00:11:36,078 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 00:11:36,095 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-10-27 00:11:36,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-27 00:11:36,101 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:11:36,102 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:11:36,104 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:11:36,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:11:36,110 INFO L82 PathProgramCache]: Analyzing trace with hash 697993246, now seen corresponding path program 1 times [2018-10-27 00:11:36,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:11:36,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:11:36,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:11:36,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:11:36,159 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:11:36,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:11:36,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:11:36,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:11:36,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 00:11:36,228 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:11:36,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-27 00:11:36,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 00:11:36,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 00:11:36,246 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-10-27 00:11:36,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:11:36,266 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-10-27 00:11:36,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 00:11:36,268 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-10-27 00:11:36,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:11:36,276 INFO L225 Difference]: With dead ends: 45 [2018-10-27 00:11:36,276 INFO L226 Difference]: Without dead ends: 21 [2018-10-27 00:11:36,279 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 00:11:36,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-27 00:11:36,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-27 00:11:36,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-27 00:11:36,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-10-27 00:11:36,315 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 19 [2018-10-27 00:11:36,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:11:36,315 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-10-27 00:11:36,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-27 00:11:36,316 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-10-27 00:11:36,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-27 00:11:36,316 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:11:36,316 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:11:36,317 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:11:36,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:11:36,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1860320398, now seen corresponding path program 1 times [2018-10-27 00:11:36,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:11:36,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:11:36,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:11:36,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:11:36,320 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:11:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:11:36,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:11:36,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:11:36,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-27 00:11:36,610 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:11:36,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 00:11:36,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 00:11:36,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-27 00:11:36,612 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 8 states. [2018-10-27 00:11:37,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:11:37,014 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-10-27 00:11:37,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 00:11:37,014 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-10-27 00:11:37,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:11:37,016 INFO L225 Difference]: With dead ends: 34 [2018-10-27 00:11:37,016 INFO L226 Difference]: Without dead ends: 24 [2018-10-27 00:11:37,017 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-10-27 00:11:37,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-27 00:11:37,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-10-27 00:11:37,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-27 00:11:37,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-10-27 00:11:37,027 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 20 [2018-10-27 00:11:37,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:11:37,027 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-10-27 00:11:37,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 00:11:37,028 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-10-27 00:11:37,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-27 00:11:37,028 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:11:37,028 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:11:37,029 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:11:37,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:11:37,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1273514384, now seen corresponding path program 1 times [2018-10-27 00:11:37,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:11:37,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:11:37,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:11:37,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:11:37,034 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:11:37,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:11:37,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:11:37,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:11:37,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 00:11:37,134 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 00:11:37,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 00:11:37,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 00:11:37,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:11:37,140 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 5 states. [2018-10-27 00:11:37,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:11:37,208 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-10-27 00:11:37,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 00:11:37,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-10-27 00:11:37,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:11:37,210 INFO L225 Difference]: With dead ends: 36 [2018-10-27 00:11:37,210 INFO L226 Difference]: Without dead ends: 23 [2018-10-27 00:11:37,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:11:37,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-27 00:11:37,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-27 00:11:37,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-27 00:11:37,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-10-27 00:11:37,219 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2018-10-27 00:11:37,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:11:37,219 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-10-27 00:11:37,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 00:11:37,219 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-10-27 00:11:37,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-27 00:11:37,220 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:11:37,220 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:11:37,220 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:11:37,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:11:37,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1311173036, now seen corresponding path program 1 times [2018-10-27 00:11:37,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:11:37,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:11:37,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:11:37,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:11:37,224 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:11:37,247 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-27 00:11:37,248 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-27 00:11:37,248 INFO L171 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bd7b1f-edc4-45c5-8f5a-9236492060b3/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-27 00:11:37,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:11:37,255 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-10-27 00:11:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:11:37,299 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-10-27 00:11:37,300 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [16], [19], [21], [27], [32], [36], [42], [46], [48], [52], [53], [54], [55], [56], [58], [59], [60] [2018-10-27 00:11:37,341 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-27 00:11:37,342 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 00:11:37,457 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 00:11:37,664 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 00:11:37,665 INFO L272 AbstractInterpreter]: Visited 21 different actions 33 times. Merged at 8 different actions 8 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 6 variables. [2018-10-27 00:11:37,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:11:37,698 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 00:11:37,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:11:37,699 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bd7b1f-edc4-45c5-8f5a-9236492060b3/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 00:11:37,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:11:37,705 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 00:11:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:11:37,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 00:11:38,969 WARN L179 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 138 DAG size of output: 20 [2018-10-27 00:11:39,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:11:39,222 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 00:11:41,947 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (<= 0 c_gcd_test_~a)) (.cse2 (< c_gcd_test_~a 0)) (.cse3 (<= |c_gcd_test_#in~a| 0))) (and (or (forall ((v_prenex_48 Int)) (let ((.cse1 (mod c_gcd_test_~a v_prenex_48))) (let ((.cse0 (mod .cse1 256))) (or (<= .cse0 127) (not (= 256 .cse0)) (< v_prenex_48 0) (<= (mod (+ (* 255 v_prenex_48) .cse1) 256) 127) (< 127 v_prenex_48) (<= v_prenex_48 |c_gcd_test_#in~a|) (= v_prenex_48 0) (< 127 (mod (+ v_prenex_48 .cse1) 256)))))) .cse2 .cse3) (or (forall ((gcd_test_~b Int)) (let ((.cse4 (mod c_gcd_test_~a gcd_test_~b))) (let ((.cse5 (mod .cse4 256))) (or (<= gcd_test_~b |c_gcd_test_#in~a|) (not (= .cse4 0)) (< 127 (mod (+ gcd_test_~b .cse4) 256)) (< 127 (mod (+ (* 255 gcd_test_~b) .cse4) 256)) (= gcd_test_~b 0) (< gcd_test_~b 0) (< 127 .cse5) (< 127 gcd_test_~b) (not (= .cse5 0)))))) .cse3) (or .cse2 (forall ((v_prenex_35 Int)) (let ((.cse6 (mod c_gcd_test_~a v_prenex_35))) (let ((.cse7 (mod .cse6 256))) (or (<= (mod (+ v_prenex_35 .cse6) 256) 127) (not (= .cse7 0)) (< 127 v_prenex_35) (< 127 (mod (+ (* 255 v_prenex_35) .cse6) 256)) (< 127 .cse7) (= v_prenex_35 0) (<= 0 v_prenex_35) (<= v_prenex_35 |c_gcd_test_#in~a|))))) .cse3) (or .cse2 (forall ((v_prenex_52 Int)) (let ((.cse9 (mod c_gcd_test_~a v_prenex_52))) (let ((.cse8 (mod .cse9 256))) (or (not (= 256 .cse8)) (<= v_prenex_52 |c_gcd_test_#in~a|) (<= (mod (+ (* 255 v_prenex_52) .cse9) 256) 127) (= v_prenex_52 0) (not (= .cse9 0)) (<= .cse8 127) (<= 0 v_prenex_52) (< 127 v_prenex_52) (< 127 (mod (+ v_prenex_52 .cse9) 256)))))) .cse3) (or (forall ((v_prenex_53 Int)) (let ((.cse10 (mod c_gcd_test_~a v_prenex_53))) (let ((.cse11 (mod (+ v_prenex_53 .cse10) 256))) (or (<= 0 v_prenex_53) (= .cse10 0) (< 127 (mod (+ (* 255 v_prenex_53) .cse10) 256)) (not (= .cse11 256)) (<= (mod .cse10 256) 127) (<= .cse11 127) (< 127 v_prenex_53) (<= v_prenex_53 |c_gcd_test_#in~a|) (= v_prenex_53 0))))) .cse3 .cse12) (or .cse2 (forall ((v_prenex_38 Int)) (let ((.cse13 (mod c_gcd_test_~a v_prenex_38))) (let ((.cse14 (mod .cse13 256))) (or (<= (mod (+ v_prenex_38 .cse13) 256) 127) (< 127 .cse14) (= v_prenex_38 0) (<= v_prenex_38 |c_gcd_test_#in~a|) (< v_prenex_38 0) (< 127 v_prenex_38) (not (= .cse14 0)) (< 127 (mod (+ (* 255 v_prenex_38) .cse13) 256)))))) .cse3) (or .cse2 (forall ((v_prenex_46 Int)) (let ((.cse16 (mod c_gcd_test_~a v_prenex_46))) (let ((.cse15 (mod .cse16 256))) (or (not (= 256 .cse15)) (<= 0 v_prenex_46) (<= (mod (+ v_prenex_46 .cse16) 256) 127) (= v_prenex_46 0) (< 127 v_prenex_46) (<= .cse15 127) (<= v_prenex_46 |c_gcd_test_#in~a|) (< 127 (mod (+ (* 255 v_prenex_46) .cse16) 256)))))) .cse3) (or (forall ((v_prenex_68 Int)) (let ((.cse17 (mod c_gcd_test_~a v_prenex_68))) (let ((.cse18 (mod .cse17 256))) (or (<= (mod (+ v_prenex_68 .cse17) 256) 127) (< v_prenex_68 0) (< 127 v_prenex_68) (<= .cse18 127) (not (= 256 .cse18)) (<= v_prenex_68 |c_gcd_test_#in~a|) (not (= .cse17 0)) (<= (mod (+ (* 255 v_prenex_68) .cse17) 256) 127) (= v_prenex_68 0))))) .cse3) (or .cse2 (forall ((v_prenex_4 Int)) (let ((.cse20 (mod c_gcd_test_~a v_prenex_4))) (let ((.cse19 (mod .cse20 256))) (or (<= 0 v_prenex_4) (< 127 .cse19) (< 127 (mod (+ v_prenex_4 .cse20) 256)) (= v_prenex_4 0) (not (= .cse19 0)) (<= v_prenex_4 |c_gcd_test_#in~a|) (< 127 v_prenex_4) (< 127 (mod (+ (* 255 v_prenex_4) .cse20) 256)))))) .cse3) (or .cse2 (forall ((v_prenex_10 Int)) (let ((.cse22 (mod c_gcd_test_~a v_prenex_10))) (let ((.cse21 (mod .cse22 256))) (or (not (= .cse21 0)) (<= (mod (+ v_prenex_10 .cse22) 256) 127) (<= (mod (+ (* 255 v_prenex_10) .cse22) 256) 127) (< v_prenex_10 0) (<= v_prenex_10 |c_gcd_test_#in~a|) (not (= .cse22 0)) (= v_prenex_10 0) (< 127 .cse21) (< 127 v_prenex_10))))) .cse3) (or (forall ((v_prenex_72 Int)) (let ((.cse23 (mod c_gcd_test_~a v_prenex_72))) (let ((.cse24 (mod (+ (* 255 v_prenex_72) .cse23) 256))) (or (< 127 (mod (+ v_prenex_72 .cse23) 256)) (= v_prenex_72 0) (<= (mod .cse23 256) 127) (<= v_prenex_72 |c_gcd_test_#in~a|) (< 127 v_prenex_72) (<= .cse24 127) (< v_prenex_72 0) (not (= .cse24 256)) (= .cse23 0))))) .cse3 .cse12) (or (forall ((v_prenex_55 Int)) (let ((.cse25 (mod c_gcd_test_~a v_prenex_55))) (let ((.cse26 (mod (+ (* 255 v_prenex_55) .cse25) 256))) (or (<= (mod .cse25 256) 127) (= v_prenex_55 0) (= .cse25 0) (< v_prenex_55 0) (<= v_prenex_55 |c_gcd_test_#in~a|) (not (= 0 .cse26)) (< 127 .cse26) (< 127 (mod (+ v_prenex_55 .cse25) 256)) (< 127 v_prenex_55))))) .cse3 .cse12) (or (forall ((v_prenex_16 Int)) (let ((.cse27 (mod c_gcd_test_~a v_prenex_16))) (let ((.cse28 (mod .cse27 256))) (or (<= (mod (+ (* 255 v_prenex_16) .cse27) 256) 127) (not (= 256 .cse28)) (< 127 v_prenex_16) (<= .cse28 127) (<= 0 v_prenex_16) (<= (mod (+ v_prenex_16 .cse27) 256) 127) (= v_prenex_16 0) (<= v_prenex_16 |c_gcd_test_#in~a|))))) .cse2 .cse3) (or (forall ((v_prenex_41 Int)) (let ((.cse29 (mod c_gcd_test_~a v_prenex_41))) (let ((.cse30 (mod (+ v_prenex_41 .cse29) 256))) (or (<= (mod .cse29 256) 127) (< 127 .cse30) (< 127 v_prenex_41) (not (= 0 .cse30)) (= .cse29 0) (= v_prenex_41 0) (<= (mod (+ (* 255 v_prenex_41) .cse29) 256) 127) (<= 0 v_prenex_41) (<= v_prenex_41 |c_gcd_test_#in~a|))))) .cse3 .cse12) (or .cse2 (forall ((v_prenex_76 Int)) (let ((.cse32 (mod c_gcd_test_~a v_prenex_76))) (let ((.cse31 (mod .cse32 256))) (or (< 127 v_prenex_76) (<= .cse31 127) (< 127 (mod (+ v_prenex_76 .cse32) 256)) (= v_prenex_76 0) (not (= .cse32 0)) (<= v_prenex_76 |c_gcd_test_#in~a|) (< v_prenex_76 0) (<= (mod (+ (* 255 v_prenex_76) .cse32) 256) 127) (not (= 256 .cse31)))))) .cse3) (or .cse2 (forall ((v_prenex_11 Int)) (let ((.cse34 (mod c_gcd_test_~a v_prenex_11))) (let ((.cse33 (mod .cse34 256))) (or (not (= .cse33 0)) (<= v_prenex_11 |c_gcd_test_#in~a|) (< 127 .cse33) (= v_prenex_11 0) (<= (mod (+ v_prenex_11 .cse34) 256) 127) (<= (mod (+ (* 255 v_prenex_11) .cse34) 256) 127) (< v_prenex_11 0) (< 127 v_prenex_11))))) .cse3) (or (forall ((v_prenex_73 Int)) (let ((.cse35 (mod c_gcd_test_~a v_prenex_73))) (let ((.cse36 (mod .cse35 256))) (or (< 127 (mod (+ v_prenex_73 .cse35) 256)) (<= v_prenex_73 |c_gcd_test_#in~a|) (<= (mod (+ (* 255 v_prenex_73) .cse35) 256) 127) (not (= .cse35 0)) (= v_prenex_73 0) (not (= 256 .cse36)) (< 127 v_prenex_73) (<= .cse36 127) (< v_prenex_73 0))))) .cse3) (or (forall ((v_prenex_59 Int)) (let ((.cse37 (mod c_gcd_test_~a v_prenex_59))) (let ((.cse38 (mod .cse37 256))) (or (< 127 (mod (+ (* 255 v_prenex_59) .cse37) 256)) (<= (mod (+ v_prenex_59 .cse37) 256) 127) (<= 0 v_prenex_59) (<= .cse38 127) (<= v_prenex_59 |c_gcd_test_#in~a|) (not (= .cse37 0)) (not (= 256 .cse38)) (< 127 v_prenex_59) (= v_prenex_59 0))))) .cse3) (or .cse3 (forall ((v_prenex_59 Int)) (let ((.cse39 (mod c_gcd_test_~a v_prenex_59))) (let ((.cse40 (mod .cse39 256))) (or (< 127 (mod (+ (* 255 v_prenex_59) .cse39) 256)) (<= (mod (+ v_prenex_59 .cse39) 256) 127) (< v_prenex_59 0) (<= .cse40 127) (<= v_prenex_59 |c_gcd_test_#in~a|) (not (= .cse39 0)) (not (= 256 .cse40)) (< 127 v_prenex_59) (= v_prenex_59 0)))))) (or (forall ((v_prenex_39 Int)) (let ((.cse41 (mod c_gcd_test_~a v_prenex_39))) (let ((.cse42 (mod (+ (* 255 v_prenex_39) .cse41) 256))) (or (< 127 (mod .cse41 256)) (< v_prenex_39 0) (< 127 .cse42) (< 127 (mod (+ v_prenex_39 .cse41) 256)) (not (= 0 .cse42)) (< 127 v_prenex_39) (<= v_prenex_39 |c_gcd_test_#in~a|) (= .cse41 0) (= v_prenex_39 0))))) .cse3 .cse12) (or (forall ((v_prenex_25 Int)) (let ((.cse43 (mod c_gcd_test_~a v_prenex_25))) (let ((.cse44 (mod (+ (* 255 v_prenex_25) .cse43) 256))) (or (< 127 (mod .cse43 256)) (<= .cse44 127) (< 127 v_prenex_25) (< v_prenex_25 0) (= v_prenex_25 0) (not (= .cse44 256)) (= .cse43 0) (<= v_prenex_25 |c_gcd_test_#in~a|) (<= (mod (+ v_prenex_25 .cse43) 256) 127))))) .cse3 .cse12) (or (forall ((v_prenex_64 Int)) (let ((.cse45 (mod c_gcd_test_~a v_prenex_64))) (let ((.cse46 (mod .cse45 256))) (or (< 127 (mod (+ v_prenex_64 .cse45) 256)) (< v_prenex_64 0) (< 127 v_prenex_64) (<= .cse46 127) (<= v_prenex_64 |c_gcd_test_#in~a|) (< 127 (mod (+ (* 255 v_prenex_64) .cse45) 256)) (not (= 256 .cse46)) (= v_prenex_64 0) (not (= .cse45 0)))))) .cse3) (or (forall ((v_prenex_32 Int)) (let ((.cse48 (mod c_gcd_test_~a v_prenex_32))) (let ((.cse47 (mod .cse48 256))) (or (not (= .cse47 0)) (< 127 v_prenex_32) (not (= .cse48 0)) (<= (mod (+ (* 255 v_prenex_32) .cse48) 256) 127) (<= v_prenex_32 |c_gcd_test_#in~a|) (< 127 (mod (+ v_prenex_32 .cse48) 256)) (= v_prenex_32 0) (< v_prenex_32 0) (< 127 .cse47))))) .cse2 .cse3) (or (forall ((v_prenex_65 Int)) (let ((.cse49 (mod c_gcd_test_~a v_prenex_65))) (let ((.cse50 (mod (+ (* 255 v_prenex_65) .cse49) 256))) (or (= .cse49 0) (< v_prenex_65 0) (not (= .cse50 256)) (<= .cse50 127) (<= v_prenex_65 |c_gcd_test_#in~a|) (< 127 (mod .cse49 256)) (< 127 (mod (+ v_prenex_65 .cse49) 256)) (= v_prenex_65 0) (< 127 v_prenex_65))))) .cse3 .cse12) (or (forall ((v_prenex_54 Int)) (let ((.cse51 (mod c_gcd_test_~a v_prenex_54))) (let ((.cse52 (mod (+ (* 255 v_prenex_54) .cse51) 256))) (or (<= (mod (+ v_prenex_54 .cse51) 256) 127) (<= (mod .cse51 256) 127) (not (= 0 .cse52)) (< 127 .cse52) (= .cse51 0) (< 127 v_prenex_54) (<= v_prenex_54 |c_gcd_test_#in~a|) (= v_prenex_54 0) (< v_prenex_54 0))))) .cse3 .cse12) (or .cse2 (forall ((v_prenex_21 Int)) (let ((.cse53 (mod c_gcd_test_~a v_prenex_21))) (let ((.cse54 (mod .cse53 256))) (or (< 127 (mod (+ v_prenex_21 .cse53) 256)) (<= v_prenex_21 |c_gcd_test_#in~a|) (<= .cse54 127) (not (= 256 .cse54)) (< 127 v_prenex_21) (= v_prenex_21 0) (< 127 (mod (+ (* 255 v_prenex_21) .cse53) 256)) (not (= .cse53 0)) (<= 0 v_prenex_21))))) .cse3) (or (forall ((v_prenex_58 Int)) (let ((.cse56 (mod c_gcd_test_~a v_prenex_58))) (let ((.cse55 (mod (+ v_prenex_58 .cse56) 256))) (or (<= .cse55 127) (<= v_prenex_58 |c_gcd_test_#in~a|) (<= 0 v_prenex_58) (= .cse56 0) (< 127 v_prenex_58) (= v_prenex_58 0) (< 127 (mod (+ (* 255 v_prenex_58) .cse56) 256)) (< 127 (mod .cse56 256)) (not (= .cse55 256)))))) .cse3 .cse12) (or (forall ((v_prenex_27 Int)) (let ((.cse57 (mod c_gcd_test_~a v_prenex_27))) (let ((.cse58 (mod (+ v_prenex_27 .cse57) 256))) (or (<= (mod (+ (* 255 v_prenex_27) .cse57) 256) 127) (not (= .cse58 256)) (= .cse57 0) (<= .cse58 127) (<= v_prenex_27 |c_gcd_test_#in~a|) (< 127 v_prenex_27) (<= (mod .cse57 256) 127) (<= 0 v_prenex_27) (= v_prenex_27 0))))) .cse3 .cse12) (or (forall ((v_prenex_75 Int)) (let ((.cse60 (mod c_gcd_test_~a v_prenex_75))) (let ((.cse59 (mod .cse60 256))) (or (= v_prenex_75 0) (< 127 .cse59) (<= v_prenex_75 |c_gcd_test_#in~a|) (not (= .cse59 0)) (< 127 (mod (+ (* 255 v_prenex_75) .cse60) 256)) (<= (mod (+ v_prenex_75 .cse60) 256) 127) (< 127 v_prenex_75) (not (= .cse60 0)) (< v_prenex_75 0))))) .cse3) (or (forall ((gcd_test_~b Int)) (let ((.cse61 (mod c_gcd_test_~a gcd_test_~b))) (let ((.cse62 (mod .cse61 256))) (or (<= gcd_test_~b |c_gcd_test_#in~a|) (<= 0 gcd_test_~b) (not (= .cse61 0)) (< 127 (mod (+ gcd_test_~b .cse61) 256)) (< 127 (mod (+ (* 255 gcd_test_~b) .cse61) 256)) (= gcd_test_~b 0) (< 127 .cse62) (< 127 gcd_test_~b) (not (= .cse62 0)))))) .cse3) (or .cse2 (forall ((v_prenex_20 Int)) (let ((.cse64 (mod c_gcd_test_~a v_prenex_20))) (let ((.cse63 (mod .cse64 256))) (or (<= v_prenex_20 |c_gcd_test_#in~a|) (< v_prenex_20 0) (<= .cse63 127) (not (= .cse64 0)) (< 127 (mod (+ (* 255 v_prenex_20) .cse64) 256)) (< 127 (mod (+ v_prenex_20 .cse64) 256)) (not (= 256 .cse63)) (= v_prenex_20 0) (< 127 v_prenex_20))))) .cse3) (or (forall ((v_prenex_64 Int)) (let ((.cse65 (mod c_gcd_test_~a v_prenex_64))) (let ((.cse66 (mod .cse65 256))) (or (< 127 (mod (+ v_prenex_64 .cse65) 256)) (< 127 v_prenex_64) (<= 0 v_prenex_64) (<= .cse66 127) (<= v_prenex_64 |c_gcd_test_#in~a|) (< 127 (mod (+ (* 255 v_prenex_64) .cse65) 256)) (not (= 256 .cse66)) (= v_prenex_64 0) (not (= .cse65 0)))))) .cse3) (or (forall ((v_prenex_73 Int)) (let ((.cse67 (mod c_gcd_test_~a v_prenex_73))) (let ((.cse68 (mod .cse67 256))) (or (< 127 (mod (+ v_prenex_73 .cse67) 256)) (<= v_prenex_73 |c_gcd_test_#in~a|) (<= (mod (+ (* 255 v_prenex_73) .cse67) 256) 127) (not (= .cse67 0)) (= v_prenex_73 0) (not (= 256 .cse68)) (< 127 v_prenex_73) (<= .cse68 127) (<= 0 v_prenex_73))))) .cse3) (or .cse2 (forall ((v_prenex_45 Int)) (let ((.cse69 (mod c_gcd_test_~a v_prenex_45))) (let ((.cse70 (mod .cse69 256))) (or (< 127 (mod (+ (* 255 v_prenex_45) .cse69) 256)) (<= .cse70 127) (not (= .cse69 0)) (<= v_prenex_45 |c_gcd_test_#in~a|) (< v_prenex_45 0) (= v_prenex_45 0) (< 127 v_prenex_45) (<= (mod (+ v_prenex_45 .cse69) 256) 127) (not (= 256 .cse70)))))) .cse3) (or (forall ((v_prenex_28 Int)) (let ((.cse71 (mod c_gcd_test_~a v_prenex_28))) (let ((.cse72 (mod (+ (* 255 v_prenex_28) .cse71) 256))) (or (< 127 v_prenex_28) (<= (mod .cse71 256) 127) (<= .cse72 127) (= v_prenex_28 0) (= .cse71 0) (<= v_prenex_28 |c_gcd_test_#in~a|) (<= (mod (+ v_prenex_28 .cse71) 256) 127) (not (= .cse72 256)) (< v_prenex_28 0))))) .cse3 .cse12) (or .cse2 (forall ((v_prenex_29 Int)) (let ((.cse74 (mod c_gcd_test_~a v_prenex_29))) (let ((.cse73 (mod .cse74 256))) (or (not (= .cse73 0)) (<= v_prenex_29 |c_gcd_test_#in~a|) (< v_prenex_29 0) (<= (mod (+ (* 255 v_prenex_29) .cse74) 256) 127) (< 127 v_prenex_29) (< 127 .cse73) (= v_prenex_29 0) (< 127 (mod (+ v_prenex_29 .cse74) 256)))))) .cse3) (or (forall ((v_prenex_23 Int)) (let ((.cse76 (mod c_gcd_test_~a v_prenex_23))) (let ((.cse75 (mod (+ v_prenex_23 .cse76) 256))) (or (< 127 v_prenex_23) (<= 0 v_prenex_23) (= v_prenex_23 0) (not (= 0 .cse75)) (< 127 .cse75) (<= v_prenex_23 |c_gcd_test_#in~a|) (= .cse76 0) (< 127 (mod .cse76 256)) (<= (mod (+ (* 255 v_prenex_23) .cse76) 256) 127))))) .cse3 .cse12) (or (forall ((v_prenex_75 Int)) (let ((.cse78 (mod c_gcd_test_~a v_prenex_75))) (let ((.cse77 (mod .cse78 256))) (or (= v_prenex_75 0) (< 127 .cse77) (<= 0 v_prenex_75) (<= v_prenex_75 |c_gcd_test_#in~a|) (not (= .cse77 0)) (< 127 (mod (+ (* 255 v_prenex_75) .cse78) 256)) (<= (mod (+ v_prenex_75 .cse78) 256) 127) (< 127 v_prenex_75) (not (= .cse78 0)))))) .cse3) (or (forall ((v_prenex_78 Int)) (let ((.cse80 (mod c_gcd_test_~a v_prenex_78))) (let ((.cse79 (mod .cse80 256))) (or (< v_prenex_78 0) (= v_prenex_78 0) (< 127 .cse79) (<= v_prenex_78 |c_gcd_test_#in~a|) (< 127 (mod (+ v_prenex_78 .cse80) 256)) (not (= .cse79 0)) (< 127 v_prenex_78) (<= (mod (+ (* 255 v_prenex_78) .cse80) 256) 127) (not (= .cse80 0)))))) .cse3) (or .cse2 .cse3 (forall ((v_prenex_36 Int)) (let ((.cse82 (mod c_gcd_test_~a v_prenex_36))) (let ((.cse81 (mod .cse82 256))) (or (not (= .cse81 0)) (= v_prenex_36 0) (< 127 v_prenex_36) (not (= .cse82 0)) (< v_prenex_36 0) (<= (mod (+ v_prenex_36 .cse82) 256) 127) (< 127 (mod (+ (* 255 v_prenex_36) .cse82) 256)) (<= v_prenex_36 |c_gcd_test_#in~a|) (< 127 .cse81)))))) (or (forall ((v_prenex_56 Int)) (let ((.cse84 (mod c_gcd_test_~a v_prenex_56))) (let ((.cse83 (mod (+ v_prenex_56 .cse84) 256))) (or (< 127 .cse83) (not (= 0 .cse83)) (<= v_prenex_56 |c_gcd_test_#in~a|) (= v_prenex_56 0) (<= (mod .cse84 256) 127) (< 127 v_prenex_56) (= .cse84 0) (< 127 (mod (+ (* 255 v_prenex_56) .cse84) 256)) (<= 0 v_prenex_56))))) .cse3 .cse12) (or (forall ((v_prenex_7 Int)) (let ((.cse85 (mod c_gcd_test_~a v_prenex_7))) (let ((.cse86 (mod .cse85 256))) (or (<= 0 v_prenex_7) (< 127 (mod (+ (* 255 v_prenex_7) .cse85) 256)) (not (= .cse85 0)) (= v_prenex_7 0) (< 127 (mod (+ v_prenex_7 .cse85) 256)) (not (= .cse86 0)) (<= v_prenex_7 |c_gcd_test_#in~a|) (< 127 v_prenex_7) (< 127 .cse86))))) .cse2 .cse3) (or .cse2 (forall ((v_prenex_50 Int)) (let ((.cse87 (mod c_gcd_test_~a v_prenex_50))) (let ((.cse88 (mod .cse87 256))) (or (<= (mod (+ (* 255 v_prenex_50) .cse87) 256) 127) (not (= 256 .cse88)) (< 127 v_prenex_50) (<= .cse88 127) (< 127 (mod (+ v_prenex_50 .cse87) 256)) (<= 0 v_prenex_50) (<= v_prenex_50 |c_gcd_test_#in~a|) (= v_prenex_50 0))))) .cse3) (or .cse2 (forall ((v_prenex_62 Int)) (let ((.cse90 (mod c_gcd_test_~a v_prenex_62))) (let ((.cse89 (mod .cse90 256))) (or (<= .cse89 127) (< 127 v_prenex_62) (not (= .cse90 0)) (<= (mod (+ (* 255 v_prenex_62) .cse90) 256) 127) (<= 0 v_prenex_62) (<= v_prenex_62 |c_gcd_test_#in~a|) (= v_prenex_62 0) (not (= 256 .cse89)) (<= (mod (+ v_prenex_62 .cse90) 256) 127))))) .cse3) (or .cse2 (forall ((v_prenex_9 Int)) (let ((.cse91 (mod c_gcd_test_~a v_prenex_9))) (let ((.cse92 (mod .cse91 256))) (or (<= (mod (+ (* 255 v_prenex_9) .cse91) 256) 127) (< 127 v_prenex_9) (not (= .cse92 0)) (<= (mod (+ v_prenex_9 .cse91) 256) 127) (<= 0 v_prenex_9) (= v_prenex_9 0) (<= v_prenex_9 |c_gcd_test_#in~a|) (< 127 .cse92))))) .cse3) (or (forall ((v_prenex_57 Int)) (let ((.cse93 (mod c_gcd_test_~a v_prenex_57))) (let ((.cse94 (mod .cse93 256))) (or (< 127 v_prenex_57) (not (= .cse93 0)) (= v_prenex_57 0) (<= v_prenex_57 |c_gcd_test_#in~a|) (< 127 .cse94) (<= (mod (+ v_prenex_57 .cse93) 256) 127) (<= (mod (+ (* 255 v_prenex_57) .cse93) 256) 127) (not (= .cse94 0)) (< v_prenex_57 0))))) .cse3) (or .cse2 (forall ((v_prenex_31 Int)) (let ((.cse96 (mod c_gcd_test_~a v_prenex_31))) (let ((.cse95 (mod .cse96 256))) (or (< 127 .cse95) (<= (mod (+ (* 255 v_prenex_31) .cse96) 256) 127) (< 127 (mod (+ v_prenex_31 .cse96) 256)) (<= 0 v_prenex_31) (= v_prenex_31 0) (<= v_prenex_31 |c_gcd_test_#in~a|) (not (= .cse95 0)) (< 127 v_prenex_31))))) .cse3) (or .cse2 (forall ((v_prenex_6 Int)) (let ((.cse98 (mod c_gcd_test_~a v_prenex_6))) (let ((.cse97 (mod .cse98 256))) (or (not (= .cse97 0)) (< v_prenex_6 0) (< 127 (mod (+ v_prenex_6 .cse98) 256)) (< 127 v_prenex_6) (< 127 (mod (+ (* 255 v_prenex_6) .cse98) 256)) (< 127 .cse97) (<= v_prenex_6 |c_gcd_test_#in~a|) (= v_prenex_6 0) (not (= .cse98 0)))))) .cse3) (or .cse2 (forall ((v_prenex_12 Int)) (let ((.cse99 (mod c_gcd_test_~a v_prenex_12))) (let ((.cse100 (mod .cse99 256))) (or (= v_prenex_12 0) (<= 0 v_prenex_12) (<= (mod (+ (* 255 v_prenex_12) .cse99) 256) 127) (<= v_prenex_12 |c_gcd_test_#in~a|) (<= (mod (+ v_prenex_12 .cse99) 256) 127) (< 127 v_prenex_12) (not (= .cse99 0)) (not (= .cse100 0)) (< 127 .cse100))))) .cse3) (or .cse2 (forall ((v_prenex_19 Int)) (let ((.cse101 (mod c_gcd_test_~a v_prenex_19))) (let ((.cse102 (mod .cse101 256))) (or (< 127 (mod (+ v_prenex_19 .cse101) 256)) (<= 0 v_prenex_19) (< 127 (mod (+ (* 255 v_prenex_19) .cse101) 256)) (< 127 v_prenex_19) (<= v_prenex_19 |c_gcd_test_#in~a|) (= v_prenex_19 0) (not (= 256 .cse102)) (<= .cse102 127))))) .cse3) (or .cse2 (forall ((v_prenex_5 Int)) (let ((.cse103 (mod c_gcd_test_~a v_prenex_5))) (let ((.cse104 (mod .cse103 256))) (or (< 127 (mod (+ v_prenex_5 .cse103) 256)) (= v_prenex_5 0) (not (= .cse104 0)) (< 127 .cse104) (<= v_prenex_5 |c_gcd_test_#in~a|) (< 127 (mod (+ (* 255 v_prenex_5) .cse103) 256)) (< 127 v_prenex_5) (< v_prenex_5 0))))) .cse3) (or (forall ((v_prenex_57 Int)) (let ((.cse105 (mod c_gcd_test_~a v_prenex_57))) (let ((.cse106 (mod .cse105 256))) (or (< 127 v_prenex_57) (not (= .cse105 0)) (= v_prenex_57 0) (<= v_prenex_57 |c_gcd_test_#in~a|) (< 127 .cse106) (<= (mod (+ v_prenex_57 .cse105) 256) 127) (<= (mod (+ (* 255 v_prenex_57) .cse105) 256) 127) (not (= .cse106 0)) (<= 0 v_prenex_57))))) .cse3) (or .cse2 (forall ((v_prenex_15 Int)) (let ((.cse107 (mod c_gcd_test_~a v_prenex_15))) (let ((.cse108 (mod .cse107 256))) (or (= v_prenex_15 0) (<= (mod (+ (* 255 v_prenex_15) .cse107) 256) 127) (<= .cse108 127) (< v_prenex_15 0) (not (= 256 .cse108)) (< 127 v_prenex_15) (<= (mod (+ v_prenex_15 .cse107) 256) 127) (not (= .cse107 0)) (<= v_prenex_15 |c_gcd_test_#in~a|))))) .cse3) (or .cse2 (forall ((v_prenex_69 Int)) (let ((.cse109 (mod c_gcd_test_~a v_prenex_69))) (let ((.cse110 (mod .cse109 256))) (or (< 127 (mod (+ v_prenex_69 .cse109) 256)) (not (= .cse110 0)) (<= v_prenex_69 |c_gcd_test_#in~a|) (not (= .cse109 0)) (< 127 v_prenex_69) (= v_prenex_69 0) (<= (mod (+ (* 255 v_prenex_69) .cse109) 256) 127) (<= 0 v_prenex_69) (< 127 .cse110))))) .cse3) (or (forall ((v_prenex_68 Int)) (let ((.cse111 (mod c_gcd_test_~a v_prenex_68))) (let ((.cse112 (mod .cse111 256))) (or (<= (mod (+ v_prenex_68 .cse111) 256) 127) (< 127 v_prenex_68) (<= .cse112 127) (not (= 256 .cse112)) (<= 0 v_prenex_68) (<= v_prenex_68 |c_gcd_test_#in~a|) (not (= .cse111 0)) (<= (mod (+ (* 255 v_prenex_68) .cse111) 256) 127) (= v_prenex_68 0))))) .cse3) (or (forall ((v_prenex_26 Int)) (let ((.cse114 (mod c_gcd_test_~a v_prenex_26))) (let ((.cse113 (mod (+ v_prenex_26 .cse114) 256))) (or (not (= .cse113 256)) (< 127 (mod .cse114 256)) (<= .cse113 127) (<= (mod (+ (* 255 v_prenex_26) .cse114) 256) 127) (= .cse114 0) (<= 0 v_prenex_26) (= v_prenex_26 0) (< 127 v_prenex_26) (<= v_prenex_26 |c_gcd_test_#in~a|))))) .cse3 .cse12) (or (forall ((v_prenex_71 Int)) (let ((.cse115 (mod c_gcd_test_~a v_prenex_71))) (let ((.cse116 (mod (+ v_prenex_71 .cse115) 256))) (or (< 127 (mod .cse115 256)) (< 127 (mod (+ (* 255 v_prenex_71) .cse115) 256)) (<= v_prenex_71 |c_gcd_test_#in~a|) (not (= 0 .cse116)) (= .cse115 0) (= v_prenex_71 0) (<= 0 v_prenex_71) (< 127 .cse116) (< 127 v_prenex_71))))) .cse3 .cse12) (or .cse2 (forall ((v_prenex_22 Int)) (let ((.cse117 (mod c_gcd_test_~a v_prenex_22))) (let ((.cse118 (mod .cse117 256))) (or (< 127 (mod (+ v_prenex_22 .cse117) 256)) (not (= 256 .cse118)) (< 127 (mod (+ (* 255 v_prenex_22) .cse117) 256)) (< v_prenex_22 0) (= v_prenex_22 0) (<= v_prenex_22 |c_gcd_test_#in~a|) (< 127 v_prenex_22) (<= .cse118 127))))) .cse3) (or .cse2 (forall ((v_prenex_70 Int)) (let ((.cse120 (mod c_gcd_test_~a v_prenex_70))) (let ((.cse119 (mod .cse120 256))) (or (<= 0 v_prenex_70) (= v_prenex_70 0) (not (= .cse119 0)) (< 127 (mod (+ (* 255 v_prenex_70) .cse120) 256)) (<= v_prenex_70 |c_gcd_test_#in~a|) (<= (mod (+ v_prenex_70 .cse120) 256) 127) (< 127 v_prenex_70) (< 127 .cse119) (not (= .cse120 0)))))) .cse3) (or (forall ((v_prenex_1 Int)) (let ((.cse121 (mod c_gcd_test_~a v_prenex_1))) (let ((.cse122 (mod (+ (* 255 v_prenex_1) .cse121) 256))) (or (< 127 (mod .cse121 256)) (<= v_prenex_1 |c_gcd_test_#in~a|) (= .cse121 0) (= v_prenex_1 0) (<= (mod (+ v_prenex_1 .cse121) 256) 127) (< v_prenex_1 0) (< 127 v_prenex_1) (< 127 .cse122) (not (= 0 .cse122)))))) .cse3 .cse12) (or .cse2 (forall ((v_prenex_47 Int)) (let ((.cse124 (mod c_gcd_test_~a v_prenex_47))) (let ((.cse123 (mod .cse124 256))) (or (<= .cse123 127) (< 127 (mod (+ (* 255 v_prenex_47) .cse124) 256)) (<= 0 v_prenex_47) (not (= .cse124 0)) (<= v_prenex_47 |c_gcd_test_#in~a|) (= v_prenex_47 0) (< 127 v_prenex_47) (<= (mod (+ v_prenex_47 .cse124) 256) 127) (not (= 256 .cse123)))))) .cse3) (or (forall ((v_prenex_78 Int)) (let ((.cse126 (mod c_gcd_test_~a v_prenex_78))) (let ((.cse125 (mod .cse126 256))) (or (<= 0 v_prenex_78) (= v_prenex_78 0) (< 127 .cse125) (<= v_prenex_78 |c_gcd_test_#in~a|) (< 127 (mod (+ v_prenex_78 .cse126) 256)) (not (= .cse125 0)) (< 127 v_prenex_78) (<= (mod (+ (* 255 v_prenex_78) .cse126) 256) 127) (not (= .cse126 0)))))) .cse3) (or .cse2 (forall ((v_prenex_13 Int)) (let ((.cse128 (mod c_gcd_test_~a v_prenex_13))) (let ((.cse127 (mod .cse128 256))) (or (< 127 v_prenex_13) (<= v_prenex_13 |c_gcd_test_#in~a|) (= v_prenex_13 0) (<= .cse127 127) (< v_prenex_13 0) (<= (mod (+ (* 255 v_prenex_13) .cse128) 256) 127) (not (= 256 .cse127)) (<= (mod (+ v_prenex_13 .cse128) 256) 127))))) .cse3) (or .cse2 (forall ((v_prenex_44 Int)) (let ((.cse130 (mod c_gcd_test_~a v_prenex_44))) (let ((.cse129 (mod .cse130 256))) (or (not (= 256 .cse129)) (= v_prenex_44 0) (<= v_prenex_44 |c_gcd_test_#in~a|) (< v_prenex_44 0) (< 127 (mod (+ (* 255 v_prenex_44) .cse130) 256)) (<= (mod (+ v_prenex_44 .cse130) 256) 127) (< 127 v_prenex_44) (<= .cse129 127))))) .cse3))) is different from true [2018-10-27 00:11:44,140 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse14 (<= 0 c_gcd_test_~a)) (.cse2 (< c_gcd_test_~a 0)) (.cse3 (<= |c_gcd_test_#in~a| 0))) (and (or (forall ((v_prenex_48 Int)) (let ((.cse1 (mod c_gcd_test_~a v_prenex_48))) (let ((.cse0 (mod .cse1 256))) (or (<= .cse0 127) (not (= 256 .cse0)) (< v_prenex_48 0) (<= (mod (+ (* 255 v_prenex_48) .cse1) 256) 127) (< 127 v_prenex_48) (<= v_prenex_48 |c_gcd_test_#in~a|) (= v_prenex_48 0) (< 127 (mod (+ v_prenex_48 .cse1) 256)))))) .cse2 .cse3) (or (forall ((gcd_test_~b Int)) (let ((.cse4 (mod c_gcd_test_~a gcd_test_~b))) (let ((.cse5 (mod .cse4 256))) (or (<= gcd_test_~b |c_gcd_test_#in~a|) (not (= .cse4 0)) (< 127 (mod (+ gcd_test_~b .cse4) 256)) (< 127 (mod (+ (* 255 gcd_test_~b) .cse4) 256)) (= gcd_test_~b 0) (< gcd_test_~b 0) (< 127 .cse5) (< 127 gcd_test_~b) (not (= .cse5 0)))))) .cse3) (or .cse2 (forall ((v_prenex_35 Int)) (let ((.cse6 (mod c_gcd_test_~a v_prenex_35))) (let ((.cse7 (mod .cse6 256))) (or (<= (mod (+ v_prenex_35 .cse6) 256) 127) (not (= .cse7 0)) (< 127 v_prenex_35) (< 127 (mod (+ (* 255 v_prenex_35) .cse6) 256)) (< 127 .cse7) (= v_prenex_35 0) (<= 0 v_prenex_35) (<= v_prenex_35 |c_gcd_test_#in~a|))))) .cse3) (or .cse2 (forall ((v_prenex_52 Int)) (let ((.cse9 (mod c_gcd_test_~a v_prenex_52))) (let ((.cse8 (mod .cse9 256))) (or (not (= 256 .cse8)) (<= v_prenex_52 |c_gcd_test_#in~a|) (<= (mod (+ (* 255 v_prenex_52) .cse9) 256) 127) (= v_prenex_52 0) (not (= .cse9 0)) (<= .cse8 127) (<= 0 v_prenex_52) (< 127 v_prenex_52) (< 127 (mod (+ v_prenex_52 .cse9) 256)))))) .cse3) (or (forall ((v_prenex_87 Int)) (let ((.cse11 (mod c_gcd_test_~a v_prenex_87))) (let ((.cse10 (mod .cse11 256))) (or (<= 0 v_prenex_87) (<= v_prenex_87 |c_gcd_test_#in~a|) (< 127 .cse10) (not (= .cse11 0)) (< 127 v_prenex_87) (= v_prenex_87 0) (<= (mod (+ (* 255 v_prenex_87) .cse11) 256) 127) (< 127 (mod (+ v_prenex_87 .cse11) 256)) (not (= .cse10 0)))))) .cse3) (or (forall ((v_prenex_53 Int)) (let ((.cse12 (mod c_gcd_test_~a v_prenex_53))) (let ((.cse13 (mod (+ v_prenex_53 .cse12) 256))) (or (<= 0 v_prenex_53) (= .cse12 0) (< 127 (mod (+ (* 255 v_prenex_53) .cse12) 256)) (not (= .cse13 256)) (<= (mod .cse12 256) 127) (<= .cse13 127) (< 127 v_prenex_53) (<= v_prenex_53 |c_gcd_test_#in~a|) (= v_prenex_53 0))))) .cse3 .cse14) (or .cse2 (forall ((v_prenex_38 Int)) (let ((.cse15 (mod c_gcd_test_~a v_prenex_38))) (let ((.cse16 (mod .cse15 256))) (or (<= (mod (+ v_prenex_38 .cse15) 256) 127) (< 127 .cse16) (= v_prenex_38 0) (<= v_prenex_38 |c_gcd_test_#in~a|) (< v_prenex_38 0) (< 127 v_prenex_38) (not (= .cse16 0)) (< 127 (mod (+ (* 255 v_prenex_38) .cse15) 256)))))) .cse3) (or .cse2 (forall ((v_prenex_46 Int)) (let ((.cse18 (mod c_gcd_test_~a v_prenex_46))) (let ((.cse17 (mod .cse18 256))) (or (not (= 256 .cse17)) (<= 0 v_prenex_46) (<= (mod (+ v_prenex_46 .cse18) 256) 127) (= v_prenex_46 0) (< 127 v_prenex_46) (<= .cse17 127) (<= v_prenex_46 |c_gcd_test_#in~a|) (< 127 (mod (+ (* 255 v_prenex_46) .cse18) 256)))))) .cse3) (or (forall ((v_prenex_68 Int)) (let ((.cse19 (mod c_gcd_test_~a v_prenex_68))) (let ((.cse20 (mod .cse19 256))) (or (<= (mod (+ v_prenex_68 .cse19) 256) 127) (< v_prenex_68 0) (< 127 v_prenex_68) (<= .cse20 127) (not (= 256 .cse20)) (<= v_prenex_68 |c_gcd_test_#in~a|) (not (= .cse19 0)) (<= (mod (+ (* 255 v_prenex_68) .cse19) 256) 127) (= v_prenex_68 0))))) .cse3) (or (forall ((v_prenex_83 Int)) (let ((.cse22 (mod c_gcd_test_~a v_prenex_83))) (let ((.cse21 (mod .cse22 256))) (or (< 127 v_prenex_83) (<= .cse21 127) (not (= .cse22 0)) (<= (mod (+ (* 255 v_prenex_83) .cse22) 256) 127) (not (= 256 .cse21)) (<= v_prenex_83 |c_gcd_test_#in~a|) (< 127 (mod (+ v_prenex_83 .cse22) 256)) (<= 0 v_prenex_83) (= v_prenex_83 0))))) .cse3) (or .cse2 (forall ((v_prenex_4 Int)) (let ((.cse24 (mod c_gcd_test_~a v_prenex_4))) (let ((.cse23 (mod .cse24 256))) (or (<= 0 v_prenex_4) (< 127 .cse23) (< 127 (mod (+ v_prenex_4 .cse24) 256)) (= v_prenex_4 0) (not (= .cse23 0)) (<= v_prenex_4 |c_gcd_test_#in~a|) (< 127 v_prenex_4) (< 127 (mod (+ (* 255 v_prenex_4) .cse24) 256)))))) .cse3) (or .cse2 (forall ((v_prenex_10 Int)) (let ((.cse26 (mod c_gcd_test_~a v_prenex_10))) (let ((.cse25 (mod .cse26 256))) (or (not (= .cse25 0)) (<= (mod (+ v_prenex_10 .cse26) 256) 127) (<= (mod (+ (* 255 v_prenex_10) .cse26) 256) 127) (< v_prenex_10 0) (<= v_prenex_10 |c_gcd_test_#in~a|) (not (= .cse26 0)) (= v_prenex_10 0) (< 127 .cse25) (< 127 v_prenex_10))))) .cse3) (or (forall ((v_prenex_72 Int)) (let ((.cse27 (mod c_gcd_test_~a v_prenex_72))) (let ((.cse28 (mod (+ (* 255 v_prenex_72) .cse27) 256))) (or (< 127 (mod (+ v_prenex_72 .cse27) 256)) (= v_prenex_72 0) (<= (mod .cse27 256) 127) (<= v_prenex_72 |c_gcd_test_#in~a|) (< 127 v_prenex_72) (<= .cse28 127) (< v_prenex_72 0) (not (= .cse28 256)) (= .cse27 0))))) .cse3 .cse14) (or (forall ((v_prenex_55 Int)) (let ((.cse29 (mod c_gcd_test_~a v_prenex_55))) (let ((.cse30 (mod (+ (* 255 v_prenex_55) .cse29) 256))) (or (<= (mod .cse29 256) 127) (= v_prenex_55 0) (= .cse29 0) (< v_prenex_55 0) (<= v_prenex_55 |c_gcd_test_#in~a|) (not (= 0 .cse30)) (< 127 .cse30) (< 127 (mod (+ v_prenex_55 .cse29) 256)) (< 127 v_prenex_55))))) .cse3 .cse14) (or (forall ((v_prenex_86 Int)) (let ((.cse31 (mod c_gcd_test_~a v_prenex_86))) (let ((.cse32 (mod .cse31 256))) (or (<= (mod (+ (* 255 v_prenex_86) .cse31) 256) 127) (not (= 256 .cse32)) (<= .cse32 127) (<= (mod (+ v_prenex_86 .cse31) 256) 127) (not (= .cse31 0)) (< 127 v_prenex_86) (= v_prenex_86 0) (<= v_prenex_86 |c_gcd_test_#in~a|) (<= 0 v_prenex_86))))) .cse3) (or (forall ((v_prenex_16 Int)) (let ((.cse33 (mod c_gcd_test_~a v_prenex_16))) (let ((.cse34 (mod .cse33 256))) (or (<= (mod (+ (* 255 v_prenex_16) .cse33) 256) 127) (not (= 256 .cse34)) (< 127 v_prenex_16) (<= .cse34 127) (<= 0 v_prenex_16) (<= (mod (+ v_prenex_16 .cse33) 256) 127) (= v_prenex_16 0) (<= v_prenex_16 |c_gcd_test_#in~a|))))) .cse2 .cse3) (or (forall ((v_prenex_41 Int)) (let ((.cse35 (mod c_gcd_test_~a v_prenex_41))) (let ((.cse36 (mod (+ v_prenex_41 .cse35) 256))) (or (<= (mod .cse35 256) 127) (< 127 .cse36) (< 127 v_prenex_41) (not (= 0 .cse36)) (= .cse35 0) (= v_prenex_41 0) (<= (mod (+ (* 255 v_prenex_41) .cse35) 256) 127) (<= 0 v_prenex_41) (<= v_prenex_41 |c_gcd_test_#in~a|))))) .cse3 .cse14) (or .cse2 (forall ((v_prenex_76 Int)) (let ((.cse38 (mod c_gcd_test_~a v_prenex_76))) (let ((.cse37 (mod .cse38 256))) (or (< 127 v_prenex_76) (<= .cse37 127) (< 127 (mod (+ v_prenex_76 .cse38) 256)) (= v_prenex_76 0) (not (= .cse38 0)) (<= v_prenex_76 |c_gcd_test_#in~a|) (< v_prenex_76 0) (<= (mod (+ (* 255 v_prenex_76) .cse38) 256) 127) (not (= 256 .cse37)))))) .cse3) (or .cse2 (forall ((v_prenex_11 Int)) (let ((.cse40 (mod c_gcd_test_~a v_prenex_11))) (let ((.cse39 (mod .cse40 256))) (or (not (= .cse39 0)) (<= v_prenex_11 |c_gcd_test_#in~a|) (< 127 .cse39) (= v_prenex_11 0) (<= (mod (+ v_prenex_11 .cse40) 256) 127) (<= (mod (+ (* 255 v_prenex_11) .cse40) 256) 127) (< v_prenex_11 0) (< 127 v_prenex_11))))) .cse3) (or (forall ((v_prenex_73 Int)) (let ((.cse41 (mod c_gcd_test_~a v_prenex_73))) (let ((.cse42 (mod .cse41 256))) (or (< 127 (mod (+ v_prenex_73 .cse41) 256)) (<= v_prenex_73 |c_gcd_test_#in~a|) (<= (mod (+ (* 255 v_prenex_73) .cse41) 256) 127) (not (= .cse41 0)) (= v_prenex_73 0) (not (= 256 .cse42)) (< 127 v_prenex_73) (<= .cse42 127) (< v_prenex_73 0))))) .cse3) (or (forall ((v_prenex_59 Int)) (let ((.cse43 (mod c_gcd_test_~a v_prenex_59))) (let ((.cse44 (mod .cse43 256))) (or (< 127 (mod (+ (* 255 v_prenex_59) .cse43) 256)) (<= (mod (+ v_prenex_59 .cse43) 256) 127) (<= 0 v_prenex_59) (<= .cse44 127) (<= v_prenex_59 |c_gcd_test_#in~a|) (not (= .cse43 0)) (not (= 256 .cse44)) (< 127 v_prenex_59) (= v_prenex_59 0))))) .cse3) (or (forall ((v_prenex_80 Int)) (let ((.cse45 (mod c_gcd_test_~a v_prenex_80))) (let ((.cse46 (mod .cse45 256))) (or (not (= .cse45 0)) (< 127 v_prenex_80) (<= .cse46 127) (< v_prenex_80 0) (not (= 256 .cse46)) (<= (mod (+ v_prenex_80 .cse45) 256) 127) (< 127 (mod (+ (* 255 v_prenex_80) .cse45) 256)) (= v_prenex_80 0) (<= v_prenex_80 |c_gcd_test_#in~a|))))) .cse3) (or (forall ((v_prenex_39 Int)) (let ((.cse47 (mod c_gcd_test_~a v_prenex_39))) (let ((.cse48 (mod (+ (* 255 v_prenex_39) .cse47) 256))) (or (< 127 (mod .cse47 256)) (< v_prenex_39 0) (< 127 .cse48) (< 127 (mod (+ v_prenex_39 .cse47) 256)) (not (= 0 .cse48)) (< 127 v_prenex_39) (<= v_prenex_39 |c_gcd_test_#in~a|) (= .cse47 0) (= v_prenex_39 0))))) .cse3 .cse14) (or (forall ((v_prenex_25 Int)) (let ((.cse49 (mod c_gcd_test_~a v_prenex_25))) (let ((.cse50 (mod (+ (* 255 v_prenex_25) .cse49) 256))) (or (< 127 (mod .cse49 256)) (<= .cse50 127) (< 127 v_prenex_25) (< v_prenex_25 0) (= v_prenex_25 0) (not (= .cse50 256)) (= .cse49 0) (<= v_prenex_25 |c_gcd_test_#in~a|) (<= (mod (+ v_prenex_25 .cse49) 256) 127))))) .cse3 .cse14) (or (forall ((v_prenex_64 Int)) (let ((.cse51 (mod c_gcd_test_~a v_prenex_64))) (let ((.cse52 (mod .cse51 256))) (or (< 127 (mod (+ v_prenex_64 .cse51) 256)) (< v_prenex_64 0) (< 127 v_prenex_64) (<= .cse52 127) (<= v_prenex_64 |c_gcd_test_#in~a|) (< 127 (mod (+ (* 255 v_prenex_64) .cse51) 256)) (not (= 256 .cse52)) (= v_prenex_64 0) (not (= .cse51 0)))))) .cse3) (or (forall ((v_prenex_32 Int)) (let ((.cse54 (mod c_gcd_test_~a v_prenex_32))) (let ((.cse53 (mod .cse54 256))) (or (not (= .cse53 0)) (< 127 v_prenex_32) (not (= .cse54 0)) (<= (mod (+ (* 255 v_prenex_32) .cse54) 256) 127) (<= v_prenex_32 |c_gcd_test_#in~a|) (< 127 (mod (+ v_prenex_32 .cse54) 256)) (= v_prenex_32 0) (< v_prenex_32 0) (< 127 .cse53))))) .cse2 .cse3) (or (forall ((v_prenex_65 Int)) (let ((.cse55 (mod c_gcd_test_~a v_prenex_65))) (let ((.cse56 (mod (+ (* 255 v_prenex_65) .cse55) 256))) (or (= .cse55 0) (< v_prenex_65 0) (not (= .cse56 256)) (<= .cse56 127) (<= v_prenex_65 |c_gcd_test_#in~a|) (< 127 (mod .cse55 256)) (< 127 (mod (+ v_prenex_65 .cse55) 256)) (= v_prenex_65 0) (< 127 v_prenex_65))))) .cse3 .cse14) (or (forall ((v_prenex_54 Int)) (let ((.cse57 (mod c_gcd_test_~a v_prenex_54))) (let ((.cse58 (mod (+ (* 255 v_prenex_54) .cse57) 256))) (or (<= (mod (+ v_prenex_54 .cse57) 256) 127) (<= (mod .cse57 256) 127) (not (= 0 .cse58)) (< 127 .cse58) (= .cse57 0) (< 127 v_prenex_54) (<= v_prenex_54 |c_gcd_test_#in~a|) (= v_prenex_54 0) (< v_prenex_54 0))))) .cse3 .cse14) (or .cse2 (forall ((v_prenex_21 Int)) (let ((.cse59 (mod c_gcd_test_~a v_prenex_21))) (let ((.cse60 (mod .cse59 256))) (or (< 127 (mod (+ v_prenex_21 .cse59) 256)) (<= v_prenex_21 |c_gcd_test_#in~a|) (<= .cse60 127) (not (= 256 .cse60)) (< 127 v_prenex_21) (= v_prenex_21 0) (< 127 (mod (+ (* 255 v_prenex_21) .cse59) 256)) (not (= .cse59 0)) (<= 0 v_prenex_21))))) .cse3) (or (forall ((v_prenex_58 Int)) (let ((.cse62 (mod c_gcd_test_~a v_prenex_58))) (let ((.cse61 (mod (+ v_prenex_58 .cse62) 256))) (or (<= .cse61 127) (<= v_prenex_58 |c_gcd_test_#in~a|) (<= 0 v_prenex_58) (= .cse62 0) (< 127 v_prenex_58) (= v_prenex_58 0) (< 127 (mod (+ (* 255 v_prenex_58) .cse62) 256)) (< 127 (mod .cse62 256)) (not (= .cse61 256)))))) .cse3 .cse14) (or (forall ((v_prenex_27 Int)) (let ((.cse63 (mod c_gcd_test_~a v_prenex_27))) (let ((.cse64 (mod (+ v_prenex_27 .cse63) 256))) (or (<= (mod (+ (* 255 v_prenex_27) .cse63) 256) 127) (not (= .cse64 256)) (= .cse63 0) (<= .cse64 127) (<= v_prenex_27 |c_gcd_test_#in~a|) (< 127 v_prenex_27) (<= (mod .cse63 256) 127) (<= 0 v_prenex_27) (= v_prenex_27 0))))) .cse3 .cse14) (or (forall ((v_prenex_75 Int)) (let ((.cse66 (mod c_gcd_test_~a v_prenex_75))) (let ((.cse65 (mod .cse66 256))) (or (= v_prenex_75 0) (< 127 .cse65) (<= v_prenex_75 |c_gcd_test_#in~a|) (not (= .cse65 0)) (< 127 (mod (+ (* 255 v_prenex_75) .cse66) 256)) (<= (mod (+ v_prenex_75 .cse66) 256) 127) (< 127 v_prenex_75) (not (= .cse66 0)) (< v_prenex_75 0))))) .cse3) (or .cse2 (forall ((v_prenex_20 Int)) (let ((.cse68 (mod c_gcd_test_~a v_prenex_20))) (let ((.cse67 (mod .cse68 256))) (or (<= v_prenex_20 |c_gcd_test_#in~a|) (< v_prenex_20 0) (<= .cse67 127) (not (= .cse68 0)) (< 127 (mod (+ (* 255 v_prenex_20) .cse68) 256)) (< 127 (mod (+ v_prenex_20 .cse68) 256)) (not (= 256 .cse67)) (= v_prenex_20 0) (< 127 v_prenex_20))))) .cse3) (or .cse2 (forall ((v_prenex_45 Int)) (let ((.cse69 (mod c_gcd_test_~a v_prenex_45))) (let ((.cse70 (mod .cse69 256))) (or (< 127 (mod (+ (* 255 v_prenex_45) .cse69) 256)) (<= .cse70 127) (not (= .cse69 0)) (<= v_prenex_45 |c_gcd_test_#in~a|) (< v_prenex_45 0) (= v_prenex_45 0) (< 127 v_prenex_45) (<= (mod (+ v_prenex_45 .cse69) 256) 127) (not (= 256 .cse70)))))) .cse3) (or (forall ((v_prenex_28 Int)) (let ((.cse71 (mod c_gcd_test_~a v_prenex_28))) (let ((.cse72 (mod (+ (* 255 v_prenex_28) .cse71) 256))) (or (< 127 v_prenex_28) (<= (mod .cse71 256) 127) (<= .cse72 127) (= v_prenex_28 0) (= .cse71 0) (<= v_prenex_28 |c_gcd_test_#in~a|) (<= (mod (+ v_prenex_28 .cse71) 256) 127) (not (= .cse72 256)) (< v_prenex_28 0))))) .cse3 .cse14) (or .cse2 (forall ((v_prenex_29 Int)) (let ((.cse74 (mod c_gcd_test_~a v_prenex_29))) (let ((.cse73 (mod .cse74 256))) (or (not (= .cse73 0)) (<= v_prenex_29 |c_gcd_test_#in~a|) (< v_prenex_29 0) (<= (mod (+ (* 255 v_prenex_29) .cse74) 256) 127) (< 127 v_prenex_29) (< 127 .cse73) (= v_prenex_29 0) (< 127 (mod (+ v_prenex_29 .cse74) 256)))))) .cse3) (or (forall ((v_prenex_23 Int)) (let ((.cse76 (mod c_gcd_test_~a v_prenex_23))) (let ((.cse75 (mod (+ v_prenex_23 .cse76) 256))) (or (< 127 v_prenex_23) (<= 0 v_prenex_23) (= v_prenex_23 0) (not (= 0 .cse75)) (< 127 .cse75) (<= v_prenex_23 |c_gcd_test_#in~a|) (= .cse76 0) (< 127 (mod .cse76 256)) (<= (mod (+ (* 255 v_prenex_23) .cse76) 256) 127))))) .cse3 .cse14) (or (forall ((v_prenex_78 Int)) (let ((.cse78 (mod c_gcd_test_~a v_prenex_78))) (let ((.cse77 (mod .cse78 256))) (or (< v_prenex_78 0) (= v_prenex_78 0) (< 127 .cse77) (<= v_prenex_78 |c_gcd_test_#in~a|) (< 127 (mod (+ v_prenex_78 .cse78) 256)) (not (= .cse77 0)) (< 127 v_prenex_78) (<= (mod (+ (* 255 v_prenex_78) .cse78) 256) 127) (not (= .cse78 0)))))) .cse3) (or (forall ((v_prenex_84 Int)) (let ((.cse79 (mod c_gcd_test_~a v_prenex_84))) (let ((.cse80 (mod .cse79 256))) (or (not (= .cse79 0)) (= v_prenex_84 0) (< 127 v_prenex_84) (<= 0 v_prenex_84) (< 127 .cse80) (not (= .cse80 0)) (<= (mod (+ v_prenex_84 .cse79) 256) 127) (< 127 (mod (+ (* 255 v_prenex_84) .cse79) 256)) (<= v_prenex_84 |c_gcd_test_#in~a|))))) .cse3) (or .cse2 .cse3 (forall ((v_prenex_36 Int)) (let ((.cse82 (mod c_gcd_test_~a v_prenex_36))) (let ((.cse81 (mod .cse82 256))) (or (not (= .cse81 0)) (= v_prenex_36 0) (< 127 v_prenex_36) (not (= .cse82 0)) (< v_prenex_36 0) (<= (mod (+ v_prenex_36 .cse82) 256) 127) (< 127 (mod (+ (* 255 v_prenex_36) .cse82) 256)) (<= v_prenex_36 |c_gcd_test_#in~a|) (< 127 .cse81)))))) (or (forall ((v_prenex_56 Int)) (let ((.cse84 (mod c_gcd_test_~a v_prenex_56))) (let ((.cse83 (mod (+ v_prenex_56 .cse84) 256))) (or (< 127 .cse83) (not (= 0 .cse83)) (<= v_prenex_56 |c_gcd_test_#in~a|) (= v_prenex_56 0) (<= (mod .cse84 256) 127) (< 127 v_prenex_56) (= .cse84 0) (< 127 (mod (+ (* 255 v_prenex_56) .cse84) 256)) (<= 0 v_prenex_56))))) .cse3 .cse14) (or (forall ((v_prenex_7 Int)) (let ((.cse85 (mod c_gcd_test_~a v_prenex_7))) (let ((.cse86 (mod .cse85 256))) (or (<= 0 v_prenex_7) (< 127 (mod (+ (* 255 v_prenex_7) .cse85) 256)) (not (= .cse85 0)) (= v_prenex_7 0) (< 127 (mod (+ v_prenex_7 .cse85) 256)) (not (= .cse86 0)) (<= v_prenex_7 |c_gcd_test_#in~a|) (< 127 v_prenex_7) (< 127 .cse86))))) .cse2 .cse3) (or .cse2 (forall ((v_prenex_50 Int)) (let ((.cse87 (mod c_gcd_test_~a v_prenex_50))) (let ((.cse88 (mod .cse87 256))) (or (<= (mod (+ (* 255 v_prenex_50) .cse87) 256) 127) (not (= 256 .cse88)) (< 127 v_prenex_50) (<= .cse88 127) (< 127 (mod (+ v_prenex_50 .cse87) 256)) (<= 0 v_prenex_50) (<= v_prenex_50 |c_gcd_test_#in~a|) (= v_prenex_50 0))))) .cse3) (or .cse2 (forall ((v_prenex_62 Int)) (let ((.cse90 (mod c_gcd_test_~a v_prenex_62))) (let ((.cse89 (mod .cse90 256))) (or (<= .cse89 127) (< 127 v_prenex_62) (not (= .cse90 0)) (<= (mod (+ (* 255 v_prenex_62) .cse90) 256) 127) (<= 0 v_prenex_62) (<= v_prenex_62 |c_gcd_test_#in~a|) (= v_prenex_62 0) (not (= 256 .cse89)) (<= (mod (+ v_prenex_62 .cse90) 256) 127))))) .cse3) (or .cse2 (forall ((v_prenex_9 Int)) (let ((.cse91 (mod c_gcd_test_~a v_prenex_9))) (let ((.cse92 (mod .cse91 256))) (or (<= (mod (+ (* 255 v_prenex_9) .cse91) 256) 127) (< 127 v_prenex_9) (not (= .cse92 0)) (<= (mod (+ v_prenex_9 .cse91) 256) 127) (<= 0 v_prenex_9) (= v_prenex_9 0) (<= v_prenex_9 |c_gcd_test_#in~a|) (< 127 .cse92))))) .cse3) (or (forall ((v_prenex_57 Int)) (let ((.cse93 (mod c_gcd_test_~a v_prenex_57))) (let ((.cse94 (mod .cse93 256))) (or (< 127 v_prenex_57) (not (= .cse93 0)) (= v_prenex_57 0) (<= v_prenex_57 |c_gcd_test_#in~a|) (< 127 .cse94) (<= (mod (+ v_prenex_57 .cse93) 256) 127) (<= (mod (+ (* 255 v_prenex_57) .cse93) 256) 127) (not (= .cse94 0)) (< v_prenex_57 0))))) .cse3) (or (forall ((v_prenex_82 Int)) (let ((.cse96 (mod c_gcd_test_~a v_prenex_82))) (let ((.cse95 (mod .cse96 256))) (or (<= .cse95 127) (< 127 (mod (+ v_prenex_82 .cse96) 256)) (< 127 (mod (+ (* 255 v_prenex_82) .cse96) 256)) (= v_prenex_82 0) (not (= 256 .cse95)) (<= 0 v_prenex_82) (not (= .cse96 0)) (< 127 v_prenex_82) (<= v_prenex_82 |c_gcd_test_#in~a|))))) .cse3) (or .cse2 (forall ((v_prenex_31 Int)) (let ((.cse98 (mod c_gcd_test_~a v_prenex_31))) (let ((.cse97 (mod .cse98 256))) (or (< 127 .cse97) (<= (mod (+ (* 255 v_prenex_31) .cse98) 256) 127) (< 127 (mod (+ v_prenex_31 .cse98) 256)) (<= 0 v_prenex_31) (= v_prenex_31 0) (<= v_prenex_31 |c_gcd_test_#in~a|) (not (= .cse97 0)) (< 127 v_prenex_31))))) .cse3) (or .cse2 (forall ((v_prenex_6 Int)) (let ((.cse100 (mod c_gcd_test_~a v_prenex_6))) (let ((.cse99 (mod .cse100 256))) (or (not (= .cse99 0)) (< v_prenex_6 0) (< 127 (mod (+ v_prenex_6 .cse100) 256)) (< 127 v_prenex_6) (< 127 (mod (+ (* 255 v_prenex_6) .cse100) 256)) (< 127 .cse99) (<= v_prenex_6 |c_gcd_test_#in~a|) (= v_prenex_6 0) (not (= .cse100 0)))))) .cse3) (or .cse2 (forall ((v_prenex_12 Int)) (let ((.cse101 (mod c_gcd_test_~a v_prenex_12))) (let ((.cse102 (mod .cse101 256))) (or (= v_prenex_12 0) (<= 0 v_prenex_12) (<= (mod (+ (* 255 v_prenex_12) .cse101) 256) 127) (<= v_prenex_12 |c_gcd_test_#in~a|) (<= (mod (+ v_prenex_12 .cse101) 256) 127) (< 127 v_prenex_12) (not (= .cse101 0)) (not (= .cse102 0)) (< 127 .cse102))))) .cse3) (or .cse2 (forall ((v_prenex_19 Int)) (let ((.cse103 (mod c_gcd_test_~a v_prenex_19))) (let ((.cse104 (mod .cse103 256))) (or (< 127 (mod (+ v_prenex_19 .cse103) 256)) (<= 0 v_prenex_19) (< 127 (mod (+ (* 255 v_prenex_19) .cse103) 256)) (< 127 v_prenex_19) (<= v_prenex_19 |c_gcd_test_#in~a|) (= v_prenex_19 0) (not (= 256 .cse104)) (<= .cse104 127))))) .cse3) (or .cse2 (forall ((v_prenex_5 Int)) (let ((.cse105 (mod c_gcd_test_~a v_prenex_5))) (let ((.cse106 (mod .cse105 256))) (or (< 127 (mod (+ v_prenex_5 .cse105) 256)) (= v_prenex_5 0) (not (= .cse106 0)) (< 127 .cse106) (<= v_prenex_5 |c_gcd_test_#in~a|) (< 127 (mod (+ (* 255 v_prenex_5) .cse105) 256)) (< 127 v_prenex_5) (< v_prenex_5 0))))) .cse3) (or .cse2 (forall ((v_prenex_15 Int)) (let ((.cse107 (mod c_gcd_test_~a v_prenex_15))) (let ((.cse108 (mod .cse107 256))) (or (= v_prenex_15 0) (<= (mod (+ (* 255 v_prenex_15) .cse107) 256) 127) (<= .cse108 127) (< v_prenex_15 0) (not (= 256 .cse108)) (< 127 v_prenex_15) (<= (mod (+ v_prenex_15 .cse107) 256) 127) (not (= .cse107 0)) (<= v_prenex_15 |c_gcd_test_#in~a|))))) .cse3) (or .cse2 (forall ((v_prenex_69 Int)) (let ((.cse109 (mod c_gcd_test_~a v_prenex_69))) (let ((.cse110 (mod .cse109 256))) (or (< 127 (mod (+ v_prenex_69 .cse109) 256)) (not (= .cse110 0)) (<= v_prenex_69 |c_gcd_test_#in~a|) (not (= .cse109 0)) (< 127 v_prenex_69) (= v_prenex_69 0) (<= (mod (+ (* 255 v_prenex_69) .cse109) 256) 127) (<= 0 v_prenex_69) (< 127 .cse110))))) .cse3) (or (forall ((v_prenex_85 Int)) (let ((.cse111 (mod c_gcd_test_~a v_prenex_85))) (let ((.cse112 (mod .cse111 256))) (or (= v_prenex_85 0) (<= 0 v_prenex_85) (<= (mod (+ v_prenex_85 .cse111) 256) 127) (not (= .cse112 0)) (<= (mod (+ (* 255 v_prenex_85) .cse111) 256) 127) (< 127 v_prenex_85) (<= v_prenex_85 |c_gcd_test_#in~a|) (< 127 .cse112) (not (= .cse111 0)))))) .cse3) (or (forall ((v_prenex_26 Int)) (let ((.cse114 (mod c_gcd_test_~a v_prenex_26))) (let ((.cse113 (mod (+ v_prenex_26 .cse114) 256))) (or (not (= .cse113 256)) (< 127 (mod .cse114 256)) (<= .cse113 127) (<= (mod (+ (* 255 v_prenex_26) .cse114) 256) 127) (= .cse114 0) (<= 0 v_prenex_26) (= v_prenex_26 0) (< 127 v_prenex_26) (<= v_prenex_26 |c_gcd_test_#in~a|))))) .cse3 .cse14) (or (forall ((v_prenex_71 Int)) (let ((.cse115 (mod c_gcd_test_~a v_prenex_71))) (let ((.cse116 (mod (+ v_prenex_71 .cse115) 256))) (or (< 127 (mod .cse115 256)) (< 127 (mod (+ (* 255 v_prenex_71) .cse115) 256)) (<= v_prenex_71 |c_gcd_test_#in~a|) (not (= 0 .cse116)) (= .cse115 0) (= v_prenex_71 0) (<= 0 v_prenex_71) (< 127 .cse116) (< 127 v_prenex_71))))) .cse3 .cse14) (or .cse2 (forall ((v_prenex_22 Int)) (let ((.cse117 (mod c_gcd_test_~a v_prenex_22))) (let ((.cse118 (mod .cse117 256))) (or (< 127 (mod (+ v_prenex_22 .cse117) 256)) (not (= 256 .cse118)) (< 127 (mod (+ (* 255 v_prenex_22) .cse117) 256)) (< v_prenex_22 0) (= v_prenex_22 0) (<= v_prenex_22 |c_gcd_test_#in~a|) (< 127 v_prenex_22) (<= .cse118 127))))) .cse3) (or .cse2 (forall ((v_prenex_70 Int)) (let ((.cse120 (mod c_gcd_test_~a v_prenex_70))) (let ((.cse119 (mod .cse120 256))) (or (<= 0 v_prenex_70) (= v_prenex_70 0) (not (= .cse119 0)) (< 127 (mod (+ (* 255 v_prenex_70) .cse120) 256)) (<= v_prenex_70 |c_gcd_test_#in~a|) (<= (mod (+ v_prenex_70 .cse120) 256) 127) (< 127 v_prenex_70) (< 127 .cse119) (not (= .cse120 0)))))) .cse3) (or (forall ((v_prenex_1 Int)) (let ((.cse121 (mod c_gcd_test_~a v_prenex_1))) (let ((.cse122 (mod (+ (* 255 v_prenex_1) .cse121) 256))) (or (< 127 (mod .cse121 256)) (<= v_prenex_1 |c_gcd_test_#in~a|) (= .cse121 0) (= v_prenex_1 0) (<= (mod (+ v_prenex_1 .cse121) 256) 127) (< v_prenex_1 0) (< 127 v_prenex_1) (< 127 .cse122) (not (= 0 .cse122)))))) .cse3 .cse14) (or .cse2 (forall ((v_prenex_47 Int)) (let ((.cse124 (mod c_gcd_test_~a v_prenex_47))) (let ((.cse123 (mod .cse124 256))) (or (<= .cse123 127) (< 127 (mod (+ (* 255 v_prenex_47) .cse124) 256)) (<= 0 v_prenex_47) (not (= .cse124 0)) (<= v_prenex_47 |c_gcd_test_#in~a|) (= v_prenex_47 0) (< 127 v_prenex_47) (<= (mod (+ v_prenex_47 .cse124) 256) 127) (not (= 256 .cse123)))))) .cse3) (or (forall ((v_prenex_81 Int)) (let ((.cse125 (mod c_gcd_test_~a v_prenex_81))) (let ((.cse126 (mod .cse125 256))) (or (<= 0 v_prenex_81) (= v_prenex_81 0) (< 127 (mod (+ (* 255 v_prenex_81) .cse125) 256)) (< 127 v_prenex_81) (< 127 .cse126) (< 127 (mod (+ v_prenex_81 .cse125) 256)) (<= v_prenex_81 |c_gcd_test_#in~a|) (not (= .cse126 0)) (not (= .cse125 0)))))) .cse3) (or .cse2 (forall ((v_prenex_13 Int)) (let ((.cse128 (mod c_gcd_test_~a v_prenex_13))) (let ((.cse127 (mod .cse128 256))) (or (< 127 v_prenex_13) (<= v_prenex_13 |c_gcd_test_#in~a|) (= v_prenex_13 0) (<= .cse127 127) (< v_prenex_13 0) (<= (mod (+ (* 255 v_prenex_13) .cse128) 256) 127) (not (= 256 .cse127)) (<= (mod (+ v_prenex_13 .cse128) 256) 127))))) .cse3) (or .cse2 (forall ((v_prenex_44 Int)) (let ((.cse130 (mod c_gcd_test_~a v_prenex_44))) (let ((.cse129 (mod .cse130 256))) (or (not (= 256 .cse129)) (= v_prenex_44 0) (<= v_prenex_44 |c_gcd_test_#in~a|) (< v_prenex_44 0) (< 127 (mod (+ (* 255 v_prenex_44) .cse130) 256)) (<= (mod (+ v_prenex_44 .cse130) 256) 127) (< 127 v_prenex_44) (<= .cse129 127))))) .cse3))) is different from true [2018-10-27 00:11:46,376 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (<= 0 c_gcd_test_~a)) (.cse0 (< c_gcd_test_~a 0)) (.cse3 (<= |c_gcd_test_#in~a| 0))) (and (or .cse0 (forall ((v_prenex_81 Int)) (let ((.cse1 (mod c_gcd_test_~a v_prenex_81))) (let ((.cse2 (mod .cse1 256))) (or (<= 0 v_prenex_81) (= v_prenex_81 0) (< 127 (mod (+ (* 255 v_prenex_81) .cse1) 256)) (< 127 v_prenex_81) (< 127 .cse2) (< 127 (mod (+ v_prenex_81 .cse1) 256)) (<= v_prenex_81 |c_gcd_test_#in~a|) (not (= .cse2 0)) (not (= .cse1 0)))))) .cse3) (or .cse0 (forall ((v_prenex_56 Int)) (let ((.cse5 (mod c_gcd_test_~a v_prenex_56))) (let ((.cse4 (mod (+ v_prenex_56 .cse5) 256))) (or (< 127 .cse4) (not (= 0 .cse4)) (<= v_prenex_56 |c_gcd_test_#in~a|) (= v_prenex_56 0) (<= (mod .cse5 256) 127) (< 127 v_prenex_56) (= .cse5 0) (< 127 (mod (+ (* 255 v_prenex_56) .cse5) 256)) (<= 0 v_prenex_56))))) .cse3 .cse6) (or .cse0 (forall ((v_prenex_87 Int)) (let ((.cse8 (mod c_gcd_test_~a v_prenex_87))) (let ((.cse7 (mod .cse8 256))) (or (<= 0 v_prenex_87) (<= v_prenex_87 |c_gcd_test_#in~a|) (< 127 .cse7) (not (= .cse8 0)) (< 127 v_prenex_87) (= v_prenex_87 0) (<= (mod (+ (* 255 v_prenex_87) .cse8) 256) 127) (< 127 (mod (+ v_prenex_87 .cse8) 256)) (not (= .cse7 0)))))) .cse3) (or (forall ((v_prenex_48 Int)) (let ((.cse10 (mod c_gcd_test_~a v_prenex_48))) (let ((.cse9 (mod .cse10 256))) (or (<= .cse9 127) (not (= 256 .cse9)) (< v_prenex_48 0) (<= (mod (+ (* 255 v_prenex_48) .cse10) 256) 127) (< 127 v_prenex_48) (<= v_prenex_48 |c_gcd_test_#in~a|) (= v_prenex_48 0) (< 127 (mod (+ v_prenex_48 .cse10) 256)))))) .cse0 .cse3) (or .cse0 (forall ((v_prenex_25 Int)) (let ((.cse11 (mod c_gcd_test_~a v_prenex_25))) (let ((.cse12 (mod (+ (* 255 v_prenex_25) .cse11) 256))) (or (< 127 (mod .cse11 256)) (<= .cse12 127) (< 127 v_prenex_25) (< v_prenex_25 0) (= v_prenex_25 0) (not (= .cse12 256)) (= .cse11 0) (<= v_prenex_25 |c_gcd_test_#in~a|) (<= (mod (+ v_prenex_25 .cse11) 256) 127))))) .cse3 .cse6) (or .cse0 (forall ((v_prenex_35 Int)) (let ((.cse13 (mod c_gcd_test_~a v_prenex_35))) (let ((.cse14 (mod .cse13 256))) (or (<= (mod (+ v_prenex_35 .cse13) 256) 127) (not (= .cse14 0)) (< 127 v_prenex_35) (< 127 (mod (+ (* 255 v_prenex_35) .cse13) 256)) (< 127 .cse14) (= v_prenex_35 0) (<= 0 v_prenex_35) (<= v_prenex_35 |c_gcd_test_#in~a|))))) .cse3) (or .cse0 (forall ((v_prenex_26 Int)) (let ((.cse16 (mod c_gcd_test_~a v_prenex_26))) (let ((.cse15 (mod (+ v_prenex_26 .cse16) 256))) (or (not (= .cse15 256)) (< 127 (mod .cse16 256)) (<= .cse15 127) (<= (mod (+ (* 255 v_prenex_26) .cse16) 256) 127) (= .cse16 0) (<= 0 v_prenex_26) (= v_prenex_26 0) (< 127 v_prenex_26) (<= v_prenex_26 |c_gcd_test_#in~a|))))) .cse3 .cse6) (or .cse0 (forall ((v_prenex_52 Int)) (let ((.cse18 (mod c_gcd_test_~a v_prenex_52))) (let ((.cse17 (mod .cse18 256))) (or (not (= 256 .cse17)) (<= v_prenex_52 |c_gcd_test_#in~a|) (<= (mod (+ (* 255 v_prenex_52) .cse18) 256) 127) (= v_prenex_52 0) (not (= .cse18 0)) (<= .cse17 127) (<= 0 v_prenex_52) (< 127 v_prenex_52) (< 127 (mod (+ v_prenex_52 .cse18) 256)))))) .cse3) (or .cse0 (forall ((v_prenex_53 Int)) (let ((.cse19 (mod c_gcd_test_~a v_prenex_53))) (let ((.cse20 (mod (+ v_prenex_53 .cse19) 256))) (or (<= 0 v_prenex_53) (= .cse19 0) (< 127 (mod (+ (* 255 v_prenex_53) .cse19) 256)) (not (= .cse20 256)) (<= (mod .cse19 256) 127) (<= .cse20 127) (< 127 v_prenex_53) (<= v_prenex_53 |c_gcd_test_#in~a|) (= v_prenex_53 0))))) .cse3 .cse6) (or .cse0 (forall ((v_prenex_41 Int)) (let ((.cse21 (mod c_gcd_test_~a v_prenex_41))) (let ((.cse22 (mod (+ v_prenex_41 .cse21) 256))) (or (<= (mod .cse21 256) 127) (< 127 .cse22) (< 127 v_prenex_41) (not (= 0 .cse22)) (= .cse21 0) (= v_prenex_41 0) (<= (mod (+ (* 255 v_prenex_41) .cse21) 256) 127) (<= 0 v_prenex_41) (<= v_prenex_41 |c_gcd_test_#in~a|))))) .cse3 .cse6) (or .cse0 (forall ((v_prenex_38 Int)) (let ((.cse23 (mod c_gcd_test_~a v_prenex_38))) (let ((.cse24 (mod .cse23 256))) (or (<= (mod (+ v_prenex_38 .cse23) 256) 127) (< 127 .cse24) (= v_prenex_38 0) (<= v_prenex_38 |c_gcd_test_#in~a|) (< v_prenex_38 0) (< 127 v_prenex_38) (not (= .cse24 0)) (< 127 (mod (+ (* 255 v_prenex_38) .cse23) 256)))))) .cse3) (or .cse0 (forall ((v_prenex_46 Int)) (let ((.cse26 (mod c_gcd_test_~a v_prenex_46))) (let ((.cse25 (mod .cse26 256))) (or (not (= 256 .cse25)) (<= 0 v_prenex_46) (<= (mod (+ v_prenex_46 .cse26) 256) 127) (= v_prenex_46 0) (< 127 v_prenex_46) (<= .cse25 127) (<= v_prenex_46 |c_gcd_test_#in~a|) (< 127 (mod (+ (* 255 v_prenex_46) .cse26) 256)))))) .cse3) (or .cse0 (forall ((v_prenex_4 Int)) (let ((.cse28 (mod c_gcd_test_~a v_prenex_4))) (let ((.cse27 (mod .cse28 256))) (or (<= 0 v_prenex_4) (< 127 .cse27) (< 127 (mod (+ v_prenex_4 .cse28) 256)) (= v_prenex_4 0) (not (= .cse27 0)) (<= v_prenex_4 |c_gcd_test_#in~a|) (< 127 v_prenex_4) (< 127 (mod (+ (* 255 v_prenex_4) .cse28) 256)))))) .cse3) (or .cse0 (forall ((v_prenex_10 Int)) (let ((.cse30 (mod c_gcd_test_~a v_prenex_10))) (let ((.cse29 (mod .cse30 256))) (or (not (= .cse29 0)) (<= (mod (+ v_prenex_10 .cse30) 256) 127) (<= (mod (+ (* 255 v_prenex_10) .cse30) 256) 127) (< v_prenex_10 0) (<= v_prenex_10 |c_gcd_test_#in~a|) (not (= .cse30 0)) (= v_prenex_10 0) (< 127 .cse29) (< 127 v_prenex_10))))) .cse3) (or .cse0 (forall ((v_prenex_71 Int)) (let ((.cse31 (mod c_gcd_test_~a v_prenex_71))) (let ((.cse32 (mod (+ v_prenex_71 .cse31) 256))) (or (< 127 (mod .cse31 256)) (< 127 (mod (+ (* 255 v_prenex_71) .cse31) 256)) (<= v_prenex_71 |c_gcd_test_#in~a|) (not (= 0 .cse32)) (= .cse31 0) (= v_prenex_71 0) (<= 0 v_prenex_71) (< 127 .cse32) (< 127 v_prenex_71))))) .cse3 .cse6) (or .cse0 (forall ((v_prenex_64 Int)) (let ((.cse33 (mod c_gcd_test_~a v_prenex_64))) (let ((.cse34 (mod .cse33 256))) (or (< 127 (mod (+ v_prenex_64 .cse33) 256)) (< v_prenex_64 0) (< 127 v_prenex_64) (<= .cse34 127) (<= v_prenex_64 |c_gcd_test_#in~a|) (< 127 (mod (+ (* 255 v_prenex_64) .cse33) 256)) (not (= 256 .cse34)) (= v_prenex_64 0) (not (= .cse33 0)))))) .cse3) (or (forall ((v_prenex_16 Int)) (let ((.cse35 (mod c_gcd_test_~a v_prenex_16))) (let ((.cse36 (mod .cse35 256))) (or (<= (mod (+ (* 255 v_prenex_16) .cse35) 256) 127) (not (= 256 .cse36)) (< 127 v_prenex_16) (<= .cse36 127) (<= 0 v_prenex_16) (<= (mod (+ v_prenex_16 .cse35) 256) 127) (= v_prenex_16 0) (<= v_prenex_16 |c_gcd_test_#in~a|))))) .cse0 .cse3) (or .cse0 (forall ((v_prenex_76 Int)) (let ((.cse38 (mod c_gcd_test_~a v_prenex_76))) (let ((.cse37 (mod .cse38 256))) (or (< 127 v_prenex_76) (<= .cse37 127) (< 127 (mod (+ v_prenex_76 .cse38) 256)) (= v_prenex_76 0) (not (= .cse38 0)) (<= v_prenex_76 |c_gcd_test_#in~a|) (< v_prenex_76 0) (<= (mod (+ (* 255 v_prenex_76) .cse38) 256) 127) (not (= 256 .cse37)))))) .cse3) (or .cse0 (forall ((v_prenex_11 Int)) (let ((.cse40 (mod c_gcd_test_~a v_prenex_11))) (let ((.cse39 (mod .cse40 256))) (or (not (= .cse39 0)) (<= v_prenex_11 |c_gcd_test_#in~a|) (< 127 .cse39) (= v_prenex_11 0) (<= (mod (+ v_prenex_11 .cse40) 256) 127) (<= (mod (+ (* 255 v_prenex_11) .cse40) 256) 127) (< v_prenex_11 0) (< 127 v_prenex_11))))) .cse3) (or .cse0 (forall ((v_prenex_39 Int)) (let ((.cse41 (mod c_gcd_test_~a v_prenex_39))) (let ((.cse42 (mod (+ (* 255 v_prenex_39) .cse41) 256))) (or (< 127 (mod .cse41 256)) (< v_prenex_39 0) (< 127 .cse42) (< 127 (mod (+ v_prenex_39 .cse41) 256)) (not (= 0 .cse42)) (< 127 v_prenex_39) (<= v_prenex_39 |c_gcd_test_#in~a|) (= .cse41 0) (= v_prenex_39 0))))) .cse3 .cse6) (or .cse0 (forall ((v_prenex_83 Int)) (let ((.cse44 (mod c_gcd_test_~a v_prenex_83))) (let ((.cse43 (mod .cse44 256))) (or (< 127 v_prenex_83) (<= .cse43 127) (not (= .cse44 0)) (<= (mod (+ (* 255 v_prenex_83) .cse44) 256) 127) (not (= 256 .cse43)) (<= v_prenex_83 |c_gcd_test_#in~a|) (< 127 (mod (+ v_prenex_83 .cse44) 256)) (<= 0 v_prenex_83) (= v_prenex_83 0))))) .cse3) (or .cse0 (forall ((v_prenex_85 Int)) (let ((.cse45 (mod c_gcd_test_~a v_prenex_85))) (let ((.cse46 (mod .cse45 256))) (or (= v_prenex_85 0) (<= 0 v_prenex_85) (<= (mod (+ v_prenex_85 .cse45) 256) 127) (not (= .cse46 0)) (<= (mod (+ (* 255 v_prenex_85) .cse45) 256) 127) (< 127 v_prenex_85) (<= v_prenex_85 |c_gcd_test_#in~a|) (< 127 .cse46) (not (= .cse45 0)))))) .cse3) (or .cse0 (forall ((v_prenex_58 Int)) (let ((.cse48 (mod c_gcd_test_~a v_prenex_58))) (let ((.cse47 (mod (+ v_prenex_58 .cse48) 256))) (or (<= .cse47 127) (<= v_prenex_58 |c_gcd_test_#in~a|) (<= 0 v_prenex_58) (= .cse48 0) (< 127 v_prenex_58) (= v_prenex_58 0) (< 127 (mod (+ (* 255 v_prenex_58) .cse48) 256)) (< 127 (mod .cse48 256)) (not (= .cse47 256)))))) .cse3 .cse6) (or (forall ((v_prenex_32 Int)) (let ((.cse50 (mod c_gcd_test_~a v_prenex_32))) (let ((.cse49 (mod .cse50 256))) (or (not (= .cse49 0)) (< 127 v_prenex_32) (not (= .cse50 0)) (<= (mod (+ (* 255 v_prenex_32) .cse50) 256) 127) (<= v_prenex_32 |c_gcd_test_#in~a|) (< 127 (mod (+ v_prenex_32 .cse50) 256)) (= v_prenex_32 0) (< v_prenex_32 0) (< 127 .cse49))))) .cse0 .cse3) (or .cse0 (forall ((v_prenex_21 Int)) (let ((.cse51 (mod c_gcd_test_~a v_prenex_21))) (let ((.cse52 (mod .cse51 256))) (or (< 127 (mod (+ v_prenex_21 .cse51) 256)) (<= v_prenex_21 |c_gcd_test_#in~a|) (<= .cse52 127) (not (= 256 .cse52)) (< 127 v_prenex_21) (= v_prenex_21 0) (< 127 (mod (+ (* 255 v_prenex_21) .cse51) 256)) (not (= .cse51 0)) (<= 0 v_prenex_21))))) .cse3) (or .cse0 (forall ((gcd_test_~b Int)) (let ((.cse53 (mod c_gcd_test_~a gcd_test_~b))) (let ((.cse54 (mod .cse53 256))) (or (<= gcd_test_~b |c_gcd_test_#in~a|) (not (= .cse53 0)) (< 127 (mod (+ gcd_test_~b .cse53) 256)) (< 127 (mod (+ (* 255 gcd_test_~b) .cse53) 256)) (= gcd_test_~b 0) (< gcd_test_~b 0) (< 127 .cse54) (< 127 gcd_test_~b) (not (= .cse54 0)))))) .cse3) (or .cse0 (forall ((v_prenex_20 Int)) (let ((.cse56 (mod c_gcd_test_~a v_prenex_20))) (let ((.cse55 (mod .cse56 256))) (or (<= v_prenex_20 |c_gcd_test_#in~a|) (< v_prenex_20 0) (<= .cse55 127) (not (= .cse56 0)) (< 127 (mod (+ (* 255 v_prenex_20) .cse56) 256)) (< 127 (mod (+ v_prenex_20 .cse56) 256)) (not (= 256 .cse55)) (= v_prenex_20 0) (< 127 v_prenex_20))))) .cse3) (or .cse0 (forall ((v_prenex_57 Int)) (let ((.cse57 (mod c_gcd_test_~a v_prenex_57))) (let ((.cse58 (mod .cse57 256))) (or (< 127 v_prenex_57) (not (= .cse57 0)) (= v_prenex_57 0) (<= v_prenex_57 |c_gcd_test_#in~a|) (< 127 .cse58) (<= (mod (+ v_prenex_57 .cse57) 256) 127) (<= (mod (+ (* 255 v_prenex_57) .cse57) 256) 127) (not (= .cse58 0)) (< v_prenex_57 0))))) .cse3) (or .cse0 (forall ((v_prenex_45 Int)) (let ((.cse59 (mod c_gcd_test_~a v_prenex_45))) (let ((.cse60 (mod .cse59 256))) (or (< 127 (mod (+ (* 255 v_prenex_45) .cse59) 256)) (<= .cse60 127) (not (= .cse59 0)) (<= v_prenex_45 |c_gcd_test_#in~a|) (< v_prenex_45 0) (= v_prenex_45 0) (< 127 v_prenex_45) (<= (mod (+ v_prenex_45 .cse59) 256) 127) (not (= 256 .cse60)))))) .cse3) (or .cse0 (forall ((v_prenex_28 Int)) (let ((.cse61 (mod c_gcd_test_~a v_prenex_28))) (let ((.cse62 (mod (+ (* 255 v_prenex_28) .cse61) 256))) (or (< 127 v_prenex_28) (<= (mod .cse61 256) 127) (<= .cse62 127) (= v_prenex_28 0) (= .cse61 0) (<= v_prenex_28 |c_gcd_test_#in~a|) (<= (mod (+ v_prenex_28 .cse61) 256) 127) (not (= .cse62 256)) (< v_prenex_28 0))))) .cse3 .cse6) (or .cse0 (forall ((v_prenex_29 Int)) (let ((.cse64 (mod c_gcd_test_~a v_prenex_29))) (let ((.cse63 (mod .cse64 256))) (or (not (= .cse63 0)) (<= v_prenex_29 |c_gcd_test_#in~a|) (< v_prenex_29 0) (<= (mod (+ (* 255 v_prenex_29) .cse64) 256) 127) (< 127 v_prenex_29) (< 127 .cse63) (= v_prenex_29 0) (< 127 (mod (+ v_prenex_29 .cse64) 256)))))) .cse3) (or .cse0 (forall ((v_prenex_73 Int)) (let ((.cse65 (mod c_gcd_test_~a v_prenex_73))) (let ((.cse66 (mod .cse65 256))) (or (< 127 (mod (+ v_prenex_73 .cse65) 256)) (<= v_prenex_73 |c_gcd_test_#in~a|) (<= (mod (+ (* 255 v_prenex_73) .cse65) 256) 127) (not (= .cse65 0)) (= v_prenex_73 0) (not (= 256 .cse66)) (< 127 v_prenex_73) (<= .cse66 127) (< v_prenex_73 0))))) .cse3) (or .cse0 .cse3 (forall ((v_prenex_36 Int)) (let ((.cse68 (mod c_gcd_test_~a v_prenex_36))) (let ((.cse67 (mod .cse68 256))) (or (not (= .cse67 0)) (= v_prenex_36 0) (< 127 v_prenex_36) (not (= .cse68 0)) (< v_prenex_36 0) (<= (mod (+ v_prenex_36 .cse68) 256) 127) (< 127 (mod (+ (* 255 v_prenex_36) .cse68) 256)) (<= v_prenex_36 |c_gcd_test_#in~a|) (< 127 .cse67)))))) (or .cse0 (forall ((v_prenex_27 Int)) (let ((.cse69 (mod c_gcd_test_~a v_prenex_27))) (let ((.cse70 (mod (+ v_prenex_27 .cse69) 256))) (or (<= (mod (+ (* 255 v_prenex_27) .cse69) 256) 127) (not (= .cse70 256)) (= .cse69 0) (<= .cse70 127) (<= v_prenex_27 |c_gcd_test_#in~a|) (< 127 v_prenex_27) (<= (mod .cse69 256) 127) (<= 0 v_prenex_27) (= v_prenex_27 0))))) .cse3 .cse6) (or (forall ((v_prenex_7 Int)) (let ((.cse71 (mod c_gcd_test_~a v_prenex_7))) (let ((.cse72 (mod .cse71 256))) (or (<= 0 v_prenex_7) (< 127 (mod (+ (* 255 v_prenex_7) .cse71) 256)) (not (= .cse71 0)) (= v_prenex_7 0) (< 127 (mod (+ v_prenex_7 .cse71) 256)) (not (= .cse72 0)) (<= v_prenex_7 |c_gcd_test_#in~a|) (< 127 v_prenex_7) (< 127 .cse72))))) .cse0 .cse3) (or .cse0 (forall ((v_prenex_50 Int)) (let ((.cse73 (mod c_gcd_test_~a v_prenex_50))) (let ((.cse74 (mod .cse73 256))) (or (<= (mod (+ (* 255 v_prenex_50) .cse73) 256) 127) (not (= 256 .cse74)) (< 127 v_prenex_50) (<= .cse74 127) (< 127 (mod (+ v_prenex_50 .cse73) 256)) (<= 0 v_prenex_50) (<= v_prenex_50 |c_gcd_test_#in~a|) (= v_prenex_50 0))))) .cse3) (or .cse0 (forall ((v_prenex_62 Int)) (let ((.cse76 (mod c_gcd_test_~a v_prenex_62))) (let ((.cse75 (mod .cse76 256))) (or (<= .cse75 127) (< 127 v_prenex_62) (not (= .cse76 0)) (<= (mod (+ (* 255 v_prenex_62) .cse76) 256) 127) (<= 0 v_prenex_62) (<= v_prenex_62 |c_gcd_test_#in~a|) (= v_prenex_62 0) (not (= 256 .cse75)) (<= (mod (+ v_prenex_62 .cse76) 256) 127))))) .cse3) (or .cse0 (forall ((v_prenex_9 Int)) (let ((.cse77 (mod c_gcd_test_~a v_prenex_9))) (let ((.cse78 (mod .cse77 256))) (or (<= (mod (+ (* 255 v_prenex_9) .cse77) 256) 127) (< 127 v_prenex_9) (not (= .cse78 0)) (<= (mod (+ v_prenex_9 .cse77) 256) 127) (<= 0 v_prenex_9) (= v_prenex_9 0) (<= v_prenex_9 |c_gcd_test_#in~a|) (< 127 .cse78))))) .cse3) (or .cse0 (forall ((v_prenex_84 Int)) (let ((.cse79 (mod c_gcd_test_~a v_prenex_84))) (let ((.cse80 (mod .cse79 256))) (or (not (= .cse79 0)) (= v_prenex_84 0) (< 127 v_prenex_84) (<= 0 v_prenex_84) (< 127 .cse80) (not (= .cse80 0)) (<= (mod (+ v_prenex_84 .cse79) 256) 127) (< 127 (mod (+ (* 255 v_prenex_84) .cse79) 256)) (<= v_prenex_84 |c_gcd_test_#in~a|))))) .cse3) (or .cse0 (forall ((v_prenex_59 Int)) (let ((.cse81 (mod c_gcd_test_~a v_prenex_59))) (let ((.cse82 (mod .cse81 256))) (or (< 127 (mod (+ (* 255 v_prenex_59) .cse81) 256)) (<= (mod (+ v_prenex_59 .cse81) 256) 127) (<= 0 v_prenex_59) (<= .cse82 127) (<= v_prenex_59 |c_gcd_test_#in~a|) (not (= .cse81 0)) (not (= 256 .cse82)) (< 127 v_prenex_59) (= v_prenex_59 0))))) .cse3) (or .cse0 (forall ((v_prenex_86 Int)) (let ((.cse83 (mod c_gcd_test_~a v_prenex_86))) (let ((.cse84 (mod .cse83 256))) (or (<= (mod (+ (* 255 v_prenex_86) .cse83) 256) 127) (not (= 256 .cse84)) (<= .cse84 127) (<= (mod (+ v_prenex_86 .cse83) 256) 127) (not (= .cse83 0)) (< 127 v_prenex_86) (= v_prenex_86 0) (<= v_prenex_86 |c_gcd_test_#in~a|) (<= 0 v_prenex_86))))) .cse3) (or .cse0 (forall ((v_prenex_31 Int)) (let ((.cse86 (mod c_gcd_test_~a v_prenex_31))) (let ((.cse85 (mod .cse86 256))) (or (< 127 .cse85) (<= (mod (+ (* 255 v_prenex_31) .cse86) 256) 127) (< 127 (mod (+ v_prenex_31 .cse86) 256)) (<= 0 v_prenex_31) (= v_prenex_31 0) (<= v_prenex_31 |c_gcd_test_#in~a|) (not (= .cse85 0)) (< 127 v_prenex_31))))) .cse3) (or .cse0 (forall ((v_prenex_6 Int)) (let ((.cse88 (mod c_gcd_test_~a v_prenex_6))) (let ((.cse87 (mod .cse88 256))) (or (not (= .cse87 0)) (< v_prenex_6 0) (< 127 (mod (+ v_prenex_6 .cse88) 256)) (< 127 v_prenex_6) (< 127 (mod (+ (* 255 v_prenex_6) .cse88) 256)) (< 127 .cse87) (<= v_prenex_6 |c_gcd_test_#in~a|) (= v_prenex_6 0) (not (= .cse88 0)))))) .cse3) (or .cse0 (forall ((v_prenex_12 Int)) (let ((.cse89 (mod c_gcd_test_~a v_prenex_12))) (let ((.cse90 (mod .cse89 256))) (or (= v_prenex_12 0) (<= 0 v_prenex_12) (<= (mod (+ (* 255 v_prenex_12) .cse89) 256) 127) (<= v_prenex_12 |c_gcd_test_#in~a|) (<= (mod (+ v_prenex_12 .cse89) 256) 127) (< 127 v_prenex_12) (not (= .cse89 0)) (not (= .cse90 0)) (< 127 .cse90))))) .cse3) (or .cse0 (forall ((v_prenex_19 Int)) (let ((.cse91 (mod c_gcd_test_~a v_prenex_19))) (let ((.cse92 (mod .cse91 256))) (or (< 127 (mod (+ v_prenex_19 .cse91) 256)) (<= 0 v_prenex_19) (< 127 (mod (+ (* 255 v_prenex_19) .cse91) 256)) (< 127 v_prenex_19) (<= v_prenex_19 |c_gcd_test_#in~a|) (= v_prenex_19 0) (not (= 256 .cse92)) (<= .cse92 127))))) .cse3) (or .cse0 (forall ((v_prenex_65 Int)) (let ((.cse93 (mod c_gcd_test_~a v_prenex_65))) (let ((.cse94 (mod (+ (* 255 v_prenex_65) .cse93) 256))) (or (= .cse93 0) (< v_prenex_65 0) (not (= .cse94 256)) (<= .cse94 127) (<= v_prenex_65 |c_gcd_test_#in~a|) (< 127 (mod .cse93 256)) (< 127 (mod (+ v_prenex_65 .cse93) 256)) (= v_prenex_65 0) (< 127 v_prenex_65))))) .cse3 .cse6) (or .cse0 (forall ((v_prenex_54 Int)) (let ((.cse95 (mod c_gcd_test_~a v_prenex_54))) (let ((.cse96 (mod (+ (* 255 v_prenex_54) .cse95) 256))) (or (<= (mod (+ v_prenex_54 .cse95) 256) 127) (<= (mod .cse95 256) 127) (not (= 0 .cse96)) (< 127 .cse96) (= .cse95 0) (< 127 v_prenex_54) (<= v_prenex_54 |c_gcd_test_#in~a|) (= v_prenex_54 0) (< v_prenex_54 0))))) .cse3 .cse6) (or .cse0 (forall ((v_prenex_5 Int)) (let ((.cse97 (mod c_gcd_test_~a v_prenex_5))) (let ((.cse98 (mod .cse97 256))) (or (< 127 (mod (+ v_prenex_5 .cse97) 256)) (= v_prenex_5 0) (not (= .cse98 0)) (< 127 .cse98) (<= v_prenex_5 |c_gcd_test_#in~a|) (< 127 (mod (+ (* 255 v_prenex_5) .cse97) 256)) (< 127 v_prenex_5) (< v_prenex_5 0))))) .cse3) (or .cse0 (forall ((v_prenex_72 Int)) (let ((.cse99 (mod c_gcd_test_~a v_prenex_72))) (let ((.cse100 (mod (+ (* 255 v_prenex_72) .cse99) 256))) (or (< 127 (mod (+ v_prenex_72 .cse99) 256)) (= v_prenex_72 0) (<= (mod .cse99 256) 127) (<= v_prenex_72 |c_gcd_test_#in~a|) (< 127 v_prenex_72) (<= .cse100 127) (< v_prenex_72 0) (not (= .cse100 256)) (= .cse99 0))))) .cse3 .cse6) (or .cse0 (forall ((v_prenex_15 Int)) (let ((.cse101 (mod c_gcd_test_~a v_prenex_15))) (let ((.cse102 (mod .cse101 256))) (or (= v_prenex_15 0) (<= (mod (+ (* 255 v_prenex_15) .cse101) 256) 127) (<= .cse102 127) (< v_prenex_15 0) (not (= 256 .cse102)) (< 127 v_prenex_15) (<= (mod (+ v_prenex_15 .cse101) 256) 127) (not (= .cse101 0)) (<= v_prenex_15 |c_gcd_test_#in~a|))))) .cse3) (or .cse0 (forall ((v_prenex_69 Int)) (let ((.cse103 (mod c_gcd_test_~a v_prenex_69))) (let ((.cse104 (mod .cse103 256))) (or (< 127 (mod (+ v_prenex_69 .cse103) 256)) (not (= .cse104 0)) (<= v_prenex_69 |c_gcd_test_#in~a|) (not (= .cse103 0)) (< 127 v_prenex_69) (= v_prenex_69 0) (<= (mod (+ (* 255 v_prenex_69) .cse103) 256) 127) (<= 0 v_prenex_69) (< 127 .cse104))))) .cse3) (or .cse0 (forall ((v_prenex_78 Int)) (let ((.cse106 (mod c_gcd_test_~a v_prenex_78))) (let ((.cse105 (mod .cse106 256))) (or (< v_prenex_78 0) (= v_prenex_78 0) (< 127 .cse105) (<= v_prenex_78 |c_gcd_test_#in~a|) (< 127 (mod (+ v_prenex_78 .cse106) 256)) (not (= .cse105 0)) (< 127 v_prenex_78) (<= (mod (+ (* 255 v_prenex_78) .cse106) 256) 127) (not (= .cse106 0)))))) .cse3) (or .cse0 (forall ((v_prenex_22 Int)) (let ((.cse107 (mod c_gcd_test_~a v_prenex_22))) (let ((.cse108 (mod .cse107 256))) (or (< 127 (mod (+ v_prenex_22 .cse107) 256)) (not (= 256 .cse108)) (< 127 (mod (+ (* 255 v_prenex_22) .cse107) 256)) (< v_prenex_22 0) (= v_prenex_22 0) (<= v_prenex_22 |c_gcd_test_#in~a|) (< 127 v_prenex_22) (<= .cse108 127))))) .cse3) (or .cse0 (forall ((v_prenex_80 Int)) (let ((.cse109 (mod c_gcd_test_~a v_prenex_80))) (let ((.cse110 (mod .cse109 256))) (or (not (= .cse109 0)) (< 127 v_prenex_80) (<= .cse110 127) (< v_prenex_80 0) (not (= 256 .cse110)) (<= (mod (+ v_prenex_80 .cse109) 256) 127) (< 127 (mod (+ (* 255 v_prenex_80) .cse109) 256)) (= v_prenex_80 0) (<= v_prenex_80 |c_gcd_test_#in~a|))))) .cse3) (or .cse0 (forall ((v_prenex_70 Int)) (let ((.cse112 (mod c_gcd_test_~a v_prenex_70))) (let ((.cse111 (mod .cse112 256))) (or (<= 0 v_prenex_70) (= v_prenex_70 0) (not (= .cse111 0)) (< 127 (mod (+ (* 255 v_prenex_70) .cse112) 256)) (<= v_prenex_70 |c_gcd_test_#in~a|) (<= (mod (+ v_prenex_70 .cse112) 256) 127) (< 127 v_prenex_70) (< 127 .cse111) (not (= .cse112 0)))))) .cse3) (or .cse0 (forall ((v_prenex_68 Int)) (let ((.cse113 (mod c_gcd_test_~a v_prenex_68))) (let ((.cse114 (mod .cse113 256))) (or (<= (mod (+ v_prenex_68 .cse113) 256) 127) (< v_prenex_68 0) (< 127 v_prenex_68) (<= .cse114 127) (not (= 256 .cse114)) (<= v_prenex_68 |c_gcd_test_#in~a|) (not (= .cse113 0)) (<= (mod (+ (* 255 v_prenex_68) .cse113) 256) 127) (= v_prenex_68 0))))) .cse3) (or .cse0 (forall ((v_prenex_47 Int)) (let ((.cse116 (mod c_gcd_test_~a v_prenex_47))) (let ((.cse115 (mod .cse116 256))) (or (<= .cse115 127) (< 127 (mod (+ (* 255 v_prenex_47) .cse116) 256)) (<= 0 v_prenex_47) (not (= .cse116 0)) (<= v_prenex_47 |c_gcd_test_#in~a|) (= v_prenex_47 0) (< 127 v_prenex_47) (<= (mod (+ v_prenex_47 .cse116) 256) 127) (not (= 256 .cse115)))))) .cse3) (or .cse0 (forall ((v_prenex_82 Int)) (let ((.cse118 (mod c_gcd_test_~a v_prenex_82))) (let ((.cse117 (mod .cse118 256))) (or (<= .cse117 127) (< 127 (mod (+ v_prenex_82 .cse118) 256)) (< 127 (mod (+ (* 255 v_prenex_82) .cse118) 256)) (= v_prenex_82 0) (not (= 256 .cse117)) (<= 0 v_prenex_82) (not (= .cse118 0)) (< 127 v_prenex_82) (<= v_prenex_82 |c_gcd_test_#in~a|))))) .cse3) (or .cse0 (forall ((v_prenex_23 Int)) (let ((.cse120 (mod c_gcd_test_~a v_prenex_23))) (let ((.cse119 (mod (+ v_prenex_23 .cse120) 256))) (or (< 127 v_prenex_23) (<= 0 v_prenex_23) (= v_prenex_23 0) (not (= 0 .cse119)) (< 127 .cse119) (<= v_prenex_23 |c_gcd_test_#in~a|) (= .cse120 0) (< 127 (mod .cse120 256)) (<= (mod (+ (* 255 v_prenex_23) .cse120) 256) 127))))) .cse3 .cse6) (or .cse0 (forall ((v_prenex_75 Int)) (let ((.cse122 (mod c_gcd_test_~a v_prenex_75))) (let ((.cse121 (mod .cse122 256))) (or (= v_prenex_75 0) (< 127 .cse121) (<= v_prenex_75 |c_gcd_test_#in~a|) (not (= .cse121 0)) (< 127 (mod (+ (* 255 v_prenex_75) .cse122) 256)) (<= (mod (+ v_prenex_75 .cse122) 256) 127) (< 127 v_prenex_75) (not (= .cse122 0)) (< v_prenex_75 0))))) .cse3) (or .cse0 (forall ((v_prenex_13 Int)) (let ((.cse124 (mod c_gcd_test_~a v_prenex_13))) (let ((.cse123 (mod .cse124 256))) (or (< 127 v_prenex_13) (<= v_prenex_13 |c_gcd_test_#in~a|) (= v_prenex_13 0) (<= .cse123 127) (< v_prenex_13 0) (<= (mod (+ (* 255 v_prenex_13) .cse124) 256) 127) (not (= 256 .cse123)) (<= (mod (+ v_prenex_13 .cse124) 256) 127))))) .cse3) (or .cse0 (forall ((v_prenex_1 Int)) (let ((.cse125 (mod c_gcd_test_~a v_prenex_1))) (let ((.cse126 (mod (+ (* 255 v_prenex_1) .cse125) 256))) (or (< 127 (mod .cse125 256)) (<= v_prenex_1 |c_gcd_test_#in~a|) (= .cse125 0) (= v_prenex_1 0) (<= (mod (+ v_prenex_1 .cse125) 256) 127) (< v_prenex_1 0) (< 127 v_prenex_1) (< 127 .cse126) (not (= 0 .cse126)))))) .cse3 .cse6) (or .cse0 (forall ((v_prenex_55 Int)) (let ((.cse127 (mod c_gcd_test_~a v_prenex_55))) (let ((.cse128 (mod (+ (* 255 v_prenex_55) .cse127) 256))) (or (<= (mod .cse127 256) 127) (= v_prenex_55 0) (= .cse127 0) (< v_prenex_55 0) (<= v_prenex_55 |c_gcd_test_#in~a|) (not (= 0 .cse128)) (< 127 .cse128) (< 127 (mod (+ v_prenex_55 .cse127) 256)) (< 127 v_prenex_55))))) .cse3 .cse6) (or .cse0 (forall ((v_prenex_44 Int)) (let ((.cse130 (mod c_gcd_test_~a v_prenex_44))) (let ((.cse129 (mod .cse130 256))) (or (not (= 256 .cse129)) (= v_prenex_44 0) (<= v_prenex_44 |c_gcd_test_#in~a|) (< v_prenex_44 0) (< 127 (mod (+ (* 255 v_prenex_44) .cse130) 256)) (<= (mod (+ v_prenex_44 .cse130) 256) 127) (< 127 v_prenex_44) (<= .cse129 127))))) .cse3))) is different from true [2018-10-27 00:11:48,543 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse20 (<= 0 |c_gcd_test_#in~a|)) (.cse0 (< |c_gcd_test_#in~a| 0)) (.cse3 (<= |c_gcd_test_#in~a| 0))) (and (or .cse0 (forall ((v_prenex_52 Int)) (let ((.cse2 (mod |c_gcd_test_#in~a| v_prenex_52))) (let ((.cse1 (mod .cse2 256))) (or (<= .cse1 127) (not (= 0 .cse2)) (<= v_prenex_52 |c_gcd_test_#in~a|) (= v_prenex_52 0) (not (= .cse1 256)) (<= (mod (+ .cse2 (* 255 v_prenex_52)) 256) 127) (<= 0 v_prenex_52) (< 127 (mod (+ .cse2 v_prenex_52) 256)) (< 127 v_prenex_52))))) .cse3) (or (forall ((v_prenex_16 Int)) (let ((.cse4 (mod |c_gcd_test_#in~a| v_prenex_16))) (let ((.cse5 (mod .cse4 256))) (or (<= (mod (+ v_prenex_16 .cse4) 256) 127) (< 127 v_prenex_16) (<= 0 v_prenex_16) (not (= 256 .cse5)) (<= .cse5 127) (= v_prenex_16 0) (<= v_prenex_16 |c_gcd_test_#in~a|) (<= (mod (+ (* 255 v_prenex_16) .cse4) 256) 127))))) .cse0 .cse3) (or .cse0 (forall ((v_prenex_22 Int)) (let ((.cse6 (mod |c_gcd_test_#in~a| v_prenex_22))) (let ((.cse7 (mod .cse6 256))) (or (< v_prenex_22 0) (= v_prenex_22 0) (<= v_prenex_22 |c_gcd_test_#in~a|) (< 127 v_prenex_22) (< 127 (mod (+ v_prenex_22 .cse6) 256)) (< 127 (mod (+ (* 255 v_prenex_22) .cse6) 256)) (<= .cse7 127) (not (= .cse7 256)))))) .cse3) (or .cse0 (forall ((v_prenex_29 Int)) (let ((.cse9 (mod |c_gcd_test_#in~a| v_prenex_29))) (let ((.cse8 (mod .cse9 256))) (or (not (= 0 .cse8)) (<= v_prenex_29 |c_gcd_test_#in~a|) (< v_prenex_29 0) (< 127 v_prenex_29) (= v_prenex_29 0) (< 127 .cse8) (< 127 (mod (+ .cse9 v_prenex_29) 256)) (<= (mod (+ .cse9 (* 255 v_prenex_29)) 256) 127))))) .cse3) (or .cse0 (forall ((v_prenex_9 Int)) (let ((.cse11 (mod |c_gcd_test_#in~a| v_prenex_9))) (let ((.cse10 (mod .cse11 256))) (or (not (= 0 .cse10)) (<= (mod (+ .cse11 (* 255 v_prenex_9)) 256) 127) (< 127 v_prenex_9) (<= 0 v_prenex_9) (< 127 .cse10) (= v_prenex_9 0) (<= v_prenex_9 |c_gcd_test_#in~a|) (<= (mod (+ .cse11 v_prenex_9) 256) 127))))) .cse3) (or .cse0 (forall ((v_prenex_86 Int)) (let ((.cse12 (mod |c_gcd_test_#in~a| v_prenex_86))) (let ((.cse13 (mod .cse12 256))) (or (not (= 0 .cse12)) (not (= 256 .cse13)) (<= (mod (+ .cse12 (* 255 v_prenex_86)) 256) 127) (<= .cse13 127) (< 127 v_prenex_86) (= v_prenex_86 0) (<= v_prenex_86 |c_gcd_test_#in~a|) (<= (mod (+ .cse12 v_prenex_86) 256) 127) (<= 0 v_prenex_86))))) .cse3) (or (forall ((v_prenex_84 Int)) (let ((.cse14 (mod |c_gcd_test_#in~a| v_prenex_84))) (let ((.cse15 (mod .cse14 256))) (or (< 127 (mod (+ (* 255 v_prenex_84) .cse14) 256)) (<= (mod (+ v_prenex_84 .cse14) 256) 127) (= v_prenex_84 0) (< 127 v_prenex_84) (< 127 .cse15) (<= 0 v_prenex_84) (not (= 0 .cse15)) (not (= 0 .cse14)) (<= v_prenex_84 |c_gcd_test_#in~a|))))) .cse0 .cse3) (or .cse0 (forall ((v_prenex_20 Int)) (let ((.cse16 (mod |c_gcd_test_#in~a| v_prenex_20))) (let ((.cse17 (mod .cse16 256))) (or (< 127 (mod (+ v_prenex_20 .cse16) 256)) (<= v_prenex_20 |c_gcd_test_#in~a|) (< v_prenex_20 0) (< 127 (mod (+ (* 255 v_prenex_20) .cse16) 256)) (not (= 0 .cse16)) (<= .cse17 127) (not (= 256 .cse17)) (= v_prenex_20 0) (< 127 v_prenex_20))))) .cse3) (or (forall ((v_prenex_27 Int)) (let ((.cse18 (mod |c_gcd_test_#in~a| v_prenex_27))) (let ((.cse19 (mod (+ v_prenex_27 .cse18) 256))) (or (<= (mod .cse18 256) 127) (<= (mod (+ (* 255 v_prenex_27) .cse18) 256) 127) (<= v_prenex_27 |c_gcd_test_#in~a|) (< 127 v_prenex_27) (not (= 256 .cse19)) (<= 0 v_prenex_27) (= 0 .cse18) (<= .cse19 127) (= v_prenex_27 0))))) .cse0 .cse20 .cse3) (or .cse0 (forall ((v_prenex_76 Int)) (let ((.cse21 (mod |c_gcd_test_#in~a| v_prenex_76))) (let ((.cse22 (mod .cse21 256))) (or (< 127 v_prenex_76) (<= (mod (+ (* 255 v_prenex_76) .cse21) 256) 127) (= v_prenex_76 0) (<= .cse22 127) (<= v_prenex_76 |c_gcd_test_#in~a|) (< v_prenex_76 0) (not (= 0 .cse21)) (not (= 256 .cse22)) (< 127 (mod (+ v_prenex_76 .cse21) 256)))))) .cse3) (or .cse0 (forall ((v_prenex_78 Int)) (let ((.cse24 (mod |c_gcd_test_#in~a| v_prenex_78))) (let ((.cse23 (mod .cse24 256))) (or (< v_prenex_78 0) (not (= 0 .cse23)) (= v_prenex_78 0) (<= (mod (+ (* 255 v_prenex_78) .cse24) 256) 127) (< 127 .cse23) (not (= 0 .cse24)) (<= v_prenex_78 |c_gcd_test_#in~a|) (< 127 v_prenex_78) (< 127 (mod (+ v_prenex_78 .cse24) 256)))))) .cse3) (or (forall ((v_prenex_82 Int)) (let ((.cse26 (mod |c_gcd_test_#in~a| v_prenex_82))) (let ((.cse25 (mod .cse26 256))) (or (<= .cse25 127) (not (= .cse25 256)) (= v_prenex_82 0) (< 127 (mod (+ .cse26 (* 255 v_prenex_82)) 256)) (<= 0 v_prenex_82) (not (= 0 .cse26)) (< 127 v_prenex_82) (< 127 (mod (+ .cse26 v_prenex_82) 256)) (<= v_prenex_82 |c_gcd_test_#in~a|))))) .cse0 .cse3) (or .cse0 .cse20 (forall ((v_prenex_25 Int)) (let ((.cse27 (mod |c_gcd_test_#in~a| v_prenex_25))) (let ((.cse28 (mod (+ (* 255 v_prenex_25) .cse27) 256))) (or (< 127 v_prenex_25) (< 127 (mod .cse27 256)) (< v_prenex_25 0) (= v_prenex_25 0) (<= v_prenex_25 |c_gcd_test_#in~a|) (<= (mod (+ v_prenex_25 .cse27) 256) 127) (not (= .cse28 256)) (= 0 .cse27) (<= .cse28 127))))) .cse3) (or (forall ((v_prenex_75 Int)) (let ((.cse30 (mod |c_gcd_test_#in~a| v_prenex_75))) (let ((.cse29 (mod .cse30 256))) (or (< 127 .cse29) (= v_prenex_75 0) (not (= .cse30 0)) (not (= .cse29 0)) (<= v_prenex_75 |c_gcd_test_#in~a|) (<= (mod (+ .cse30 v_prenex_75) 256) 127) (< 127 (mod (+ .cse30 (* 255 v_prenex_75)) 256)) (< 127 v_prenex_75) (< v_prenex_75 0))))) .cse0 .cse3) (or (forall ((v_prenex_53 Int)) (let ((.cse31 (mod |c_gcd_test_#in~a| v_prenex_53))) (let ((.cse32 (mod (+ .cse31 v_prenex_53) 256))) (or (<= 0 v_prenex_53) (< 127 (mod (+ .cse31 (* 255 v_prenex_53)) 256)) (= 0 .cse31) (<= (mod .cse31 256) 127) (<= .cse32 127) (not (= .cse32 256)) (< 127 v_prenex_53) (<= v_prenex_53 |c_gcd_test_#in~a|) (= v_prenex_53 0))))) .cse0 .cse20 .cse3) (or .cse0 (forall ((v_prenex_80 Int)) (let ((.cse33 (mod |c_gcd_test_#in~a| v_prenex_80))) (let ((.cse34 (mod .cse33 256))) (or (< 127 v_prenex_80) (not (= 0 .cse33)) (< v_prenex_80 0) (<= (mod (+ .cse33 v_prenex_80) 256) 127) (< 127 (mod (+ .cse33 (* 255 v_prenex_80)) 256)) (not (= .cse34 256)) (= v_prenex_80 0) (<= .cse34 127) (<= v_prenex_80 |c_gcd_test_#in~a|))))) .cse3) (or .cse0 (forall ((v_prenex_4 Int)) (let ((.cse36 (mod |c_gcd_test_#in~a| v_prenex_4))) (let ((.cse35 (mod .cse36 256))) (or (<= 0 v_prenex_4) (= v_prenex_4 0) (<= v_prenex_4 |c_gcd_test_#in~a|) (< 127 v_prenex_4) (< 127 .cse35) (< 127 (mod (+ (* 255 v_prenex_4) .cse36) 256)) (not (= .cse35 0)) (< 127 (mod (+ v_prenex_4 .cse36) 256)))))) .cse3) (or .cse0 (forall ((v_prenex_59 Int)) (let ((.cse38 (mod |c_gcd_test_#in~a| v_prenex_59))) (let ((.cse37 (mod .cse38 256))) (or (not (= .cse37 256)) (<= 0 v_prenex_59) (<= v_prenex_59 |c_gcd_test_#in~a|) (not (= 0 .cse38)) (< 127 v_prenex_59) (<= (mod (+ v_prenex_59 .cse38) 256) 127) (= v_prenex_59 0) (< 127 (mod (+ (* 255 v_prenex_59) .cse38) 256)) (<= .cse37 127))))) .cse3) (or .cse0 .cse20 (forall ((v_prenex_72 Int)) (let ((.cse39 (mod |c_gcd_test_#in~a| v_prenex_72))) (let ((.cse40 (mod (+ .cse39 (* 255 v_prenex_72)) 256))) (or (= v_prenex_72 0) (< 127 (mod (+ .cse39 v_prenex_72) 256)) (<= (mod .cse39 256) 127) (= 0 .cse39) (<= v_prenex_72 |c_gcd_test_#in~a|) (< 127 v_prenex_72) (<= .cse40 127) (< v_prenex_72 0) (not (= .cse40 256)))))) .cse3) (or .cse0 .cse20 (forall ((v_prenex_65 Int)) (let ((.cse41 (mod |c_gcd_test_#in~a| v_prenex_65))) (let ((.cse42 (mod (+ (* 255 v_prenex_65) .cse41) 256))) (or (= 0 .cse41) (< v_prenex_65 0) (<= v_prenex_65 |c_gcd_test_#in~a|) (not (= 256 .cse42)) (<= .cse42 127) (= v_prenex_65 0) (< 127 (mod .cse41 256)) (< 127 v_prenex_65) (< 127 (mod (+ v_prenex_65 .cse41) 256)))))) .cse3) (or .cse0 (forall ((v_prenex_56 Int)) (let ((.cse43 (mod |c_gcd_test_#in~a| v_prenex_56))) (let ((.cse44 (mod (+ v_prenex_56 .cse43) 256))) (or (< 127 (mod (+ (* 255 v_prenex_56) .cse43) 256)) (<= v_prenex_56 |c_gcd_test_#in~a|) (= v_prenex_56 0) (<= (mod .cse43 256) 127) (< 127 v_prenex_56) (= 0 .cse43) (not (= 0 .cse44)) (<= 0 v_prenex_56) (< 127 .cse44))))) .cse20 .cse3) (or .cse0 (forall ((v_prenex_57 Int)) (let ((.cse46 (mod |c_gcd_test_#in~a| v_prenex_57))) (let ((.cse45 (mod .cse46 256))) (or (< 127 .cse45) (not (= .cse46 0)) (< 127 v_prenex_57) (not (= 0 .cse45)) (= v_prenex_57 0) (<= (mod (+ (* 255 v_prenex_57) .cse46) 256) 127) (<= v_prenex_57 |c_gcd_test_#in~a|) (< v_prenex_57 0) (<= (mod (+ v_prenex_57 .cse46) 256) 127))))) .cse3) (or (forall ((v_prenex_39 Int)) (let ((.cse47 (mod |c_gcd_test_#in~a| v_prenex_39))) (let ((.cse48 (mod (+ .cse47 (* 255 v_prenex_39)) 256))) (or (< v_prenex_39 0) (< 127 (mod (+ .cse47 v_prenex_39) 256)) (= 0 .cse47) (< 127 v_prenex_39) (< 127 (mod .cse47 256)) (<= v_prenex_39 |c_gcd_test_#in~a|) (not (= 0 .cse48)) (< 127 .cse48) (= v_prenex_39 0))))) .cse0 .cse20 .cse3) (or (forall ((v_prenex_12 Int)) (let ((.cse50 (mod |c_gcd_test_#in~a| v_prenex_12))) (let ((.cse49 (mod .cse50 256))) (or (= v_prenex_12 0) (not (= 0 .cse49)) (<= 0 v_prenex_12) (<= v_prenex_12 |c_gcd_test_#in~a|) (< 127 v_prenex_12) (< 127 .cse49) (<= (mod (+ (* 255 v_prenex_12) .cse50) 256) 127) (<= (mod (+ v_prenex_12 .cse50) 256) 127) (not (= 0 .cse50)))))) .cse0 .cse3) (or .cse0 (forall ((v_prenex_85 Int)) (let ((.cse52 (mod |c_gcd_test_#in~a| v_prenex_85))) (let ((.cse51 (mod .cse52 256))) (or (= v_prenex_85 0) (<= 0 v_prenex_85) (< 127 .cse51) (<= (mod (+ .cse52 v_prenex_85) 256) 127) (< 127 v_prenex_85) (<= v_prenex_85 |c_gcd_test_#in~a|) (not (= 0 .cse52)) (not (= .cse51 0)) (<= (mod (+ .cse52 (* 255 v_prenex_85)) 256) 127))))) .cse3) (or .cse0 (forall ((v_prenex_11 Int)) (let ((.cse53 (mod |c_gcd_test_#in~a| v_prenex_11))) (let ((.cse54 (mod .cse53 256))) (or (<= (mod (+ .cse53 (* 255 v_prenex_11)) 256) 127) (<= v_prenex_11 |c_gcd_test_#in~a|) (= v_prenex_11 0) (not (= 0 .cse54)) (<= (mod (+ .cse53 v_prenex_11) 256) 127) (< v_prenex_11 0) (< 127 .cse54) (< 127 v_prenex_11))))) .cse3) (or (forall ((v_prenex_35 Int)) (let ((.cse56 (mod |c_gcd_test_#in~a| v_prenex_35))) (let ((.cse55 (mod .cse56 256))) (or (< 127 v_prenex_35) (< 127 .cse55) (= v_prenex_35 0) (< 127 (mod (+ .cse56 (* 255 v_prenex_35)) 256)) (<= (mod (+ .cse56 v_prenex_35) 256) 127) (<= 0 v_prenex_35) (not (= 0 .cse55)) (<= v_prenex_35 |c_gcd_test_#in~a|))))) .cse0 .cse3) (or (forall ((v_prenex_54 Int)) (let ((.cse58 (mod |c_gcd_test_#in~a| v_prenex_54))) (let ((.cse57 (mod (+ (* 255 v_prenex_54) .cse58) 256))) (or (not (= .cse57 0)) (<= (mod (+ v_prenex_54 .cse58) 256) 127) (< 127 .cse57) (= .cse58 0) (<= (mod .cse58 256) 127) (< 127 v_prenex_54) (<= v_prenex_54 |c_gcd_test_#in~a|) (= v_prenex_54 0) (< v_prenex_54 0))))) .cse0 .cse20 .cse3) (or (forall ((v_prenex_19 Int)) (let ((.cse59 (mod |c_gcd_test_#in~a| v_prenex_19))) (let ((.cse60 (mod .cse59 256))) (or (<= 0 v_prenex_19) (< 127 (mod (+ .cse59 (* 255 v_prenex_19)) 256)) (not (= .cse60 256)) (< 127 v_prenex_19) (<= v_prenex_19 |c_gcd_test_#in~a|) (<= .cse60 127) (< 127 (mod (+ .cse59 v_prenex_19) 256)) (= v_prenex_19 0))))) .cse0 .cse3) (or .cse0 (forall ((v_prenex_48 Int)) (let ((.cse61 (mod |c_gcd_test_#in~a| v_prenex_48))) (let ((.cse62 (mod .cse61 256))) (or (<= (mod (+ (* 255 v_prenex_48) .cse61) 256) 127) (not (= 256 .cse62)) (< v_prenex_48 0) (<= .cse62 127) (< 127 v_prenex_48) (< 127 (mod (+ v_prenex_48 .cse61) 256)) (<= v_prenex_48 |c_gcd_test_#in~a|) (= v_prenex_48 0))))) .cse3) (or .cse0 (forall ((v_prenex_13 Int)) (let ((.cse64 (mod |c_gcd_test_#in~a| v_prenex_13))) (let ((.cse63 (mod .cse64 256))) (or (< 127 v_prenex_13) (not (= 256 .cse63)) (<= (mod (+ .cse64 (* 255 v_prenex_13)) 256) 127) (<= v_prenex_13 |c_gcd_test_#in~a|) (= v_prenex_13 0) (<= (mod (+ .cse64 v_prenex_13) 256) 127) (<= .cse63 127) (< v_prenex_13 0))))) .cse3) (or .cse0 (forall ((gcd_test_~b Int)) (let ((.cse65 (mod |c_gcd_test_#in~a| gcd_test_~b))) (let ((.cse66 (mod .cse65 256))) (or (<= gcd_test_~b |c_gcd_test_#in~a|) (not (= 0 .cse65)) (< 127 (mod (+ (* 255 gcd_test_~b) .cse65) 256)) (not (= 0 .cse66)) (= gcd_test_~b 0) (< gcd_test_~b 0) (< 127 .cse66) (< 127 gcd_test_~b) (< 127 (mod (+ gcd_test_~b .cse65) 256)))))) .cse3) (or .cse0 (forall ((v_prenex_46 Int)) (let ((.cse67 (mod |c_gcd_test_#in~a| v_prenex_46))) (let ((.cse68 (mod .cse67 256))) (or (<= 0 v_prenex_46) (= v_prenex_46 0) (< 127 v_prenex_46) (< 127 (mod (+ (* 255 v_prenex_46) .cse67) 256)) (<= .cse68 127) (not (= 256 .cse68)) (<= v_prenex_46 |c_gcd_test_#in~a|) (<= (mod (+ v_prenex_46 .cse67) 256) 127))))) .cse3) (or .cse0 (forall ((v_prenex_83 Int)) (let ((.cse69 (mod |c_gcd_test_#in~a| v_prenex_83))) (let ((.cse70 (mod .cse69 256))) (or (< 127 (mod (+ .cse69 v_prenex_83) 256)) (< 127 v_prenex_83) (not (= 256 .cse70)) (<= .cse70 127) (<= (mod (+ .cse69 (* 255 v_prenex_83)) 256) 127) (<= v_prenex_83 |c_gcd_test_#in~a|) (<= 0 v_prenex_83) (not (= 0 .cse69)) (= v_prenex_83 0))))) .cse3) (or .cse0 (forall ((v_prenex_36 Int)) (let ((.cse71 (mod |c_gcd_test_#in~a| v_prenex_36))) (let ((.cse72 (mod .cse71 256))) (or (= v_prenex_36 0) (< 127 v_prenex_36) (< 127 (mod (+ .cse71 (* 255 v_prenex_36)) 256)) (< v_prenex_36 0) (<= (mod (+ .cse71 v_prenex_36) 256) 127) (< 127 .cse72) (not (= .cse71 0)) (not (= 0 .cse72)) (<= v_prenex_36 |c_gcd_test_#in~a|))))) .cse3) (or .cse0 (forall ((v_prenex_81 Int)) (let ((.cse73 (mod |c_gcd_test_#in~a| v_prenex_81))) (let ((.cse74 (mod .cse73 256))) (or (<= 0 v_prenex_81) (= v_prenex_81 0) (< 127 (mod (+ (* 255 v_prenex_81) .cse73) 256)) (< 127 .cse74) (< 127 v_prenex_81) (< 127 (mod (+ v_prenex_81 .cse73) 256)) (not (= .cse74 0)) (<= v_prenex_81 |c_gcd_test_#in~a|) (not (= 0 .cse73)))))) .cse3) (or .cse0 (forall ((v_prenex_41 Int)) (let ((.cse75 (mod |c_gcd_test_#in~a| v_prenex_41))) (let ((.cse76 (mod (+ v_prenex_41 .cse75) 256))) (or (< 127 v_prenex_41) (= 0 .cse75) (<= (mod .cse75 256) 127) (= v_prenex_41 0) (not (= 0 .cse76)) (<= 0 v_prenex_41) (<= v_prenex_41 |c_gcd_test_#in~a|) (< 127 .cse76) (<= (mod (+ (* 255 v_prenex_41) .cse75) 256) 127))))) .cse20 .cse3) (or (forall ((v_prenex_15 Int)) (let ((.cse78 (mod |c_gcd_test_#in~a| v_prenex_15))) (let ((.cse77 (mod .cse78 256))) (or (= v_prenex_15 0) (not (= 256 .cse77)) (<= (mod (+ v_prenex_15 .cse78) 256) 127) (<= (mod (+ (* 255 v_prenex_15) .cse78) 256) 127) (<= .cse77 127) (< v_prenex_15 0) (< 127 v_prenex_15) (<= v_prenex_15 |c_gcd_test_#in~a|) (not (= 0 .cse78)))))) .cse0 .cse3) (or .cse0 .cse3 (forall ((v_prenex_70 Int)) (let ((.cse80 (mod |c_gcd_test_#in~a| v_prenex_70))) (let ((.cse79 (mod .cse80 256))) (or (<= 0 v_prenex_70) (= v_prenex_70 0) (< 127 .cse79) (not (= .cse80 0)) (<= v_prenex_70 |c_gcd_test_#in~a|) (not (= 0 .cse79)) (< 127 (mod (+ .cse80 (* 255 v_prenex_70)) 256)) (< 127 v_prenex_70) (<= (mod (+ .cse80 v_prenex_70) 256) 127)))))) (or .cse0 (forall ((v_prenex_44 Int)) (let ((.cse82 (mod |c_gcd_test_#in~a| v_prenex_44))) (let ((.cse81 (mod .cse82 256))) (or (= v_prenex_44 0) (<= v_prenex_44 |c_gcd_test_#in~a|) (<= .cse81 127) (< v_prenex_44 0) (< 127 v_prenex_44) (< 127 (mod (+ (* 255 v_prenex_44) .cse82) 256)) (<= (mod (+ v_prenex_44 .cse82) 256) 127) (not (= 256 .cse81)))))) .cse3) (or .cse0 (forall ((v_prenex_87 Int)) (let ((.cse83 (mod |c_gcd_test_#in~a| v_prenex_87))) (let ((.cse84 (mod .cse83 256))) (or (< 127 (mod (+ .cse83 v_prenex_87) 256)) (<= 0 v_prenex_87) (not (= .cse84 0)) (<= v_prenex_87 |c_gcd_test_#in~a|) (< 127 .cse84) (< 127 v_prenex_87) (= v_prenex_87 0) (not (= 0 .cse83)) (<= (mod (+ .cse83 (* 255 v_prenex_87)) 256) 127))))) .cse3) (or (forall ((v_prenex_10 Int)) (let ((.cse86 (mod |c_gcd_test_#in~a| v_prenex_10))) (let ((.cse85 (mod .cse86 256))) (or (not (= .cse85 0)) (<= (mod (+ .cse86 (* 255 v_prenex_10)) 256) 127) (< v_prenex_10 0) (<= v_prenex_10 |c_gcd_test_#in~a|) (not (= .cse86 0)) (< 127 .cse85) (= v_prenex_10 0) (<= (mod (+ .cse86 v_prenex_10) 256) 127) (< 127 v_prenex_10))))) .cse0 .cse3) (or .cse0 (forall ((v_prenex_45 Int)) (let ((.cse88 (mod |c_gcd_test_#in~a| v_prenex_45))) (let ((.cse87 (mod .cse88 256))) (or (not (= 256 .cse87)) (<= (mod (+ v_prenex_45 .cse88) 256) 127) (< 127 (mod (+ (* 255 v_prenex_45) .cse88) 256)) (not (= 0 .cse88)) (<= v_prenex_45 |c_gcd_test_#in~a|) (< v_prenex_45 0) (= v_prenex_45 0) (<= .cse87 127) (< 127 v_prenex_45))))) .cse3) (or .cse0 (forall ((v_prenex_68 Int)) (let ((.cse90 (mod |c_gcd_test_#in~a| v_prenex_68))) (let ((.cse89 (mod .cse90 256))) (or (< v_prenex_68 0) (<= .cse89 127) (not (= 0 .cse90)) (not (= 256 .cse89)) (< 127 v_prenex_68) (<= (mod (+ v_prenex_68 .cse90) 256) 127) (<= (mod (+ (* 255 v_prenex_68) .cse90) 256) 127) (<= v_prenex_68 |c_gcd_test_#in~a|) (= v_prenex_68 0))))) .cse3) (or .cse0 .cse20 (forall ((v_prenex_26 Int)) (let ((.cse92 (mod |c_gcd_test_#in~a| v_prenex_26))) (let ((.cse91 (mod (+ v_prenex_26 .cse92) 256))) (or (not (= 256 .cse91)) (< 127 (mod .cse92 256)) (<= .cse91 127) (= 0 .cse92) (<= 0 v_prenex_26) (= v_prenex_26 0) (< 127 v_prenex_26) (<= v_prenex_26 |c_gcd_test_#in~a|) (<= (mod (+ (* 255 v_prenex_26) .cse92) 256) 127))))) .cse3) (or .cse0 (forall ((v_prenex_38 Int)) (let ((.cse93 (mod |c_gcd_test_#in~a| v_prenex_38))) (let ((.cse94 (mod .cse93 256))) (or (< 127 (mod (+ (* 255 v_prenex_38) .cse93) 256)) (< 127 .cse94) (not (= .cse94 0)) (= v_prenex_38 0) (<= v_prenex_38 |c_gcd_test_#in~a|) (<= (mod (+ v_prenex_38 .cse93) 256) 127) (< v_prenex_38 0) (< 127 v_prenex_38))))) .cse3) (or (forall ((v_prenex_28 Int)) (let ((.cse95 (mod |c_gcd_test_#in~a| v_prenex_28))) (let ((.cse96 (mod (+ (* 255 v_prenex_28) .cse95) 256))) (or (< 127 v_prenex_28) (<= (mod (+ v_prenex_28 .cse95) 256) 127) (= v_prenex_28 0) (<= .cse96 127) (<= v_prenex_28 |c_gcd_test_#in~a|) (not (= .cse96 256)) (<= (mod .cse95 256) 127) (= 0 .cse95) (< v_prenex_28 0))))) .cse0 .cse20 .cse3) (or .cse0 (forall ((v_prenex_47 Int)) (let ((.cse98 (mod |c_gcd_test_#in~a| v_prenex_47))) (let ((.cse97 (mod .cse98 256))) (or (<= .cse97 127) (<= 0 v_prenex_47) (<= v_prenex_47 |c_gcd_test_#in~a|) (< 127 (mod (+ .cse98 (* 255 v_prenex_47)) 256)) (<= (mod (+ .cse98 v_prenex_47) 256) 127) (= v_prenex_47 0) (< 127 v_prenex_47) (not (= .cse97 256)) (not (= 0 .cse98)))))) .cse3) (or .cse0 .cse20 (forall ((v_prenex_23 Int)) (let ((.cse99 (mod |c_gcd_test_#in~a| v_prenex_23))) (let ((.cse100 (mod (+ v_prenex_23 .cse99) 256))) (or (< 127 v_prenex_23) (<= 0 v_prenex_23) (< 127 (mod .cse99 256)) (= v_prenex_23 0) (< 127 .cse100) (<= v_prenex_23 |c_gcd_test_#in~a|) (not (= 0 .cse100)) (<= (mod (+ (* 255 v_prenex_23) .cse99) 256) 127) (= 0 .cse99))))) .cse3) (or (forall ((v_prenex_71 Int)) (let ((.cse102 (mod |c_gcd_test_#in~a| v_prenex_71))) (let ((.cse101 (mod (+ .cse102 v_prenex_71) 256))) (or (not (= .cse101 0)) (< 127 (mod (+ .cse102 (* 255 v_prenex_71)) 256)) (<= v_prenex_71 |c_gcd_test_#in~a|) (< 127 .cse101) (= v_prenex_71 0) (<= 0 v_prenex_71) (= 0 .cse102) (< 127 (mod .cse102 256)) (< 127 v_prenex_71))))) .cse0 .cse20 .cse3) (or .cse0 (forall ((v_prenex_62 Int)) (let ((.cse103 (mod |c_gcd_test_#in~a| v_prenex_62))) (let ((.cse104 (mod .cse103 256))) (or (< 127 v_prenex_62) (<= (mod (+ .cse103 v_prenex_62) 256) 127) (<= 0 v_prenex_62) (<= v_prenex_62 |c_gcd_test_#in~a|) (= v_prenex_62 0) (<= (mod (+ .cse103 (* 255 v_prenex_62)) 256) 127) (not (= .cse103 0)) (not (= .cse104 256)) (<= .cse104 127))))) .cse3) (or (forall ((v_prenex_69 Int)) (let ((.cse105 (mod |c_gcd_test_#in~a| v_prenex_69))) (let ((.cse106 (mod .cse105 256))) (or (<= (mod (+ .cse105 (* 255 v_prenex_69)) 256) 127) (not (= 0 .cse105)) (<= v_prenex_69 |c_gcd_test_#in~a|) (< 127 v_prenex_69) (< 127 .cse106) (< 127 (mod (+ .cse105 v_prenex_69) 256)) (= v_prenex_69 0) (<= 0 v_prenex_69) (not (= .cse106 0)))))) .cse0 .cse3) (or (forall ((v_prenex_32 Int)) (let ((.cse107 (mod |c_gcd_test_#in~a| v_prenex_32))) (let ((.cse108 (mod .cse107 256))) (or (< 127 v_prenex_32) (<= v_prenex_32 |c_gcd_test_#in~a|) (= v_prenex_32 0) (< v_prenex_32 0) (<= (mod (+ .cse107 (* 255 v_prenex_32)) 256) 127) (< 127 (mod (+ .cse107 v_prenex_32) 256)) (not (= 0 .cse108)) (not (= 0 .cse107)) (< 127 .cse108))))) .cse0 .cse3) (or (forall ((v_prenex_21 Int)) (let ((.cse110 (mod |c_gcd_test_#in~a| v_prenex_21))) (let ((.cse109 (mod .cse110 256))) (or (<= .cse109 127) (<= v_prenex_21 |c_gcd_test_#in~a|) (< 127 v_prenex_21) (= v_prenex_21 0) (< 127 (mod (+ (* 255 v_prenex_21) .cse110) 256)) (< 127 (mod (+ v_prenex_21 .cse110) 256)) (not (= 256 .cse109)) (not (= .cse110 0)) (<= 0 v_prenex_21))))) .cse0 .cse3) (or .cse0 (forall ((v_prenex_58 Int)) (let ((.cse111 (mod |c_gcd_test_#in~a| v_prenex_58))) (let ((.cse112 (mod (+ .cse111 v_prenex_58) 256))) (or (<= v_prenex_58 |c_gcd_test_#in~a|) (<= 0 v_prenex_58) (< 127 (mod .cse111 256)) (not (= 256 .cse112)) (< 127 (mod (+ .cse111 (* 255 v_prenex_58)) 256)) (< 127 v_prenex_58) (= 0 .cse111) (= v_prenex_58 0) (<= .cse112 127))))) .cse20 .cse3) (or (forall ((v_prenex_7 Int)) (let ((.cse113 (mod |c_gcd_test_#in~a| v_prenex_7))) (let ((.cse114 (mod .cse113 256))) (or (<= 0 v_prenex_7) (not (= .cse113 0)) (= v_prenex_7 0) (< 127 (mod (+ (* 255 v_prenex_7) .cse113) 256)) (< 127 .cse114) (not (= .cse114 0)) (< 127 (mod (+ v_prenex_7 .cse113) 256)) (<= v_prenex_7 |c_gcd_test_#in~a|) (< 127 v_prenex_7))))) .cse0 .cse3) (or (forall ((v_prenex_50 Int)) (let ((.cse115 (mod |c_gcd_test_#in~a| v_prenex_50))) (let ((.cse116 (mod .cse115 256))) (or (< 127 (mod (+ .cse115 v_prenex_50) 256)) (< 127 v_prenex_50) (<= .cse116 127) (<= 0 v_prenex_50) (<= v_prenex_50 |c_gcd_test_#in~a|) (<= (mod (+ .cse115 (* 255 v_prenex_50)) 256) 127) (= v_prenex_50 0) (not (= 256 .cse116)))))) .cse0 .cse3) (or .cse0 (forall ((v_prenex_31 Int)) (let ((.cse118 (mod |c_gcd_test_#in~a| v_prenex_31))) (let ((.cse117 (mod .cse118 256))) (or (< 127 .cse117) (<= 0 v_prenex_31) (= v_prenex_31 0) (not (= 0 .cse117)) (< 127 (mod (+ .cse118 v_prenex_31) 256)) (<= v_prenex_31 |c_gcd_test_#in~a|) (<= (mod (+ .cse118 (* 255 v_prenex_31)) 256) 127) (< 127 v_prenex_31))))) .cse3) (or .cse0 (forall ((v_prenex_1 Int)) (let ((.cse120 (mod |c_gcd_test_#in~a| v_prenex_1))) (let ((.cse119 (mod (+ .cse120 (* 255 v_prenex_1)) 256))) (or (<= v_prenex_1 |c_gcd_test_#in~a|) (< 127 .cse119) (not (= 0 .cse119)) (= v_prenex_1 0) (< v_prenex_1 0) (< 127 v_prenex_1) (< 127 (mod .cse120 256)) (<= (mod (+ .cse120 v_prenex_1) 256) 127) (= 0 .cse120))))) .cse20 .cse3) (or (forall ((v_prenex_73 Int)) (let ((.cse121 (mod |c_gcd_test_#in~a| v_prenex_73))) (let ((.cse122 (mod .cse121 256))) (or (<= (mod (+ .cse121 (* 255 v_prenex_73)) 256) 127) (<= v_prenex_73 |c_gcd_test_#in~a|) (< 127 (mod (+ .cse121 v_prenex_73) 256)) (= v_prenex_73 0) (< 127 v_prenex_73) (not (= .cse121 0)) (< v_prenex_73 0) (not (= .cse122 256)) (<= .cse122 127))))) .cse0 .cse3) (or (forall ((v_prenex_5 Int)) (let ((.cse123 (mod |c_gcd_test_#in~a| v_prenex_5))) (let ((.cse124 (mod .cse123 256))) (or (< 127 (mod (+ (* 255 v_prenex_5) .cse123) 256)) (= v_prenex_5 0) (not (= .cse124 0)) (<= v_prenex_5 |c_gcd_test_#in~a|) (< 127 v_prenex_5) (< v_prenex_5 0) (< 127 .cse124) (< 127 (mod (+ v_prenex_5 .cse123) 256)))))) .cse0 .cse3) (or (forall ((v_prenex_55 Int)) (let ((.cse125 (mod |c_gcd_test_#in~a| v_prenex_55))) (let ((.cse126 (mod (+ (* 255 v_prenex_55) .cse125) 256))) (or (< 127 (mod (+ v_prenex_55 .cse125) 256)) (not (= 0 .cse126)) (= .cse125 0) (= v_prenex_55 0) (< v_prenex_55 0) (<= v_prenex_55 |c_gcd_test_#in~a|) (< 127 .cse126) (< 127 v_prenex_55) (<= (mod .cse125 256) 127))))) .cse0 .cse20 .cse3) (or (forall ((v_prenex_6 Int)) (let ((.cse128 (mod |c_gcd_test_#in~a| v_prenex_6))) (let ((.cse127 (mod .cse128 256))) (or (< 127 .cse127) (not (= .cse128 0)) (< 127 (mod (+ v_prenex_6 .cse128) 256)) (< 127 (mod (+ (* 255 v_prenex_6) .cse128) 256)) (< v_prenex_6 0) (< 127 v_prenex_6) (not (= 0 .cse127)) (<= v_prenex_6 |c_gcd_test_#in~a|) (= v_prenex_6 0))))) .cse0 .cse3) (or .cse0 (forall ((v_prenex_64 Int)) (let ((.cse130 (mod |c_gcd_test_#in~a| v_prenex_64))) (let ((.cse129 (mod .cse130 256))) (or (< v_prenex_64 0) (not (= .cse129 256)) (< 127 v_prenex_64) (< 127 (mod (+ .cse130 v_prenex_64) 256)) (<= v_prenex_64 |c_gcd_test_#in~a|) (< 127 (mod (+ .cse130 (* 255 v_prenex_64)) 256)) (not (= .cse130 0)) (= v_prenex_64 0) (<= .cse129 127))))) .cse3))) is different from true [2018-10-27 00:11:48,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-10-27 00:11:48,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 00:11:48,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 24 [2018-10-27 00:11:48,689 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 00:11:48,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-27 00:11:48,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-27 00:11:48,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=329, Unknown=4, NotChecked=156, Total=552 [2018-10-27 00:11:48,691 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 24 states. [2018-10-27 00:12:21,256 WARN L179 SmtUtils]: Spent 28.23 s on a formula simplification. DAG size of input: 1371 DAG size of output: 3 [2018-10-27 00:12:57,477 WARN L179 SmtUtils]: Spent 33.90 s on a formula simplification. DAG size of input: 1371 DAG size of output: 51 [2018-10-27 00:13:57,188 WARN L179 SmtUtils]: Spent 54.91 s on a formula simplification. DAG size of input: 1227 DAG size of output: 6 [2018-10-27 00:13:58,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:13:58,265 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-10-27 00:13:58,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-27 00:13:58,267 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 22 [2018-10-27 00:13:58,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:13:58,268 INFO L225 Difference]: With dead ends: 45 [2018-10-27 00:13:58,268 INFO L226 Difference]: Without dead ends: 29 [2018-10-27 00:13:58,269 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 138.5s TimeCoverageRelationStatistics Valid=110, Invalid=599, Unknown=9, NotChecked=212, Total=930 [2018-10-27 00:13:58,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-27 00:13:58,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-10-27 00:13:58,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-27 00:13:58,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-10-27 00:13:58,278 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 22 [2018-10-27 00:13:58,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:13:58,278 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-10-27 00:13:58,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-27 00:13:58,278 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-10-27 00:13:58,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-27 00:13:58,279 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:13:58,279 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:13:58,279 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:13:58,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:13:58,280 INFO L82 PathProgramCache]: Analyzing trace with hash 414638752, now seen corresponding path program 2 times [2018-10-27 00:13:58,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 00:13:58,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:13:58,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:13:58,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 00:13:58,281 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 00:13:58,297 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-27 00:13:58,297 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-27 00:13:58,297 INFO L171 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bd7b1f-edc4-45c5-8f5a-9236492060b3/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-27 00:13:58,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 00:13:58,311 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-10-27 00:13:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:13:58,428 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 00:13:58,428 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 00:13:58,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:13:58,429 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bd7b1f-edc4-45c5-8f5a-9236492060b3/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 00:13:58,437 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 00:13:58,437 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 00:13:58,547 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-27 00:13:58,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 00:13:58,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 00:13:58,922 WARN L179 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-10-27 00:14:09,931 WARN L179 SmtUtils]: Spent 10.89 s on a formula simplification. DAG size of input: 75 DAG size of output: 31 [2018-10-27 00:14:12,132 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse5 (<= 0 |c_gcd_test_#in~a|))) (or (and (exists ((v_prenex_151 Int)) (let ((.cse3 (mod (* 255 v_prenex_151) 256))) (let ((.cse4 (+ .cse3 (- 256)))) (let ((.cse1 (mod (mod |c_gcd_test_#in~a| .cse4) 256))) (let ((.cse2 (mod .cse4 .cse1))) (let ((.cse0 (mod (+ (* 255 .cse1) .cse2) 256))) (and (= c_gcd_test_~b .cse0) (not (= .cse1 0)) (<= .cse1 c_gcd_test_~a) (< 127 (mod .cse2 256)) (< 127 .cse3) (not (= 0 .cse2)) (< .cse3 256) (<= 0 .cse1) (<= .cse0 127) (<= (mod (+ .cse1 .cse2) 256) 127)))))))) .cse5) (and (exists ((v_prenex_135 Int)) (let ((.cse9 (mod (* 255 v_prenex_135) 256))) (let ((.cse6 (mod (mod |c_gcd_test_#in~a| .cse9) 256))) (let ((.cse7 (mod .cse9 .cse6))) (let ((.cse8 (mod .cse7 256))) (and (< .cse6 0) (= 0 .cse7) (<= .cse6 c_gcd_test_~a) (= c_gcd_test_~b .cse8) (<= .cse9 127) (<= (mod (+ .cse7 (* 255 .cse6)) 256) 127) (not (= 0 .cse6)) (<= .cse8 127) (not (= 0 .cse9)))))))) .cse5) (and (exists ((v_prenex_124 Int)) (let ((.cse11 (mod (* 255 v_prenex_124) 256))) (let ((.cse10 (mod (mod |c_gcd_test_#in~a| .cse11) 256))) (let ((.cse12 (mod .cse11 .cse10))) (let ((.cse13 (mod .cse12 256))) (and (not (= 0 .cse10)) (not (= 0 .cse11)) (= 0 .cse12) (<= .cse11 127) (= (+ c_gcd_test_~b 256) .cse13) (< 127 (mod (+ .cse12 (* 255 .cse10)) 256)) (<= .cse10 c_gcd_test_~a) (<= 0 .cse10) (< 127 .cse13))))))) .cse5) (and (exists ((v_prenex_107 Int)) (let ((.cse14 (mod (* 255 v_prenex_107) 256))) (let ((.cse16 (mod (mod |c_gcd_test_#in~a| .cse14) 256))) (let ((.cse15 (mod .cse14 .cse16))) (let ((.cse17 (mod .cse15 256))) (and (<= 0 .cse14) (< 127 (mod (+ .cse15 (* 255 .cse16)) 256)) (< 127 .cse17) (not (= 0 .cse14)) (<= .cse14 127) (<= 0 .cse16) (= (+ c_gcd_test_~b 256) .cse17) (<= .cse16 c_gcd_test_~a) (not (= 0 .cse16)))))))) .cse5) (and (exists ((v_prenex_122 Int)) (let ((.cse20 (mod (* 255 v_prenex_122) 256))) (let ((.cse18 (mod (mod |c_gcd_test_#in~a| .cse20) 256))) (let ((.cse19 (mod .cse20 .cse18))) (let ((.cse21 (mod (+ .cse18 .cse19) 256))) (and (<= .cse18 c_gcd_test_~a) (not (= 0 .cse19)) (<= .cse20 127) (< .cse18 0) (not (= 0 .cse20)) (<= (mod (+ (* 255 .cse18) .cse19) 256) 127) (< .cse20 0) (not (= .cse18 0)) (<= .cse21 127) (<= (mod .cse19 256) 127) (= c_gcd_test_~b .cse21))))))) .cse5) (and .cse5 (exists ((v_prenex_112 Int)) (let ((.cse25 (mod (* 255 v_prenex_112) 256))) (let ((.cse24 (mod (mod |c_gcd_test_#in~a| .cse25) 256))) (let ((.cse23 (mod .cse25 .cse24))) (let ((.cse22 (mod .cse23 256))) (and (<= .cse22 127) (= c_gcd_test_~b .cse22) (< 127 (mod (+ .cse23 (* 255 .cse24)) 256)) (= 0 .cse23) (not (= 0 .cse25)) (not (= .cse24 0)) (<= 0 .cse24) (<= .cse24 c_gcd_test_~a) (<= .cse25 127)))))))) (and (exists ((v_prenex_139 Int)) (let ((.cse26 (mod (* 255 v_prenex_139) 256))) (let ((.cse28 (mod (mod |c_gcd_test_#in~a| .cse26) 256))) (let ((.cse29 (mod .cse26 .cse28))) (let ((.cse27 (mod .cse29 256))) (and (<= 0 .cse26) (<= .cse27 127) (<= .cse28 c_gcd_test_~a) (not (= .cse26 0)) (= c_gcd_test_~b .cse27) (<= (mod (+ (* 255 .cse28) .cse29) 256) 127) (not (= 0 .cse28)) (< .cse28 0) (<= .cse26 127))))))) .cse5) (and (exists ((v_prenex_101 Int)) (let ((.cse30 (mod (* 255 v_prenex_101) 256))) (let ((.cse32 (mod (mod |c_gcd_test_#in~a| .cse30) 256))) (let ((.cse33 (mod .cse30 .cse32))) (let ((.cse31 (mod .cse33 256))) (and (<= .cse30 127) (= (+ c_gcd_test_~b 256) .cse31) (<= .cse32 c_gcd_test_~a) (not (= 0 .cse32)) (not (= 0 .cse30)) (<= (mod (+ .cse33 (* 255 .cse32)) 256) 127) (< 127 .cse31) (<= 0 .cse32) (= 0 .cse33))))))) .cse5) (and (exists ((v_prenex_183 Int)) (let ((.cse35 (mod (* 255 v_prenex_183) 256))) (let ((.cse38 (+ .cse35 (- 256)))) (let ((.cse36 (mod (mod |c_gcd_test_#in~a| .cse38) 256))) (let ((.cse37 (mod .cse38 .cse36))) (let ((.cse34 (mod .cse37 256))) (and (= (+ c_gcd_test_~b 256) .cse34) (< 127 .cse35) (<= 256 .cse35) (<= 0 .cse36) (< 127 .cse34) (<= (mod (+ .cse37 (* 255 .cse36)) 256) 127) (<= .cse36 c_gcd_test_~a) (not (= 0 .cse36))))))))) .cse5) (and .cse5 (exists ((v_prenex_171 Int)) (let ((.cse40 (mod (* 255 v_prenex_171) 256))) (let ((.cse43 (+ .cse40 (- 256)))) (let ((.cse41 (mod (mod |c_gcd_test_#in~a| .cse43) 256))) (let ((.cse39 (mod .cse43 .cse41))) (let ((.cse42 (mod (+ (* 255 .cse41) .cse39) 256))) (and (not (= .cse39 0)) (< 127 .cse40) (< .cse40 256) (<= .cse41 c_gcd_test_~a) (<= 0 .cse41) (< 127 .cse42) (not (= .cse41 0)) (= (+ c_gcd_test_~b 256) .cse42) (<= (mod .cse39 256) 127) (< 127 (mod (+ .cse41 .cse39) 256)))))))))) (and .cse5 (exists ((v_prenex_189 Int)) (let ((.cse45 (mod (* 255 v_prenex_189) 256))) (let ((.cse48 (+ .cse45 (- 256)))) (let ((.cse46 (mod (mod |c_gcd_test_#in~a| .cse48) 256))) (let ((.cse44 (mod .cse48 .cse46))) (let ((.cse47 (mod (+ .cse44 .cse46) 256))) (and (< 127 (mod .cse44 256)) (< 127 .cse45) (not (= 0 .cse46)) (not (= .cse44 0)) (<= .cse47 127) (= c_gcd_test_~b .cse47) (<= .cse46 c_gcd_test_~a) (<= (mod (+ .cse44 (* 255 .cse46)) 256) 127) (< .cse46 0) (< .cse45 256))))))))) (and .cse5 (exists ((v_prenex_175 Int)) (let ((.cse51 (mod (* 255 v_prenex_175) 256))) (let ((.cse53 (+ .cse51 (- 256)))) (let ((.cse50 (mod (mod |c_gcd_test_#in~a| .cse53) 256))) (let ((.cse52 (mod .cse53 .cse50))) (let ((.cse49 (mod .cse52 256))) (and (<= .cse49 127) (not (= .cse50 0)) (<= 0 .cse50) (< 127 .cse51) (<= (mod (+ .cse52 (* 255 .cse50)) 256) 127) (= 0 .cse52) (= c_gcd_test_~b .cse49) (<= .cse50 c_gcd_test_~a))))))))) (and (exists ((v_prenex_173 Int)) (let ((.cse55 (mod (* 255 v_prenex_173) 256))) (let ((.cse58 (+ .cse55 (- 256)))) (let ((.cse54 (mod (mod |c_gcd_test_#in~a| .cse58) 256))) (let ((.cse57 (mod .cse58 .cse54))) (let ((.cse56 (mod (+ .cse57 (* 255 .cse54)) 256))) (and (<= .cse54 c_gcd_test_~a) (< 127 .cse55) (= c_gcd_test_~b .cse56) (< 127 (mod (+ .cse57 .cse54) 256)) (not (= .cse57 0)) (< 127 (mod .cse57 256)) (<= 0 .cse54) (< .cse55 256) (not (= 0 .cse54)) (<= .cse56 127)))))))) .cse5) (and (exists ((v_prenex_185 Int)) (let ((.cse59 (mod (* 255 v_prenex_185) 256))) (let ((.cse63 (+ .cse59 (- 256)))) (let ((.cse60 (mod (mod |c_gcd_test_#in~a| .cse63) 256))) (let ((.cse62 (mod .cse63 .cse60))) (let ((.cse61 (mod .cse62 256))) (and (<= 256 .cse59) (< 127 .cse59) (not (= .cse60 0)) (<= 0 .cse60) (<= .cse60 c_gcd_test_~a) (= c_gcd_test_~b .cse61) (<= (mod (+ .cse62 (* 255 .cse60)) 256) 127) (<= .cse61 127)))))))) .cse5) (and (exists ((v_prenex_153 Int)) (let ((.cse64 (mod (* 255 v_prenex_153) 256))) (let ((.cse68 (+ .cse64 (- 256)))) (let ((.cse65 (mod (mod |c_gcd_test_#in~a| .cse68) 256))) (let ((.cse66 (mod .cse68 .cse65))) (let ((.cse67 (mod (+ (* 255 .cse65) .cse66) 256))) (and (< 127 .cse64) (<= (mod (+ .cse65 .cse66) 256) 127) (= c_gcd_test_~b .cse67) (<= .cse67 127) (<= .cse65 c_gcd_test_~a) (<= (mod .cse66 256) 127) (not (= 0 .cse66)) (< .cse64 256) (not (= .cse65 0)) (<= 0 .cse65)))))))) .cse5) (and (exists ((v_prenex_124 Int)) (let ((.cse70 (mod (* 255 v_prenex_124) 256))) (let ((.cse69 (mod (mod |c_gcd_test_#in~a| .cse70) 256))) (let ((.cse71 (mod .cse70 .cse69))) (let ((.cse72 (mod .cse71 256))) (and (not (= 0 .cse69)) (not (= 0 .cse70)) (= 0 .cse71) (<= .cse70 127) (= (+ c_gcd_test_~b 256) .cse72) (< 127 (mod (+ .cse71 (* 255 .cse69)) 256)) (<= .cse69 c_gcd_test_~a) (< 127 .cse72) (< .cse69 0))))))) .cse5) (and (exists ((v_prenex_107 Int)) (let ((.cse73 (mod (* 255 v_prenex_107) 256))) (let ((.cse74 (mod (mod |c_gcd_test_#in~a| .cse73) 256))) (let ((.cse75 (mod .cse73 .cse74))) (let ((.cse76 (mod .cse75 256))) (and (<= 0 .cse73) (< .cse74 0) (< 127 (mod (+ .cse75 (* 255 .cse74)) 256)) (< 127 .cse76) (not (= 0 .cse73)) (<= .cse73 127) (= (+ c_gcd_test_~b 256) .cse76) (<= .cse74 c_gcd_test_~a) (not (= 0 .cse74)))))))) .cse5) (and (exists ((v_prenex_137 Int)) (let ((.cse77 (mod (* 255 v_prenex_137) 256))) (let ((.cse79 (mod (mod |c_gcd_test_#in~a| .cse77) 256))) (let ((.cse78 (mod .cse77 .cse79))) (let ((.cse80 (mod .cse78 256))) (and (not (= .cse77 0)) (< 127 (mod (+ .cse78 (* 255 .cse79)) 256)) (<= .cse80 127) (= c_gcd_test_~b .cse80) (not (= 0 .cse79)) (<= .cse79 c_gcd_test_~a) (<= 0 .cse77) (< .cse79 0) (<= .cse77 127))))))) .cse5) (and (exists ((v_prenex_135 Int)) (let ((.cse84 (mod (* 255 v_prenex_135) 256))) (let ((.cse82 (mod (mod |c_gcd_test_#in~a| .cse84) 256))) (let ((.cse81 (mod .cse84 .cse82))) (let ((.cse83 (mod .cse81 256))) (and (= 0 .cse81) (<= .cse82 c_gcd_test_~a) (= c_gcd_test_~b .cse83) (<= .cse84 127) (<= 0 .cse82) (<= (mod (+ .cse81 (* 255 .cse82)) 256) 127) (not (= 0 .cse82)) (<= .cse83 127) (not (= 0 .cse84)))))))) .cse5) (and (exists ((v_prenex_159 Int)) (let ((.cse88 (mod (* 255 v_prenex_159) 256))) (let ((.cse89 (+ .cse88 (- 256)))) (let ((.cse86 (mod (mod |c_gcd_test_#in~a| .cse89) 256))) (let ((.cse87 (mod .cse89 .cse86))) (let ((.cse85 (mod (+ .cse86 .cse87) 256))) (and (= c_gcd_test_~b .cse85) (< .cse86 0) (<= .cse85 127) (<= .cse86 c_gcd_test_~a) (not (= .cse87 0)) (<= (mod .cse87 256) 127) (< 127 .cse88) (not (= .cse86 0)) (< .cse88 256) (<= (mod (+ (* 255 .cse86) .cse87) 256) 127)))))))) .cse5) (and (exists ((v_prenex_179 Int)) (let ((.cse92 (mod (* 255 v_prenex_179) 256))) (let ((.cse94 (+ .cse92 (- 256)))) (let ((.cse90 (mod (mod |c_gcd_test_#in~a| .cse94) 256))) (let ((.cse91 (mod .cse94 .cse90))) (let ((.cse93 (mod .cse91 256))) (and (<= .cse90 c_gcd_test_~a) (= 0 .cse91) (not (= 0 .cse90)) (<= 0 .cse90) (< 127 .cse92) (= (+ c_gcd_test_~b 256) .cse93) (< 127 .cse93) (< 127 (mod (+ .cse91 (* 255 .cse90)) 256))))))))) .cse5) (and .cse5 (exists ((v_prenex_191 Int)) (let ((.cse96 (mod (* 255 v_prenex_191) 256))) (let ((.cse99 (+ .cse96 (- 256)))) (let ((.cse95 (mod (mod |c_gcd_test_#in~a| .cse99) 256))) (let ((.cse98 (mod .cse99 .cse95))) (let ((.cse97 (mod .cse98 256))) (and (not (= .cse95 0)) (< 127 .cse96) (<= .cse97 127) (<= 0 .cse95) (<= .cse95 c_gcd_test_~a) (< 127 (mod (+ .cse98 (* 255 .cse95)) 256)) (<= 256 .cse96) (= c_gcd_test_~b .cse97))))))))) (and .cse5 (exists ((v_prenex_128 Int)) (let ((.cse100 (mod (* 255 v_prenex_128) 256))) (let ((.cse103 (mod (mod |c_gcd_test_#in~a| .cse100) 256))) (let ((.cse101 (mod .cse100 .cse103))) (let ((.cse102 (mod (+ .cse103 .cse101) 256))) (and (<= .cse100 127) (not (= .cse101 0)) (< .cse100 0) (<= .cse102 127) (< .cse103 0) (= c_gcd_test_~b .cse102) (< 127 (mod .cse101 256)) (<= .cse103 c_gcd_test_~a) (not (= 0 .cse100)) (<= (mod (+ (* 255 .cse103) .cse101) 256) 127) (not (= .cse103 0))))))))) (and (exists ((v_prenex_114 Int)) (let ((.cse107 (mod (* 255 v_prenex_114) 256))) (let ((.cse104 (mod (mod |c_gcd_test_#in~a| .cse107) 256))) (let ((.cse106 (mod .cse107 .cse104))) (let ((.cse105 (mod (+ .cse104 .cse106) 256))) (and (not (= .cse104 0)) (= (+ c_gcd_test_~b 256) .cse105) (not (= .cse106 0)) (< .cse107 0) (<= .cse104 c_gcd_test_~a) (not (= .cse107 0)) (<= .cse107 127) (< 127 .cse105) (<= (mod (+ (* 255 .cse104) .cse106) 256) 127) (< 127 (mod .cse106 256)) (< .cse104 0))))))) .cse5) (and (exists ((v_prenex_137 Int)) (let ((.cse108 (mod (* 255 v_prenex_137) 256))) (let ((.cse110 (mod (mod |c_gcd_test_#in~a| .cse108) 256))) (let ((.cse109 (mod .cse108 .cse110))) (let ((.cse111 (mod .cse109 256))) (and (not (= .cse108 0)) (< 127 (mod (+ .cse109 (* 255 .cse110)) 256)) (<= .cse111 127) (= c_gcd_test_~b .cse111) (<= 0 .cse110) (not (= 0 .cse110)) (<= .cse110 c_gcd_test_~a) (<= 0 .cse108) (<= .cse108 127))))))) .cse5) (and (exists ((v_prenex_112 Int)) (let ((.cse115 (mod (* 255 v_prenex_112) 256))) (let ((.cse114 (mod (mod |c_gcd_test_#in~a| .cse115) 256))) (let ((.cse113 (mod .cse115 .cse114))) (let ((.cse112 (mod .cse113 256))) (and (<= .cse112 127) (= c_gcd_test_~b .cse112) (< 127 (mod (+ .cse113 (* 255 .cse114)) 256)) (= 0 .cse113) (not (= 0 .cse115)) (< .cse114 0) (not (= .cse114 0)) (<= .cse114 c_gcd_test_~a) (<= .cse115 127))))))) .cse5) (and (exists ((v_prenex_93 Int)) (let ((.cse119 (mod (* 255 v_prenex_93) 256))) (let ((.cse117 (mod (mod |c_gcd_test_#in~a| .cse119) 256))) (let ((.cse118 (mod .cse119 .cse117))) (let ((.cse116 (mod (+ .cse118 .cse117) 256))) (and (< 127 .cse116) (< .cse117 0) (< 127 (mod (+ .cse118 (* 255 .cse117)) 256)) (<= .cse119 127) (not (= 0 .cse119)) (< 127 (mod .cse118 256)) (not (= 0 .cse118)) (<= .cse117 c_gcd_test_~a) (= (+ c_gcd_test_~b 256) .cse116) (< .cse119 0) (not (= .cse117 0)))))))) .cse5) (and (exists ((v_prenex_88 Int)) (let ((.cse121 (mod (* 255 v_prenex_88) 256))) (let ((.cse124 (+ .cse121 (- 256)))) (let ((.cse120 (mod (mod |c_gcd_test_#in~a| .cse124) 256))) (let ((.cse122 (mod .cse124 .cse120))) (let ((.cse123 (mod .cse122 256))) (and (<= 0 .cse120) (< 127 .cse121) (= .cse122 0) (< 127 .cse123) (not (= .cse120 0)) (<= .cse120 c_gcd_test_~a) (<= (mod (+ .cse122 (* 255 .cse120)) 256) 127) (= (+ c_gcd_test_~b 256) .cse123)))))))) .cse5) (and (exists ((v_prenex_183 Int)) (let ((.cse126 (mod (* 255 v_prenex_183) 256))) (let ((.cse129 (+ .cse126 (- 256)))) (let ((.cse127 (mod (mod |c_gcd_test_#in~a| .cse129) 256))) (let ((.cse128 (mod .cse129 .cse127))) (let ((.cse125 (mod .cse128 256))) (and (= (+ c_gcd_test_~b 256) .cse125) (< 127 .cse126) (<= 256 .cse126) (< .cse127 0) (< 127 .cse125) (<= (mod (+ .cse128 (* 255 .cse127)) 256) 127) (<= .cse127 c_gcd_test_~a) (not (= 0 .cse127))))))))) .cse5) (and .cse5 (exists ((v_prenex_157 Int)) (let ((.cse131 (mod (* 255 v_prenex_157) 256))) (let ((.cse134 (+ .cse131 (- 256)))) (let ((.cse133 (mod (mod |c_gcd_test_#in~a| .cse134) 256))) (let ((.cse130 (mod .cse134 .cse133))) (let ((.cse132 (mod (+ .cse130 (* 255 .cse133)) 256))) (and (not (= 0 .cse130)) (< 127 (mod .cse130 256)) (< 127 .cse131) (< 127 .cse132) (not (= .cse133 0)) (<= .cse133 c_gcd_test_~a) (<= 0 .cse133) (< .cse131 256) (= (+ c_gcd_test_~b 256) .cse132) (<= (mod (+ .cse130 .cse133) 256) 127))))))))) (and (exists ((v_prenex_145 Int)) (let ((.cse135 (mod (* 255 v_prenex_145) 256))) (let ((.cse139 (+ .cse135 (- 256)))) (let ((.cse137 (mod (mod |c_gcd_test_#in~a| .cse139) 256))) (let ((.cse138 (mod .cse139 .cse137))) (let ((.cse136 (mod (+ .cse138 .cse137) 256))) (and (< .cse135 256) (< 127 .cse136) (not (= .cse137 0)) (= (+ c_gcd_test_~b 256) .cse136) (<= (mod .cse138 256) 127) (< .cse137 0) (< 127 .cse135) (<= .cse137 c_gcd_test_~a) (not (= .cse138 0)) (<= (mod (+ .cse138 (* 255 .cse137)) 256) 127)))))))) .cse5) (and (exists ((v_prenex_95 Int)) (let ((.cse141 (mod (* 255 v_prenex_95) 256))) (let ((.cse140 (mod (mod |c_gcd_test_#in~a| .cse141) 256))) (let ((.cse142 (mod .cse141 .cse140))) (let ((.cse143 (mod .cse142 256))) (and (not (= .cse140 0)) (not (= 0 .cse141)) (<= .cse140 c_gcd_test_~a) (<= (mod (+ (* 255 .cse140) .cse142) 256) 127) (= (+ c_gcd_test_~b 256) .cse143) (< 127 .cse143) (< .cse140 0) (<= 0 .cse141) (<= .cse141 127))))))) .cse5) (and (exists ((v_prenex_193 Int)) (let ((.cse147 (mod (* 255 v_prenex_193) 256))) (let ((.cse148 (+ .cse147 (- 256)))) (let ((.cse145 (mod (mod |c_gcd_test_#in~a| .cse148) 256))) (let ((.cse144 (mod .cse148 .cse145))) (let ((.cse146 (mod (+ .cse144 .cse145) 256))) (and (< 127 (mod (+ .cse144 (* 255 .cse145)) 256)) (= c_gcd_test_~b .cse146) (not (= .cse145 0)) (<= .cse146 127) (< 127 (mod .cse144 256)) (not (= .cse144 0)) (< .cse145 0) (< 127 .cse147) (< .cse147 256) (<= .cse145 c_gcd_test_~a)))))))) .cse5) (and (exists ((v_prenex_175 Int)) (let ((.cse151 (mod (* 255 v_prenex_175) 256))) (let ((.cse153 (+ .cse151 (- 256)))) (let ((.cse150 (mod (mod |c_gcd_test_#in~a| .cse153) 256))) (let ((.cse152 (mod .cse153 .cse150))) (let ((.cse149 (mod .cse152 256))) (and (<= .cse149 127) (not (= .cse150 0)) (< 127 .cse151) (<= (mod (+ .cse152 (* 255 .cse150)) 256) 127) (= 0 .cse152) (< .cse150 0) (= c_gcd_test_~b .cse149) (<= .cse150 c_gcd_test_~a)))))))) .cse5) (and (exists ((v_prenex_155 Int)) (let ((.cse155 (mod (* 255 v_prenex_155) 256))) (let ((.cse158 (+ .cse155 (- 256)))) (let ((.cse154 (mod (mod |c_gcd_test_#in~a| .cse158) 256))) (let ((.cse156 (mod .cse158 .cse154))) (let ((.cse157 (mod .cse156 256))) (and (<= 0 .cse154) (<= 256 .cse155) (< 127 (mod (+ .cse156 (* 255 .cse154)) 256)) (< 127 .cse155) (= (+ c_gcd_test_~b 256) .cse157) (< 127 .cse157) (<= .cse154 c_gcd_test_~a) (not (= .cse154 0))))))))) .cse5) (and (exists ((v_prenex_118 Int)) (let ((.cse162 (mod (* 255 v_prenex_118) 256))) (let ((.cse161 (mod (mod |c_gcd_test_#in~a| .cse162) 256))) (let ((.cse159 (mod .cse162 .cse161))) (let ((.cse160 (mod (+ (* 255 .cse161) .cse159) 256))) (and (not (= .cse159 0)) (<= (mod .cse159 256) 127) (<= .cse160 127) (<= .cse161 c_gcd_test_~a) (not (= .cse162 0)) (< .cse162 0) (= c_gcd_test_~b .cse160) (<= (mod (+ .cse161 .cse159) 256) 127) (<= .cse162 127) (<= 0 .cse161) (not (= .cse161 0)))))))) .cse5) (and (exists ((v_prenex_141 Int)) (let ((.cse166 (mod (* 255 v_prenex_141) 256))) (let ((.cse164 (mod (mod |c_gcd_test_#in~a| .cse166) 256))) (let ((.cse165 (mod .cse166 .cse164))) (let ((.cse163 (mod (+ .cse164 .cse165) 256))) (and (<= .cse163 127) (<= .cse164 c_gcd_test_~a) (< 127 (mod (+ (* 255 .cse164) .cse165) 256)) (not (= .cse164 0)) (not (= .cse165 0)) (not (= .cse166 0)) (<= .cse166 127) (< .cse166 0) (= c_gcd_test_~b .cse163) (< .cse164 0) (<= (mod .cse165 256) 127))))))) .cse5) (and (exists ((v_prenex_133 Int)) (let ((.cse170 (mod (* 255 v_prenex_133) 256))) (let ((.cse169 (mod (mod |c_gcd_test_#in~a| .cse170) 256))) (let ((.cse167 (mod .cse170 .cse169))) (let ((.cse168 (mod (+ .cse167 .cse169) 256))) (and (<= (mod .cse167 256) 127) (= (+ c_gcd_test_~b 256) .cse168) (< .cse169 0) (< .cse170 0) (< 127 .cse168) (<= .cse169 c_gcd_test_~a) (<= .cse170 127) (not (= .cse170 0)) (not (= .cse169 0)) (not (= .cse167 0)) (< 127 (mod (+ .cse167 (* 255 .cse169)) 256)))))))) .cse5) (and (exists ((v_prenex_167 Int)) (let ((.cse172 (mod (* 255 v_prenex_167) 256))) (let ((.cse175 (+ .cse172 (- 256)))) (let ((.cse171 (mod (mod |c_gcd_test_#in~a| .cse175) 256))) (let ((.cse173 (mod .cse175 .cse171))) (let ((.cse174 (mod (+ .cse173 .cse171) 256))) (and (<= .cse171 c_gcd_test_~a) (not (= 0 .cse171)) (< 127 .cse172) (< 127 (mod .cse173 256)) (<= (mod (+ .cse173 (* 255 .cse171)) 256) 127) (< .cse172 256) (< .cse171 0) (not (= .cse173 0)) (< 127 .cse174) (= (+ c_gcd_test_~b 256) .cse174)))))))) .cse5) (and (exists ((v_prenex_187 Int)) (let ((.cse178 (mod (* 255 v_prenex_187) 256))) (let ((.cse180 (+ .cse178 (- 256)))) (let ((.cse177 (mod (mod |c_gcd_test_#in~a| .cse180) 256))) (let ((.cse176 (mod .cse180 .cse177))) (let ((.cse179 (mod (+ .cse176 (* 255 .cse177)) 256))) (and (not (= 0 .cse176)) (<= 0 .cse177) (< 127 .cse178) (<= .cse177 c_gcd_test_~a) (not (= .cse177 0)) (< .cse178 256) (= c_gcd_test_~b .cse179) (<= (mod .cse176 256) 127) (< 127 (mod (+ .cse176 .cse177) 256)) (<= .cse179 127)))))))) .cse5) (and (exists ((v_prenex_149 Int)) (let ((.cse183 (mod (* 255 v_prenex_149) 256))) (let ((.cse185 (+ .cse183 (- 256)))) (let ((.cse182 (mod (mod |c_gcd_test_#in~a| .cse185) 256))) (let ((.cse181 (mod .cse185 .cse182))) (let ((.cse184 (mod (+ .cse181 .cse182) 256))) (and (not (= .cse181 0)) (< 127 (mod (+ .cse181 (* 255 .cse182)) 256)) (< 127 .cse183) (< 127 (mod .cse181 256)) (< 127 .cse184) (< .cse182 0) (< .cse183 256) (<= .cse182 c_gcd_test_~a) (= (+ c_gcd_test_~b 256) .cse184) (not (= .cse182 0))))))))) .cse5) (and (exists ((v_prenex_120 Int)) (let ((.cse187 (mod (* 255 v_prenex_120) 256))) (let ((.cse188 (mod (mod |c_gcd_test_#in~a| .cse187) 256))) (let ((.cse189 (mod .cse187 .cse188))) (let ((.cse186 (mod (+ .cse189 (* 255 .cse188)) 256))) (and (= (+ c_gcd_test_~b 256) .cse186) (<= .cse187 127) (<= .cse188 c_gcd_test_~a) (not (= .cse188 0)) (<= (mod (+ .cse189 .cse188) 256) 127) (not (= 0 .cse187)) (<= 0 .cse188) (not (= .cse189 0)) (<= (mod .cse189 256) 127) (< 127 .cse186) (< .cse187 0))))))) .cse5) (and (exists ((v_prenex_185 Int)) (let ((.cse190 (mod (* 255 v_prenex_185) 256))) (let ((.cse194 (+ .cse190 (- 256)))) (let ((.cse191 (mod (mod |c_gcd_test_#in~a| .cse194) 256))) (let ((.cse193 (mod .cse194 .cse191))) (let ((.cse192 (mod .cse193 256))) (and (<= 256 .cse190) (< 127 .cse190) (not (= .cse191 0)) (<= .cse191 c_gcd_test_~a) (= c_gcd_test_~b .cse192) (< .cse191 0) (<= (mod (+ .cse193 (* 255 .cse191)) 256) 127) (<= .cse192 127)))))))) .cse5) (and .cse5 (exists ((v_prenex_143 Int)) (let ((.cse198 (mod (* 255 v_prenex_143) 256))) (let ((.cse199 (+ .cse198 (- 256)))) (let ((.cse196 (mod (mod |c_gcd_test_#in~a| .cse199) 256))) (let ((.cse195 (mod .cse199 .cse196))) (let ((.cse197 (mod (+ .cse195 (* 255 .cse196)) 256))) (and (<= (mod .cse195 256) 127) (<= .cse196 c_gcd_test_~a) (< 127 .cse197) (<= 0 .cse196) (= (+ c_gcd_test_~b 256) .cse197) (< 127 .cse198) (not (= 0 .cse196)) (not (= .cse195 0)) (< .cse198 256) (<= (mod (+ .cse195 .cse196) 256) 127))))))))) (and (exists ((v_prenex_88 Int)) (let ((.cse200 (mod (* 255 v_prenex_88) 256))) (let ((.cse204 (+ .cse200 (- 256)))) (let ((.cse203 (mod (mod |c_gcd_test_#in~a| .cse204) 256))) (let ((.cse201 (mod .cse204 .cse203))) (let ((.cse202 (mod .cse201 256))) (and (< 127 .cse200) (= .cse201 0) (< 127 .cse202) (not (= .cse203 0)) (<= .cse203 c_gcd_test_~a) (< .cse203 0) (<= (mod (+ .cse201 (* 255 .cse203)) 256) 127) (= (+ c_gcd_test_~b 256) .cse202)))))))) .cse5) (and (exists ((v_prenex_161 Int)) (let ((.cse207 (mod (* 255 v_prenex_161) 256))) (let ((.cse209 (+ .cse207 (- 256)))) (let ((.cse205 (mod (mod |c_gcd_test_#in~a| .cse209) 256))) (let ((.cse206 (mod .cse209 .cse205))) (let ((.cse208 (mod (+ (* 255 .cse205) .cse206) 256))) (and (< 127 (mod (+ .cse205 .cse206) 256)) (<= 0 .cse205) (< 127 .cse207) (< .cse207 256) (< 127 .cse208) (<= .cse205 c_gcd_test_~a) (not (= 0 .cse205)) (< 127 (mod .cse206 256)) (not (= .cse206 0)) (= (+ c_gcd_test_~b 256) .cse208)))))))) .cse5) (and (exists ((v_prenex_139 Int)) (let ((.cse210 (mod (* 255 v_prenex_139) 256))) (let ((.cse212 (mod (mod |c_gcd_test_#in~a| .cse210) 256))) (let ((.cse213 (mod .cse210 .cse212))) (let ((.cse211 (mod .cse213 256))) (and (<= 0 .cse210) (<= .cse211 127) (<= .cse212 c_gcd_test_~a) (not (= .cse210 0)) (= c_gcd_test_~b .cse211) (<= (mod (+ (* 255 .cse212) .cse213) 256) 127) (not (= 0 .cse212)) (<= 0 .cse212) (<= .cse210 127))))))) .cse5) (and (exists ((v_prenex_97 Int)) (let ((.cse214 (mod (* 255 v_prenex_97) 256))) (let ((.cse217 (mod (mod |c_gcd_test_#in~a| .cse214) 256))) (let ((.cse215 (mod .cse214 .cse217))) (let ((.cse216 (mod (+ (* 255 .cse217) .cse215) 256))) (and (not (= 0 .cse214)) (not (= .cse215 0)) (< 127 (mod .cse215 256)) (< 127 .cse216) (= (+ c_gcd_test_~b 256) .cse216) (< 127 (mod (+ .cse217 .cse215) 256)) (not (= .cse217 0)) (<= .cse214 127) (< .cse214 0) (<= .cse217 c_gcd_test_~a) (<= 0 .cse217))))))) .cse5) (and (exists ((v_prenex_130 Int)) (let ((.cse218 (mod (* 255 v_prenex_130) 256))) (let ((.cse220 (mod (mod |c_gcd_test_#in~a| .cse218) 256))) (let ((.cse219 (mod .cse218 .cse220))) (let ((.cse221 (mod (+ .cse219 .cse220) 256))) (and (<= .cse218 127) (< 127 (mod (+ .cse219 (* 255 .cse220)) 256)) (not (= 0 .cse219)) (< .cse218 0) (not (= 0 .cse218)) (<= .cse220 c_gcd_test_~a) (not (= 0 .cse220)) (<= .cse221 127) (= c_gcd_test_~b .cse221) (< 127 (mod .cse219 256)) (< .cse220 0))))))) .cse5) (and .cse5 (exists ((v_prenex_177 Int)) (let ((.cse222 (mod (* 255 v_prenex_177) 256))) (let ((.cse226 (+ .cse222 (- 256)))) (let ((.cse223 (mod (mod |c_gcd_test_#in~a| .cse226) 256))) (let ((.cse224 (mod .cse226 .cse223))) (let ((.cse225 (mod (+ .cse224 .cse223) 256))) (and (< 127 .cse222) (<= .cse223 c_gcd_test_~a) (not (= .cse223 0)) (< .cse223 0) (not (= 0 .cse224)) (< 127 (mod (+ .cse224 (* 255 .cse223)) 256)) (< .cse222 256) (< 127 .cse225) (<= (mod .cse224 256) 127) (= (+ c_gcd_test_~b 256) .cse225))))))))) (and .cse5 (exists ((v_prenex_132 Int)) (let ((.cse227 (mod (* 255 v_prenex_132) 256))) (let ((.cse229 (mod (mod |c_gcd_test_#in~a| .cse227) 256))) (let ((.cse228 (mod .cse227 .cse229))) (let ((.cse230 (mod (+ (* 255 .cse229) .cse228) 256))) (and (not (= 0 .cse227)) (< 127 (mod .cse228 256)) (not (= .cse229 0)) (<= (mod (+ .cse229 .cse228) 256) 127) (<= 0 .cse229) (not (= .cse228 0)) (= c_gcd_test_~b .cse230) (<= .cse229 c_gcd_test_~a) (<= .cse227 127) (< .cse227 0) (<= .cse230 127)))))))) (and (exists ((v_prenex_169 Int)) (let ((.cse234 (mod (* 255 v_prenex_169) 256))) (let ((.cse235 (+ .cse234 (- 256)))) (let ((.cse232 (mod (mod |c_gcd_test_#in~a| .cse235) 256))) (let ((.cse233 (mod .cse235 .cse232))) (let ((.cse231 (mod .cse233 256))) (and (= c_gcd_test_~b .cse231) (<= 0 .cse232) (= 0 .cse233) (< 127 (mod (+ (* 255 .cse232) .cse233) 256)) (<= .cse231 127) (< 127 .cse234) (not (= .cse232 0)) (<= .cse232 c_gcd_test_~a)))))))) .cse5) (and (exists ((v_prenex_110 Int)) (let ((.cse236 (mod (* 255 v_prenex_110) 256))) (let ((.cse239 (mod (mod |c_gcd_test_#in~a| .cse236) 256))) (let ((.cse238 (mod .cse236 .cse239))) (let ((.cse237 (mod (+ .cse238 (* 255 .cse239)) 256))) (and (< .cse236 0) (= c_gcd_test_~b .cse237) (not (= 0 .cse236)) (<= .cse236 127) (not (= .cse238 0)) (<= 0 .cse239) (<= .cse239 c_gcd_test_~a) (<= .cse237 127) (not (= 0 .cse239)) (<= (mod .cse238 256) 127) (< 127 (mod (+ .cse238 .cse239) 256)))))))) .cse5) (and (exists ((v_prenex_191 Int)) (let ((.cse241 (mod (* 255 v_prenex_191) 256))) (let ((.cse244 (+ .cse241 (- 256)))) (let ((.cse240 (mod (mod |c_gcd_test_#in~a| .cse244) 256))) (let ((.cse243 (mod .cse244 .cse240))) (let ((.cse242 (mod .cse243 256))) (and (not (= .cse240 0)) (< 127 .cse241) (<= .cse242 127) (< .cse240 0) (<= .cse240 c_gcd_test_~a) (< 127 (mod (+ .cse243 (* 255 .cse240)) 256)) (<= 256 .cse241) (= c_gcd_test_~b .cse242)))))))) .cse5) (and (exists ((v_prenex_95 Int)) (let ((.cse246 (mod (* 255 v_prenex_95) 256))) (let ((.cse245 (mod (mod |c_gcd_test_#in~a| .cse246) 256))) (let ((.cse247 (mod .cse246 .cse245))) (let ((.cse248 (mod .cse247 256))) (and (not (= .cse245 0)) (not (= 0 .cse246)) (<= .cse245 c_gcd_test_~a) (<= 0 .cse245) (<= (mod (+ (* 255 .cse245) .cse247) 256) 127) (= (+ c_gcd_test_~b 256) .cse248) (< 127 .cse248) (<= 0 .cse246) (<= .cse246 127))))))) .cse5) (and (exists ((v_prenex_169 Int)) (let ((.cse252 (mod (* 255 v_prenex_169) 256))) (let ((.cse253 (+ .cse252 (- 256)))) (let ((.cse249 (mod (mod |c_gcd_test_#in~a| .cse253) 256))) (let ((.cse251 (mod .cse253 .cse249))) (let ((.cse250 (mod .cse251 256))) (and (< .cse249 0) (= c_gcd_test_~b .cse250) (= 0 .cse251) (< 127 (mod (+ (* 255 .cse249) .cse251) 256)) (<= .cse250 127) (< 127 .cse252) (not (= .cse249 0)) (<= .cse249 c_gcd_test_~a)))))))) .cse5) (and .cse5 (exists ((v_prenex_179 Int)) (let ((.cse256 (mod (* 255 v_prenex_179) 256))) (let ((.cse258 (+ .cse256 (- 256)))) (let ((.cse254 (mod (mod |c_gcd_test_#in~a| .cse258) 256))) (let ((.cse255 (mod .cse258 .cse254))) (let ((.cse257 (mod .cse255 256))) (and (<= .cse254 c_gcd_test_~a) (= 0 .cse255) (not (= 0 .cse254)) (< .cse254 0) (< 127 .cse256) (= (+ c_gcd_test_~b 256) .cse257) (< 127 .cse257) (< 127 (mod (+ .cse255 (* 255 .cse254)) 256)))))))))) (and (exists ((v_prenex_91 Int)) (let ((.cse259 (mod (* 255 v_prenex_91) 256))) (let ((.cse261 (mod (mod |c_gcd_test_#in~a| .cse259) 256))) (let ((.cse262 (mod .cse259 .cse261))) (let ((.cse260 (mod (+ .cse261 .cse262) 256))) (and (< .cse259 0) (= (+ c_gcd_test_~b 256) .cse260) (not (= .cse261 0)) (< 127 .cse260) (not (= 0 .cse259)) (< .cse261 0) (<= .cse261 c_gcd_test_~a) (<= .cse259 127) (<= (mod (+ (* 255 .cse261) .cse262) 256) 127) (<= (mod .cse262 256) 127) (not (= .cse262 0)))))))) .cse5) (and .cse5 (exists ((v_prenex_99 Int)) (let ((.cse266 (mod (* 255 v_prenex_99) 256))) (let ((.cse264 (mod (mod |c_gcd_test_#in~a| .cse266) 256))) (let ((.cse265 (mod .cse266 .cse264))) (let ((.cse263 (mod (+ .cse265 (* 255 .cse264)) 256))) (and (= (+ c_gcd_test_~b 256) .cse263) (<= .cse264 c_gcd_test_~a) (<= (mod .cse265 256) 127) (not (= .cse265 0)) (<= .cse266 127) (< 127 (mod (+ .cse265 .cse264) 256)) (< 127 .cse263) (<= 0 .cse264) (not (= 0 .cse264)) (not (= .cse266 0)) (< .cse266 0)))))))) (and .cse5 (exists ((v_prenex_101 Int)) (let ((.cse267 (mod (* 255 v_prenex_101) 256))) (let ((.cse269 (mod (mod |c_gcd_test_#in~a| .cse267) 256))) (let ((.cse270 (mod .cse267 .cse269))) (let ((.cse268 (mod .cse270 256))) (and (<= .cse267 127) (= (+ c_gcd_test_~b 256) .cse268) (< .cse269 0) (<= .cse269 c_gcd_test_~a) (not (= 0 .cse269)) (not (= 0 .cse267)) (<= (mod (+ .cse270 (* 255 .cse269)) 256) 127) (< 127 .cse268) (= 0 .cse270)))))))) (and (exists ((v_prenex_181 Int)) (let ((.cse271 (mod (* 255 v_prenex_181) 256))) (let ((.cse275 (+ .cse271 (- 256)))) (let ((.cse273 (mod (mod |c_gcd_test_#in~a| .cse275) 256))) (let ((.cse272 (mod .cse275 .cse273))) (let ((.cse274 (mod (+ .cse273 .cse272) 256))) (and (< 127 .cse271) (<= (mod .cse272 256) 127) (<= .cse273 c_gcd_test_~a) (< .cse273 0) (not (= 0 .cse272)) (< .cse271 256) (not (= 0 .cse273)) (= c_gcd_test_~b .cse274) (< 127 (mod (+ (* 255 .cse273) .cse272) 256)) (<= .cse274 127)))))))) .cse5) (and .cse5 (exists ((v_prenex_103 Int)) (let ((.cse276 (mod (* 255 v_prenex_103) 256))) (let ((.cse277 (mod (mod |c_gcd_test_#in~a| .cse276) 256))) (let ((.cse278 (mod .cse276 .cse277))) (let ((.cse279 (mod (+ (* 255 .cse277) .cse278) 256))) (and (<= .cse276 127) (< 127 (mod (+ .cse277 .cse278) 256)) (not (= .cse278 0)) (< 127 (mod .cse278 256)) (<= 0 .cse277) (<= .cse279 127) (<= .cse277 c_gcd_test_~a) (not (= 0 .cse277)) (not (= .cse276 0)) (< .cse276 0) (= c_gcd_test_~b .cse279)))))))) (and (exists ((v_prenex_126 Int)) (let ((.cse281 (mod (* 255 v_prenex_126) 256))) (let ((.cse280 (mod (mod |c_gcd_test_#in~a| .cse281) 256))) (let ((.cse282 (mod .cse281 .cse280))) (let ((.cse283 (mod (+ (* 255 .cse280) .cse282) 256))) (and (<= 0 .cse280) (not (= 0 .cse281)) (<= (mod (+ .cse280 .cse282) 256) 127) (< 127 .cse283) (not (= 0 .cse282)) (<= .cse280 c_gcd_test_~a) (<= .cse281 127) (< 127 (mod .cse282 256)) (not (= .cse280 0)) (= (+ c_gcd_test_~b 256) .cse283) (< .cse281 0))))))) .cse5) (and (exists ((v_prenex_155 Int)) (let ((.cse284 (mod (* 255 v_prenex_155) 256))) (let ((.cse288 (+ .cse284 (- 256)))) (let ((.cse286 (mod (mod |c_gcd_test_#in~a| .cse288) 256))) (let ((.cse285 (mod .cse288 .cse286))) (let ((.cse287 (mod .cse285 256))) (and (<= 256 .cse284) (< 127 (mod (+ .cse285 (* 255 .cse286)) 256)) (< 127 .cse284) (= (+ c_gcd_test_~b 256) .cse287) (< 127 .cse287) (<= .cse286 c_gcd_test_~a) (not (= .cse286 0)) (< .cse286 0)))))))) .cse5))) is different from false [2018-10-27 00:14:59,032 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 00:14:59,033 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:221) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:140) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:102) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.pop(WrapperScript.java:106) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UndoableWrapperScript.pop(UndoableWrapperScript.java:58) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:67) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:626) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:122) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:187) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:150) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:354) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:216) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 46 more [2018-10-27 00:14:59,037 INFO L168 Benchmark]: Toolchain (without parser) took 203817.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 957.0 MB in the beginning and 885.6 MB in the end (delta: 71.3 MB). Peak memory consumption was 219.7 MB. Max. memory is 11.5 GB. [2018-10-27 00:14:59,038 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 00:14:59,039 INFO L168 Benchmark]: CACSL2BoogieTranslator took 190.51 ms. Allocated memory is still 1.0 GB. Free memory was 957.0 MB in the beginning and 945.2 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-10-27 00:14:59,039 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.33 ms. Allocated memory is still 1.0 GB. Free memory is still 945.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 00:14:59,040 INFO L168 Benchmark]: Boogie Preprocessor took 18.85 ms. Allocated memory is still 1.0 GB. Free memory was 945.2 MB in the beginning and 942.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 00:14:59,040 INFO L168 Benchmark]: RCFGBuilder took 560.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -200.9 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2018-10-27 00:14:59,041 INFO L168 Benchmark]: TraceAbstraction took 203027.57 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -6.8 MB). Free memory was 1.1 GB in the beginning and 885.6 MB in the end (delta: 255.1 MB). Peak memory consumption was 248.2 MB. Max. memory is 11.5 GB. [2018-10-27 00:14:59,047 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 190.51 ms. Allocated memory is still 1.0 GB. Free memory was 957.0 MB in the beginning and 945.2 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.33 ms. Allocated memory is still 1.0 GB. Free memory is still 945.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.85 ms. Allocated memory is still 1.0 GB. Free memory was 945.2 MB in the beginning and 942.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 560.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -200.9 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 203027.57 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -6.8 MB). Free memory was 1.1 GB in the beginning and 885.6 MB in the end (delta: 255.1 MB). Peak memory consumption was 248.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-10-27 00:15:01,020 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 00:15:01,021 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 00:15:01,032 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 00:15:01,032 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 00:15:01,033 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 00:15:01,035 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 00:15:01,037 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 00:15:01,038 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 00:15:01,039 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 00:15:01,040 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 00:15:01,040 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 00:15:01,041 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 00:15:01,042 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 00:15:01,044 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 00:15:01,044 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 00:15:01,045 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 00:15:01,047 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 00:15:01,049 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 00:15:01,051 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 00:15:01,052 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 00:15:01,053 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 00:15:01,055 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 00:15:01,055 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 00:15:01,056 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 00:15:01,056 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 00:15:01,057 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 00:15:01,059 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 00:15:01,059 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 00:15:01,060 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 00:15:01,061 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 00:15:01,061 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 00:15:01,061 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 00:15:01,062 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 00:15:01,063 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 00:15:01,064 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 00:15:01,064 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d3bd7b1f-edc4-45c5-8f5a-9236492060b3/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-10-27 00:15:01,078 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 00:15:01,079 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 00:15:01,079 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 00:15:01,080 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 00:15:01,080 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 00:15:01,080 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 00:15:01,080 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 00:15:01,080 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 00:15:01,081 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 00:15:01,081 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 00:15:01,081 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 00:15:01,083 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 00:15:01,083 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 00:15:01,083 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 00:15:01,083 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 00:15:01,083 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-10-27 00:15:01,084 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-10-27 00:15:01,084 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 00:15:01,084 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 00:15:01,084 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 00:15:01,084 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 00:15:01,085 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 00:15:01,085 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 00:15:01,085 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 00:15:01,085 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 00:15:01,085 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 00:15:01,086 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 00:15:01,086 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 00:15:01,086 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-10-27 00:15:01,086 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 00:15:01,086 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-10-27 00:15:01,086 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-10-27 00:15:01,087 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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-vcloud-master/worker/working_dir_d3bd7b1f-edc4-45c5-8f5a-9236492060b3/bin-2019/utaipan 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(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 02e9294118e002d2445af62127a7232f85fd6228 [2018-10-27 00:15:01,129 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 00:15:01,141 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 00:15:01,145 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 00:15:01,146 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 00:15:01,147 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 00:15:01,147 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d3bd7b1f-edc4-45c5-8f5a-9236492060b3/bin-2019/utaipan/../../sv-benchmarks/c/bitvector/gcd_3_true-unreach-call_true-no-overflow.i [2018-10-27 00:15:01,201 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d3bd7b1f-edc4-45c5-8f5a-9236492060b3/bin-2019/utaipan/data/81e904e9d/d78918922a6b407b976fb102c4899c3b/FLAGee564c640 [2018-10-27 00:15:01,601 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 00:15:01,601 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d3bd7b1f-edc4-45c5-8f5a-9236492060b3/sv-benchmarks/c/bitvector/gcd_3_true-unreach-call_true-no-overflow.i [2018-10-27 00:15:01,607 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d3bd7b1f-edc4-45c5-8f5a-9236492060b3/bin-2019/utaipan/data/81e904e9d/d78918922a6b407b976fb102c4899c3b/FLAGee564c640 [2018-10-27 00:15:01,620 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d3bd7b1f-edc4-45c5-8f5a-9236492060b3/bin-2019/utaipan/data/81e904e9d/d78918922a6b407b976fb102c4899c3b [2018-10-27 00:15:01,624 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 00:15:01,625 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 00:15:01,627 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 00:15:01,627 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 00:15:01,632 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 00:15:01,633 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:15:01" (1/1) ... [2018-10-27 00:15:01,635 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f2575ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:15:01, skipping insertion in model container [2018-10-27 00:15:01,635 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:15:01" (1/1) ... [2018-10-27 00:15:01,647 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 00:15:01,667 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 00:15:01,841 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 00:15:01,847 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 00:15:01,867 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 00:15:01,884 INFO L193 MainTranslator]: Completed translation [2018-10-27 00:15:01,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:15:01 WrapperNode [2018-10-27 00:15:01,891 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 00:15:01,892 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 00:15:01,892 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 00:15:01,892 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 00:15:01,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:15:01" (1/1) ... [2018-10-27 00:15:01,909 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:15:01" (1/1) ... [2018-10-27 00:15:01,915 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 00:15:01,915 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 00:15:01,916 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 00:15:01,916 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 00:15:01,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:15:01" (1/1) ... [2018-10-27 00:15:01,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:15:01" (1/1) ... [2018-10-27 00:15:01,928 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:15:01" (1/1) ... [2018-10-27 00:15:01,929 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:15:01" (1/1) ... [2018-10-27 00:15:01,933 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:15:01" (1/1) ... [2018-10-27 00:15:01,942 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:15:01" (1/1) ... [2018-10-27 00:15:01,944 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:15:01" (1/1) ... [2018-10-27 00:15:01,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 00:15:01,953 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 00:15:01,953 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 00:15:01,953 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 00:15:01,954 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:15:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bd7b1f-edc4-45c5-8f5a-9236492060b3/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 00:15:02,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 00:15:02,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 00:15:02,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 00:15:02,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 00:15:02,026 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 00:15:02,027 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 00:15:02,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-27 00:15:02,027 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-27 00:15:02,027 INFO L130 BoogieDeclarations]: Found specification of procedure gcd_test [2018-10-27 00:15:02,027 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd_test [2018-10-27 00:15:02,438 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 00:15:02,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:15:02 BoogieIcfgContainer [2018-10-27 00:15:02,444 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 00:15:02,445 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 00:15:02,445 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 00:15:02,448 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 00:15:02,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 12:15:01" (1/3) ... [2018-10-27 00:15:02,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cfbbba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:15:02, skipping insertion in model container [2018-10-27 00:15:02,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:15:01" (2/3) ... [2018-10-27 00:15:02,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cfbbba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:15:02, skipping insertion in model container [2018-10-27 00:15:02,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:15:02" (3/3) ... [2018-10-27 00:15:02,451 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_3_true-unreach-call_true-no-overflow.i [2018-10-27 00:15:02,460 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 00:15:02,466 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 00:15:02,482 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 00:15:02,512 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 00:15:02,512 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 00:15:02,512 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 00:15:02,513 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 00:15:02,513 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 00:15:02,513 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 00:15:02,513 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 00:15:02,513 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 00:15:02,513 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 00:15:02,531 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-10-27 00:15:02,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-27 00:15:02,538 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:15:02,539 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:15:02,541 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:15:02,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:15:02,547 INFO L82 PathProgramCache]: Analyzing trace with hash 697993246, now seen corresponding path program 1 times [2018-10-27 00:15:02,551 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 00:15:02,552 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bd7b1f-edc4-45c5-8f5a-9236492060b3/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 00:15:02,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:15:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:15:02,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 00:15:02,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:15:02,638 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 00:15:02,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:15:02,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 00:15:02,648 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-27 00:15:02,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 00:15:02,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 00:15:02,665 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-10-27 00:15:02,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:15:02,689 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-10-27 00:15:02,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 00:15:02,691 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-10-27 00:15:02,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:15:02,700 INFO L225 Difference]: With dead ends: 45 [2018-10-27 00:15:02,700 INFO L226 Difference]: Without dead ends: 21 [2018-10-27 00:15:02,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 00:15:02,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-27 00:15:02,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-27 00:15:02,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-27 00:15:02,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-10-27 00:15:02,740 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 19 [2018-10-27 00:15:02,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:15:02,740 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-10-27 00:15:02,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-27 00:15:02,740 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-10-27 00:15:02,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-27 00:15:02,741 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:15:02,741 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:15:02,743 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:15:02,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:15:02,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1860320398, now seen corresponding path program 1 times [2018-10-27 00:15:02,744 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 00:15:02,744 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bd7b1f-edc4-45c5-8f5a-9236492060b3/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 00:15:02,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:15:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:15:02,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 00:15:02,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:15:02,859 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (3)] Exception during sending of exit command (exit): Stream closed [2018-10-27 00:15:02,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:15:02,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 00:15:02,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 00:15:02,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 00:15:02,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:15:02,865 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 3 states. [2018-10-27 00:15:02,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:15:02,946 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-10-27 00:15:02,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 00:15:02,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-10-27 00:15:02,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:15:02,948 INFO L225 Difference]: With dead ends: 33 [2018-10-27 00:15:02,948 INFO L226 Difference]: Without dead ends: 23 [2018-10-27 00:15:02,949 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 00:15:02,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-27 00:15:02,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-27 00:15:02,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-27 00:15:02,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-10-27 00:15:02,957 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 20 [2018-10-27 00:15:02,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:15:02,958 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-10-27 00:15:02,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 00:15:02,958 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-10-27 00:15:02,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-27 00:15:02,959 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:15:02,959 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:15:02,959 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:15:02,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:15:02,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1602154960, now seen corresponding path program 1 times [2018-10-27 00:15:02,960 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 00:15:02,960 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bd7b1f-edc4-45c5-8f5a-9236492060b3/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 00:15:02,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:15:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:15:03,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 00:15:03,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:15:03,429 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 00:15:03,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:15:03,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-27 00:15:03,432 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 00:15:03,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 00:15:03,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-27 00:15:03,432 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 9 states. [2018-10-27 00:15:03,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:15:03,736 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-10-27 00:15:03,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 00:15:03,738 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-10-27 00:15:03,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:15:03,740 INFO L225 Difference]: With dead ends: 38 [2018-10-27 00:15:03,741 INFO L226 Difference]: Without dead ends: 28 [2018-10-27 00:15:03,742 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-10-27 00:15:03,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-27 00:15:03,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2018-10-27 00:15:03,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-27 00:15:03,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-10-27 00:15:03,748 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 20 [2018-10-27 00:15:03,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:15:03,750 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-10-27 00:15:03,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 00:15:03,751 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-10-27 00:15:03,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-27 00:15:03,752 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:15:03,752 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:15:03,752 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:15:03,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:15:03,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1015348946, now seen corresponding path program 1 times [2018-10-27 00:15:03,753 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 00:15:03,753 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bd7b1f-edc4-45c5-8f5a-9236492060b3/bin-2019/utaipan/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 00:15:03,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:15:03,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:15:03,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 00:15:03,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:15:03,840 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-27 00:15:03,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 00:15:03,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 00:15:03,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 00:15:03,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 00:15:03,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:15:03,843 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 5 states. [2018-10-27 00:15:03,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:15:03,987 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-10-27 00:15:03,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 00:15:03,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-10-27 00:15:03,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:15:03,989 INFO L225 Difference]: With dead ends: 38 [2018-10-27 00:15:03,989 INFO L226 Difference]: Without dead ends: 23 [2018-10-27 00:15:03,990 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 00:15:03,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-27 00:15:03,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-27 00:15:03,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-27 00:15:03,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-10-27 00:15:03,995 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2018-10-27 00:15:03,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:15:03,995 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-10-27 00:15:03,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 00:15:03,995 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-10-27 00:15:03,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-27 00:15:03,996 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:15:03,996 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:15:03,996 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:15:03,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:15:03,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1311173036, now seen corresponding path program 1 times [2018-10-27 00:15:03,997 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 00:15:03,997 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bd7b1f-edc4-45c5-8f5a-9236492060b3/bin-2019/utaipan/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 00:15:04,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:15:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:15:04,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 00:15:04,453 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-27 00:15:04,797 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-27 00:15:05,262 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-27 00:15:05,739 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-27 00:15:06,398 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-27 00:15:07,231 WARN L179 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-10-27 00:15:07,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:15:07,812 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 00:15:09,458 WARN L179 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-10-27 00:15:09,626 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-27 00:15:09,867 WARN L179 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-10-27 00:15:10,095 WARN L179 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-10-27 00:15:12,848 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-27 00:15:14,223 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-27 00:15:14,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:15:14,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 00:15:14,330 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bd7b1f-edc4-45c5-8f5a-9236492060b3/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 00:15:14,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 00:15:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 00:15:14,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 00:15:15,336 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-27 00:15:16,696 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-27 00:15:17,790 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-27 00:15:18,747 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-27 00:15:19,731 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-27 00:15:20,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:15:20,364 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 00:15:20,540 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-27 00:15:20,699 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-27 00:15:20,935 WARN L179 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-27 00:15:21,124 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-27 00:15:23,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 00:15:23,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-10-27 00:15:23,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12, 12] total 27 [2018-10-27 00:15:23,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-27 00:15:23,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-27 00:15:23,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2018-10-27 00:15:23,165 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 27 states. [2018-10-27 00:15:27,848 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-27 00:15:29,186 WARN L179 SmtUtils]: Spent 435.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-10-27 00:15:33,954 WARN L179 SmtUtils]: Spent 1.64 s on a formula simplification that was a NOOP. DAG size: 25 [2018-10-27 00:15:36,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 00:15:36,545 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2018-10-27 00:15:36,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-27 00:15:36,546 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 22 [2018-10-27 00:15:36,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 00:15:36,547 INFO L225 Difference]: With dead ends: 48 [2018-10-27 00:15:36,547 INFO L226 Difference]: Without dead ends: 29 [2018-10-27 00:15:36,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 23.3s TimeCoverageRelationStatistics Valid=140, Invalid=852, Unknown=0, NotChecked=0, Total=992 [2018-10-27 00:15:36,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-27 00:15:36,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-27 00:15:36,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-27 00:15:36,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-10-27 00:15:36,553 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 22 [2018-10-27 00:15:36,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 00:15:36,553 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-10-27 00:15:36,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-27 00:15:36,554 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-10-27 00:15:36,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-27 00:15:36,554 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 00:15:36,554 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 00:15:36,555 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 00:15:36,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 00:15:36,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1408562522, now seen corresponding path program 2 times [2018-10-27 00:15:36,555 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-27 00:15:36,555 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bd7b1f-edc4-45c5-8f5a-9236492060b3/bin-2019/utaipan/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 00:15:36,574 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-10-27 00:15:37,216 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 00:15:37,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 00:15:37,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 00:15:38,076 WARN L179 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2018-10-27 00:15:38,917 WARN L179 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-10-27 00:15:43,460 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-27 00:15:43,461 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:621) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:122) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:187) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:150) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:354) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 45 more [2018-10-27 00:15:43,467 INFO L168 Benchmark]: Toolchain (without parser) took 41842.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 951.9 MB in the beginning and 818.2 MB in the end (delta: 133.7 MB). Peak memory consumption was 254.3 MB. Max. memory is 11.5 GB. [2018-10-27 00:15:43,468 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 00:15:43,468 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.67 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 941.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-27 00:15:43,469 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.27 ms. Allocated memory is still 1.0 GB. Free memory was 941.2 MB in the beginning and 935.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-27 00:15:43,469 INFO L168 Benchmark]: Boogie Preprocessor took 37.07 ms. Allocated memory is still 1.0 GB. Free memory is still 935.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 00:15:43,470 INFO L168 Benchmark]: RCFGBuilder took 491.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 935.8 MB in the beginning and 1.1 GB in the end (delta: -161.7 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2018-10-27 00:15:43,470 INFO L168 Benchmark]: TraceAbstraction took 41020.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 818.2 MB in the end (delta: 279.3 MB). Peak memory consumption was 279.3 MB. Max. memory is 11.5 GB. [2018-10-27 00:15:43,474 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 264.67 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 941.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.27 ms. Allocated memory is still 1.0 GB. Free memory was 941.2 MB in the beginning and 935.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.07 ms. Allocated memory is still 1.0 GB. Free memory is still 935.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 491.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 935.8 MB in the beginning and 1.1 GB in the end (delta: -161.7 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 41020.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 818.2 MB in the end (delta: 279.3 MB). Peak memory consumption was 279.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...