./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-acceleration/diamond_2-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1ace554d-579d-4704-8e19-c61918849f2f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1ace554d-579d-4704-8e19-c61918849f2f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1ace554d-579d-4704-8e19-c61918849f2f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1ace554d-579d-4704-8e19-c61918849f2f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-acceleration/diamond_2-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_1ace554d-579d-4704-8e19-c61918849f2f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1ace554d-579d-4704-8e19-c61918849f2f/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4c239e25bc1e45e912a3e7b96bb82f6853e587e9 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 00:57:22,777 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 00:57:22,779 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 00:57:22,789 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 00:57:22,789 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 00:57:22,790 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 00:57:22,792 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 00:57:22,793 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 00:57:22,795 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 00:57:22,796 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 00:57:22,797 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 00:57:22,798 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 00:57:22,798 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 00:57:22,799 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 00:57:22,800 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 00:57:22,805 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 00:57:22,805 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 00:57:22,806 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 00:57:22,808 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 00:57:22,810 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 00:57:22,812 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 00:57:22,813 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 00:57:22,814 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 00:57:22,814 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 00:57:22,817 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 00:57:22,817 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 00:57:22,818 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 00:57:22,819 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 00:57:22,819 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 00:57:22,820 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 00:57:22,820 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 00:57:22,821 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 00:57:22,821 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 00:57:22,822 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 00:57:22,823 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 00:57:22,823 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 00:57:22,824 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 00:57:22,824 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 00:57:22,824 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 00:57:22,825 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 00:57:22,825 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 00:57:22,826 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1ace554d-579d-4704-8e19-c61918849f2f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 00:57:22,838 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 00:57:22,839 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 00:57:22,840 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 00:57:22,840 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 00:57:22,840 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 00:57:22,841 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 00:57:22,841 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 00:57:22,841 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 00:57:22,841 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 00:57:22,841 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 00:57:22,842 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 00:57:22,842 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 00:57:22,842 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 00:57:22,842 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 00:57:22,843 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 00:57:22,843 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 00:57:22,843 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 00:57:22,843 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 00:57:22,843 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 00:57:22,844 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 00:57:22,844 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 00:57:22,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 00:57:22,844 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 00:57:22,845 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 00:57:22,845 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 00:57:22,845 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 00:57:22,845 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 00:57:22,845 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 00:57:22,846 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_1ace554d-579d-4704-8e19-c61918849f2f/bin/uautomizer 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4c239e25bc1e45e912a3e7b96bb82f6853e587e9 [2019-11-20 00:57:23,036 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 00:57:23,045 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 00:57:23,048 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 00:57:23,049 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 00:57:23,050 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 00:57:23,050 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1ace554d-579d-4704-8e19-c61918849f2f/bin/uautomizer/../../sv-benchmarks/c/loop-acceleration/diamond_2-2.c [2019-11-20 00:57:23,114 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1ace554d-579d-4704-8e19-c61918849f2f/bin/uautomizer/data/b6115b49e/2219dc1004764b15853595f517b6dace/FLAGed76fbf33 [2019-11-20 00:57:23,517 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 00:57:23,518 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1ace554d-579d-4704-8e19-c61918849f2f/sv-benchmarks/c/loop-acceleration/diamond_2-2.c [2019-11-20 00:57:23,524 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1ace554d-579d-4704-8e19-c61918849f2f/bin/uautomizer/data/b6115b49e/2219dc1004764b15853595f517b6dace/FLAGed76fbf33 [2019-11-20 00:57:23,901 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1ace554d-579d-4704-8e19-c61918849f2f/bin/uautomizer/data/b6115b49e/2219dc1004764b15853595f517b6dace [2019-11-20 00:57:23,903 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 00:57:23,907 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 00:57:23,908 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 00:57:23,908 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 00:57:23,911 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 00:57:23,912 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:57:23" (1/1) ... [2019-11-20 00:57:23,915 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46ab6543 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:57:23, skipping insertion in model container [2019-11-20 00:57:23,915 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:57:23" (1/1) ... [2019-11-20 00:57:23,922 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 00:57:23,942 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 00:57:24,120 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:57:24,124 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 00:57:24,224 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:57:24,237 INFO L192 MainTranslator]: Completed translation [2019-11-20 00:57:24,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:57:24 WrapperNode [2019-11-20 00:57:24,237 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 00:57:24,238 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 00:57:24,238 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 00:57:24,238 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 00:57:24,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:57:24" (1/1) ... [2019-11-20 00:57:24,251 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:57:24" (1/1) ... [2019-11-20 00:57:24,277 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 00:57:24,278 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 00:57:24,278 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 00:57:24,278 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 00:57:24,286 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:57:24" (1/1) ... [2019-11-20 00:57:24,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:57:24" (1/1) ... [2019-11-20 00:57:24,288 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:57:24" (1/1) ... [2019-11-20 00:57:24,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:57:24" (1/1) ... [2019-11-20 00:57:24,291 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:57:24" (1/1) ... [2019-11-20 00:57:24,295 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:57:24" (1/1) ... [2019-11-20 00:57:24,306 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:57:24" (1/1) ... [2019-11-20 00:57:24,308 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 00:57:24,309 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 00:57:24,309 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 00:57:24,309 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 00:57:24,310 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:57:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ace554d-579d-4704-8e19-c61918849f2f/bin/uautomizer/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 [2019-11-20 00:57:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 00:57:24,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 00:57:24,625 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 00:57:24,625 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 00:57:24,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:57:24 BoogieIcfgContainer [2019-11-20 00:57:24,626 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 00:57:24,627 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 00:57:24,627 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 00:57:24,630 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 00:57:24,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:57:23" (1/3) ... [2019-11-20 00:57:24,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48b9bc7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:57:24, skipping insertion in model container [2019-11-20 00:57:24,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:57:24" (2/3) ... [2019-11-20 00:57:24,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48b9bc7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:57:24, skipping insertion in model container [2019-11-20 00:57:24,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:57:24" (3/3) ... [2019-11-20 00:57:24,633 INFO L109 eAbstractionObserver]: Analyzing ICFG diamond_2-2.c [2019-11-20 00:57:24,641 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 00:57:24,647 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 00:57:24,668 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 00:57:24,694 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 00:57:24,694 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 00:57:24,694 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 00:57:24,694 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 00:57:24,695 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 00:57:24,695 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 00:57:24,695 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 00:57:24,695 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 00:57:24,708 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-11-20 00:57:24,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-20 00:57:24,714 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:57:24,715 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-20 00:57:24,715 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:57:24,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:57:24,721 INFO L82 PathProgramCache]: Analyzing trace with hash 31771204, now seen corresponding path program 1 times [2019-11-20 00:57:24,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:57:24,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580222684] [2019-11-20 00:57:24,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:57:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:57:24,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:57:24,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580222684] [2019-11-20 00:57:24,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:57:24,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:57:24,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196814049] [2019-11-20 00:57:24,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 00:57:24,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:57:24,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 00:57:24,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 00:57:24,824 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-11-20 00:57:24,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:57:24,836 INFO L93 Difference]: Finished difference Result 26 states and 38 transitions. [2019-11-20 00:57:24,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 00:57:24,837 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-11-20 00:57:24,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:57:24,844 INFO L225 Difference]: With dead ends: 26 [2019-11-20 00:57:24,844 INFO L226 Difference]: Without dead ends: 16 [2019-11-20 00:57:24,846 INFO L630 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 [2019-11-20 00:57:24,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-11-20 00:57:24,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-20 00:57:24,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-20 00:57:24,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 26 transitions. [2019-11-20 00:57:24,874 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 26 transitions. Word has length 5 [2019-11-20 00:57:24,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:57:24,875 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 26 transitions. [2019-11-20 00:57:24,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 00:57:24,875 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 26 transitions. [2019-11-20 00:57:24,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-20 00:57:24,875 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:57:24,875 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-20 00:57:24,876 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:57:24,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:57:24,876 INFO L82 PathProgramCache]: Analyzing trace with hash 29864580, now seen corresponding path program 1 times [2019-11-20 00:57:24,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:57:24,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556855111] [2019-11-20 00:57:24,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:57:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:57:24,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:57:24,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556855111] [2019-11-20 00:57:24,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:57:24,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:57:24,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382894504] [2019-11-20 00:57:24,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:57:24,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:57:24,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:57:24,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:57:24,991 INFO L87 Difference]: Start difference. First operand 16 states and 26 transitions. Second operand 3 states. [2019-11-20 00:57:25,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:57:25,063 INFO L93 Difference]: Finished difference Result 22 states and 33 transitions. [2019-11-20 00:57:25,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:57:25,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-20 00:57:25,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:57:25,066 INFO L225 Difference]: With dead ends: 22 [2019-11-20 00:57:25,066 INFO L226 Difference]: Without dead ends: 18 [2019-11-20 00:57:25,067 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:57:25,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-11-20 00:57:25,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-11-20 00:57:25,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-20 00:57:25,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 27 transitions. [2019-11-20 00:57:25,072 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 27 transitions. Word has length 5 [2019-11-20 00:57:25,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:57:25,072 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 27 transitions. [2019-11-20 00:57:25,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:57:25,072 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 27 transitions. [2019-11-20 00:57:25,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 00:57:25,073 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:57:25,073 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:57:25,074 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:57:25,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:57:25,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1273519218, now seen corresponding path program 1 times [2019-11-20 00:57:25,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:57:25,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132937629] [2019-11-20 00:57:25,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:57:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:57:27,153 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 27 DAG size of output: 12 [2019-11-20 00:57:27,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:57:27,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132937629] [2019-11-20 00:57:27,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:57:27,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:57:27,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406424986] [2019-11-20 00:57:27,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:57:27,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:57:27,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:57:27,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:57:27,161 INFO L87 Difference]: Start difference. First operand 17 states and 27 transitions. Second operand 3 states. [2019-11-20 00:57:27,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:57:27,287 INFO L93 Difference]: Finished difference Result 47 states and 77 transitions. [2019-11-20 00:57:27,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:57:27,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-20 00:57:27,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:57:27,290 INFO L225 Difference]: With dead ends: 47 [2019-11-20 00:57:27,290 INFO L226 Difference]: Without dead ends: 32 [2019-11-20 00:57:27,290 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:57:27,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-20 00:57:27,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2019-11-20 00:57:27,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-20 00:57:27,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2019-11-20 00:57:27,299 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 16 [2019-11-20 00:57:27,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:57:27,299 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2019-11-20 00:57:27,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:57:27,306 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2019-11-20 00:57:27,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 00:57:27,307 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:57:27,307 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:57:27,309 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:57:27,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:57:27,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1974583796, now seen corresponding path program 1 times [2019-11-20 00:57:27,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:57:27,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195662828] [2019-11-20 00:57:27,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:57:27,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:57:27,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:57:27,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195662828] [2019-11-20 00:57:27,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845207288] [2019-11-20 00:57:27,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ace554d-579d-4704-8e19-c61918849f2f/bin/uautomizer/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 [2019-11-20 00:57:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:57:27,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-20 00:57:27,701 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:57:27,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:57:27,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:57:27,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-11-20 00:57:27,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032117861] [2019-11-20 00:57:27,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 00:57:27,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:57:27,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 00:57:27,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-11-20 00:57:27,784 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand 14 states. [2019-11-20 00:57:28,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:57:28,050 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2019-11-20 00:57:28,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 00:57:28,051 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 16 [2019-11-20 00:57:28,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:57:28,052 INFO L225 Difference]: With dead ends: 45 [2019-11-20 00:57:28,052 INFO L226 Difference]: Without dead ends: 41 [2019-11-20 00:57:28,053 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-11-20 00:57:28,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-20 00:57:28,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-11-20 00:57:28,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-20 00:57:28,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2019-11-20 00:57:28,059 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 16 [2019-11-20 00:57:28,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:57:28,059 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2019-11-20 00:57:28,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 00:57:28,059 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2019-11-20 00:57:28,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 00:57:28,060 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:57:28,060 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:57:28,261 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:57:28,261 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:57:28,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:57:28,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1309266250, now seen corresponding path program 1 times [2019-11-20 00:57:28,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:57:28,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511956365] [2019-11-20 00:57:28,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:57:28,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:57:28,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:57:28,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511956365] [2019-11-20 00:57:28,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:57:28,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:57:28,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471441297] [2019-11-20 00:57:28,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:57:28,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:57:28,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:57:28,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:57:28,324 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand 3 states. [2019-11-20 00:57:28,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:57:28,403 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2019-11-20 00:57:28,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:57:28,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-20 00:57:28,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:57:28,405 INFO L225 Difference]: With dead ends: 58 [2019-11-20 00:57:28,405 INFO L226 Difference]: Without dead ends: 43 [2019-11-20 00:57:28,405 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:57:28,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-20 00:57:28,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2019-11-20 00:57:28,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-20 00:57:28,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-11-20 00:57:28,413 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 16 [2019-11-20 00:57:28,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:57:28,414 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-11-20 00:57:28,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:57:28,414 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-11-20 00:57:28,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 00:57:28,415 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:57:28,415 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:57:28,416 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:57:28,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:57:28,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1301479604, now seen corresponding path program 1 times [2019-11-20 00:57:28,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:57:28,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343199825] [2019-11-20 00:57:28,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:57:28,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:57:32,806 WARN L191 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 40 DAG size of output: 18 [2019-11-20 00:57:34,846 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse11 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse18 (* 2 .cse11))) (let ((.cse15 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse3 (= .cse18 c_ULTIMATE.start_main_~y~0)) (.cse19 (* .cse11 (- 2)))) (let ((.cse17 (div (+ .cse19 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296)) (.cse4 (not .cse3)) (.cse5 (< c_ULTIMATE.start_main_~y~0 .cse15)) (.cse16 (div (+ .cse19 c_ULTIMATE.start_main_~y~0) 4294967296))) (let ((.cse14 (+ .cse18 (* 4294967296 .cse16))) (.cse2 (and .cse4 .cse5)) (.cse1 (<= .cse15 c_ULTIMATE.start_main_~y~0)) (.cse6 (+ (* 4294967296 .cse17) .cse18 2))) (let ((.cse0 (or .cse1 .cse3 (< .cse6 c_ULTIMATE.start_main_~y~0))) (.cse12 (or (< .cse14 c_ULTIMATE.start_main_~y~0) .cse2)) (.cse10 (or .cse1 .cse3)) (.cse7 (+ .cse17 1)) (.cse13 (+ .cse16 1))) (and .cse0 (or .cse1 .cse2 .cse3) (or (and .cse4 .cse5 (<= c_ULTIMATE.start_main_~y~0 .cse6)) (and .cse4 .cse5 (<= .cse7 0)) (and .cse0 (let ((.cse8 (* 2 c_ULTIMATE.start_main_~y~0)) (.cse9 (* 4 .cse11))) (or (and .cse4 .cse5 (<= (+ (* 2 (div (+ c_ULTIMATE.start_main_~x~0 2) 2)) .cse8) (+ .cse9 c_ULTIMATE.start_main_~x~0 5))) (and (<= (+ (* 2 (div c_ULTIMATE.start_main_~x~0 2)) .cse8) (+ .cse9 c_ULTIMATE.start_main_~x~0 1)) .cse10))) .cse12) (and .cse10 (<= .cse13 0)) (and (<= c_ULTIMATE.start_main_~y~0 .cse14) .cse10)) (< .cse15 (+ c_ULTIMATE.start_main_~y~0 1)) (or .cse1 (not (= .cse6 c_ULTIMATE.start_main_~y~0)) .cse3) .cse12 (or (and (<= 0 .cse16) .cse10) (and .cse4 .cse5 (<= 0 .cse17)) (and (or (< 0 .cse7) .cse1 .cse3) (or .cse2 (< 0 .cse13)))) (or (not (= .cse14 c_ULTIMATE.start_main_~y~0)) .cse2)))))))) is different from false [2019-11-20 00:57:36,882 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse18 (* 2 .cse7))) (let ((.cse15 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse14 (= .cse18 c_ULTIMATE.start_main_~y~0)) (.cse19 (* .cse7 (- 2)))) (let ((.cse17 (div (+ .cse19 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296)) (.cse0 (not .cse14)) (.cse1 (< c_ULTIMATE.start_main_~y~0 .cse15)) (.cse16 (div (+ .cse19 c_ULTIMATE.start_main_~y~0) 4294967296))) (let ((.cse11 (+ .cse18 (* 4294967296 .cse16))) (.cse13 (and .cse0 .cse1)) (.cse12 (<= .cse15 c_ULTIMATE.start_main_~y~0)) (.cse2 (+ (* 4294967296 .cse17) .cse18 2))) (let ((.cse8 (or .cse12 .cse14 (< .cse2 c_ULTIMATE.start_main_~y~0))) (.cse9 (or (< .cse11 c_ULTIMATE.start_main_~y~0) .cse13)) (.cse4 (or .cse12 .cse14)) (.cse3 (+ .cse17 1)) (.cse10 (+ .cse16 1))) (and (or (and .cse0 .cse1 (<= c_ULTIMATE.start_main_~y~0 .cse2)) (and .cse0 .cse1 (<= .cse3 0)) (and (let ((.cse5 (* 2 c_ULTIMATE.start_main_~y~0)) (.cse6 (* 4 .cse7))) (or (and .cse4 (<= (+ (* 2 (div (+ c_ULTIMATE.start_main_~x~0 2) 2)) .cse5) (+ .cse6 c_ULTIMATE.start_main_~x~0 3))) (and .cse0 .cse1 (<= (+ (* 2 (div (+ c_ULTIMATE.start_main_~x~0 4) 2)) .cse5) (+ .cse6 c_ULTIMATE.start_main_~x~0 7))))) .cse8 .cse9) (and .cse4 (<= .cse10 0)) (and (<= c_ULTIMATE.start_main_~y~0 .cse11) .cse4)) .cse8 (or .cse12 .cse13 .cse14) (< .cse15 (+ c_ULTIMATE.start_main_~y~0 1)) (or .cse12 (not (= .cse2 c_ULTIMATE.start_main_~y~0)) .cse14) .cse9 (or (and (<= 0 .cse16) .cse4) (and .cse0 .cse1 (<= 0 .cse17)) (and (or (< 0 .cse3) .cse12 .cse14) (or .cse13 (< 0 .cse10)))) (or (not (= .cse11 c_ULTIMATE.start_main_~y~0)) .cse13)))))))) is different from false [2019-11-20 00:57:38,907 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse7 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse18 (* 2 .cse7))) (let ((.cse15 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse14 (= .cse18 c_ULTIMATE.start_main_~y~0)) (.cse19 (* .cse7 (- 2)))) (let ((.cse17 (div (+ .cse19 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296)) (.cse0 (not .cse14)) (.cse1 (< c_ULTIMATE.start_main_~y~0 .cse15)) (.cse16 (div (+ .cse19 c_ULTIMATE.start_main_~y~0) 4294967296))) (let ((.cse11 (+ .cse18 (* 4294967296 .cse16))) (.cse13 (and .cse0 .cse1)) (.cse12 (<= .cse15 c_ULTIMATE.start_main_~y~0)) (.cse2 (+ (* 4294967296 .cse17) .cse18 2))) (let ((.cse8 (or .cse12 .cse14 (< .cse2 c_ULTIMATE.start_main_~y~0))) (.cse9 (or (< .cse11 c_ULTIMATE.start_main_~y~0) .cse13)) (.cse4 (or .cse12 .cse14)) (.cse3 (+ .cse17 1)) (.cse10 (+ .cse16 1))) (and (or (and .cse0 .cse1 (<= c_ULTIMATE.start_main_~y~0 .cse2)) (and .cse0 .cse1 (<= .cse3 0)) (and (let ((.cse5 (* 2 c_ULTIMATE.start_main_~y~0)) (.cse6 (* 4 .cse7))) (or (and .cse4 (<= (+ (* 2 (div (+ c_ULTIMATE.start_main_~x~0 2) 2)) .cse5) (+ .cse6 c_ULTIMATE.start_main_~x~0 3))) (and .cse0 .cse1 (<= (+ (* 2 (div (+ c_ULTIMATE.start_main_~x~0 4) 2)) .cse5) (+ .cse6 c_ULTIMATE.start_main_~x~0 7))))) .cse8 .cse9) (and .cse4 (<= .cse10 0)) (and (<= c_ULTIMATE.start_main_~y~0 .cse11) .cse4)) .cse8 (or .cse12 .cse13 .cse14) (< .cse15 (+ c_ULTIMATE.start_main_~y~0 1)) (or .cse12 (not (= .cse2 c_ULTIMATE.start_main_~y~0)) .cse14) .cse9 (or (and (<= 0 .cse16) .cse4) (and .cse0 .cse1 (<= 0 .cse17)) (and (or (< 0 .cse3) .cse12 .cse14) (or .cse13 (< 0 .cse10)))) (or (not (= .cse11 c_ULTIMATE.start_main_~y~0)) .cse13)))))))) is different from true [2019-11-20 00:57:40,946 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse12 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse0 (* 2 .cse12)) (.cse23 (* .cse12 (- 2)))) (let ((.cse16 (div (+ .cse23 c_ULTIMATE.start_main_~y~0) 4294967296)) (.cse7 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse19 (= .cse0 c_ULTIMATE.start_main_~y~0)) (.cse17 (div (+ .cse23 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296))) (let ((.cse3 (* 4294967296 .cse17)) (.cse4 (not .cse19)) (.cse5 (< c_ULTIMATE.start_main_~y~0 .cse7)) (.cse1 (* 4294967296 .cse16))) (let ((.cse21 (+ .cse0 .cse1)) (.cse20 (and .cse4 .cse5)) (.cse18 (<= .cse7 c_ULTIMATE.start_main_~y~0)) (.cse22 (+ .cse3 .cse0 2))) (let ((.cse6 (or .cse18 .cse19 (< .cse22 c_ULTIMATE.start_main_~y~0))) (.cse8 (or .cse18 (not (= .cse22 c_ULTIMATE.start_main_~y~0)) .cse19)) (.cse9 (or (< .cse21 c_ULTIMATE.start_main_~y~0) .cse20)) (.cse2 (or .cse18 .cse19)) (.cse14 (+ .cse17 1)) (.cse15 (+ .cse16 1)) (.cse13 (or (not (= .cse21 c_ULTIMATE.start_main_~y~0)) .cse20))) (and (or (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse0 .cse1 4294967295)) .cse2) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse3 .cse0 4294967297)) .cse4 .cse5)) .cse6 (< .cse7 (+ c_ULTIMATE.start_main_~y~0 1)) .cse8 .cse9 (or (and .cse6 (let ((.cse10 (+ (* 2 (div (+ c_ULTIMATE.start_main_~x~0 2) 2)) (* 2 c_ULTIMATE.start_main_~y~0))) (.cse11 (* 4 .cse12))) (or (and .cse2 (<= .cse10 (+ .cse11 c_ULTIMATE.start_main_~x~0 3))) (and (<= .cse10 (+ .cse11 c_ULTIMATE.start_main_~x~0 7)) .cse4 .cse5))) .cse8 .cse9 .cse13) (and .cse4 .cse5 (<= .cse14 0)) (and .cse2 (<= .cse15 0))) (or (and (<= 0 .cse16) .cse2) (and .cse4 .cse5 (<= 0 .cse17)) (and (or (< 0 .cse14) .cse18 .cse19) (or .cse20 (< 0 .cse15)))) .cse13))))))) is different from false [2019-11-20 00:57:42,979 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse11 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse0 (* 2 .cse11)) (.cse23 (* .cse11 (- 2)))) (let ((.cse15 (div (+ .cse23 c_ULTIMATE.start_main_~y~0) 4294967296)) (.cse22 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse18 (= .cse0 c_ULTIMATE.start_main_~y~0)) (.cse16 (div (+ .cse23 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296))) (let ((.cse3 (* 4294967296 .cse16)) (.cse4 (not .cse18)) (.cse5 (< c_ULTIMATE.start_main_~y~0 .cse22)) (.cse1 (* 4294967296 .cse15))) (let ((.cse20 (+ .cse0 .cse1)) (.cse19 (and .cse4 .cse5)) (.cse17 (<= .cse22 c_ULTIMATE.start_main_~y~0)) (.cse21 (+ .cse3 .cse0 2))) (let ((.cse6 (or .cse17 .cse18 (< .cse21 c_ULTIMATE.start_main_~y~0))) (.cse7 (or .cse17 (not (= .cse21 c_ULTIMATE.start_main_~y~0)) .cse18)) (.cse8 (or (< .cse20 c_ULTIMATE.start_main_~y~0) .cse19)) (.cse2 (or .cse17 .cse18)) (.cse13 (+ .cse16 1)) (.cse14 (+ .cse15 1)) (.cse12 (or (not (= .cse20 c_ULTIMATE.start_main_~y~0)) .cse19))) (and (or (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse0 .cse1 4294967295)) .cse2) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse3 .cse0 4294967297)) .cse4 .cse5)) .cse6 .cse7 .cse8 (or (and (let ((.cse9 (+ (* 2 (div c_ULTIMATE.start_main_~x~0 2)) (* 2 c_ULTIMATE.start_main_~y~0))) (.cse10 (* 4 .cse11))) (or (and .cse4 .cse5 (<= .cse9 (+ .cse10 c_ULTIMATE.start_main_~x~0 5))) (and (<= .cse9 (+ .cse10 c_ULTIMATE.start_main_~x~0 1)) .cse2))) .cse6 .cse7 .cse8 .cse12) (and .cse4 .cse5 (<= .cse13 0)) (and .cse2 (<= .cse14 0))) (or (and (<= 0 .cse15) .cse2) (and .cse4 .cse5 (<= 0 .cse16)) (and (or (< 0 .cse13) .cse17 .cse18) (or .cse19 (< 0 .cse14)))) .cse12))))))) is different from false [2019-11-20 00:57:44,989 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse11 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse0 (* 2 .cse11)) (.cse23 (* .cse11 (- 2)))) (let ((.cse15 (div (+ .cse23 c_ULTIMATE.start_main_~y~0) 4294967296)) (.cse22 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse18 (= .cse0 c_ULTIMATE.start_main_~y~0)) (.cse16 (div (+ .cse23 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296))) (let ((.cse3 (* 4294967296 .cse16)) (.cse4 (not .cse18)) (.cse5 (< c_ULTIMATE.start_main_~y~0 .cse22)) (.cse1 (* 4294967296 .cse15))) (let ((.cse20 (+ .cse0 .cse1)) (.cse19 (and .cse4 .cse5)) (.cse17 (<= .cse22 c_ULTIMATE.start_main_~y~0)) (.cse21 (+ .cse3 .cse0 2))) (let ((.cse6 (or .cse17 .cse18 (< .cse21 c_ULTIMATE.start_main_~y~0))) (.cse7 (or .cse17 (not (= .cse21 c_ULTIMATE.start_main_~y~0)) .cse18)) (.cse8 (or (< .cse20 c_ULTIMATE.start_main_~y~0) .cse19)) (.cse2 (or .cse17 .cse18)) (.cse13 (+ .cse16 1)) (.cse14 (+ .cse15 1)) (.cse12 (or (not (= .cse20 c_ULTIMATE.start_main_~y~0)) .cse19))) (and (or (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse0 .cse1 4294967295)) .cse2) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse3 .cse0 4294967297)) .cse4 .cse5)) .cse6 .cse7 .cse8 (or (and (let ((.cse9 (+ (* 2 (div c_ULTIMATE.start_main_~x~0 2)) (* 2 c_ULTIMATE.start_main_~y~0))) (.cse10 (* 4 .cse11))) (or (and .cse4 .cse5 (<= .cse9 (+ .cse10 c_ULTIMATE.start_main_~x~0 5))) (and (<= .cse9 (+ .cse10 c_ULTIMATE.start_main_~x~0 1)) .cse2))) .cse6 .cse7 .cse8 .cse12) (and .cse4 .cse5 (<= .cse13 0)) (and .cse2 (<= .cse14 0))) (or (and (<= 0 .cse15) .cse2) (and .cse4 .cse5 (<= 0 .cse16)) (and (or (< 0 .cse13) .cse17 .cse18) (or .cse19 (< 0 .cse14)))) .cse12))))))) is different from true [2019-11-20 00:57:53,164 WARN L191 SmtUtils]: Spent 6.12 s on a formula simplification. DAG size of input: 80 DAG size of output: 25 [2019-11-20 00:57:55,218 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse0 (* 2 .cse9))) (let ((.cse18 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse16 (= .cse0 c_ULTIMATE.start_main_~y~0)) (.cse19 (* .cse9 (- 2)))) (let ((.cse14 (div (+ .cse19 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296)) (.cse4 (not .cse16)) (.cse5 (< c_ULTIMATE.start_main_~y~0 .cse18)) (.cse13 (div (+ .cse19 c_ULTIMATE.start_main_~y~0) 4294967296))) (let ((.cse1 (* 4294967296 .cse13)) (.cse17 (and .cse4 .cse5)) (.cse15 (<= .cse18 c_ULTIMATE.start_main_~y~0)) (.cse3 (* 4294967296 .cse14))) (let ((.cse6 (or .cse15 .cse16 (< (+ .cse3 .cse0 2) c_ULTIMATE.start_main_~y~0))) (.cse10 (or (< (+ .cse0 .cse1) c_ULTIMATE.start_main_~y~0) .cse17)) (.cse2 (or .cse15 .cse16)) (.cse11 (+ .cse14 1)) (.cse12 (+ .cse13 1))) (and (or (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse0 .cse1 4294967295)) .cse2) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse3 .cse0 4294967297)) .cse4 .cse5)) .cse6 (or (and .cse6 (let ((.cse7 (+ (* 2 (div (+ c_ULTIMATE.start_main_~x~0 2) 2)) (* 2 c_ULTIMATE.start_main_~y~0))) (.cse8 (* 4 .cse9))) (or (and .cse2 (<= .cse7 (+ .cse8 c_ULTIMATE.start_main_~x~0 3))) (and (<= .cse7 (+ .cse8 c_ULTIMATE.start_main_~x~0 7)) .cse4 .cse5))) .cse10) (and .cse4 .cse5 (<= .cse11 0)) (and .cse2 (<= .cse12 0))) .cse10 (or (and (<= 0 .cse13) .cse2) (and .cse4 .cse5 (<= 0 .cse14)) (and (or (< 0 .cse11) .cse15 .cse16) (or .cse17 (< 0 .cse12))))))))))) is different from false [2019-11-20 00:57:57,228 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse9 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse0 (* 2 .cse9))) (let ((.cse18 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse16 (= .cse0 c_ULTIMATE.start_main_~y~0)) (.cse19 (* .cse9 (- 2)))) (let ((.cse14 (div (+ .cse19 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296)) (.cse4 (not .cse16)) (.cse5 (< c_ULTIMATE.start_main_~y~0 .cse18)) (.cse13 (div (+ .cse19 c_ULTIMATE.start_main_~y~0) 4294967296))) (let ((.cse1 (* 4294967296 .cse13)) (.cse17 (and .cse4 .cse5)) (.cse15 (<= .cse18 c_ULTIMATE.start_main_~y~0)) (.cse3 (* 4294967296 .cse14))) (let ((.cse6 (or .cse15 .cse16 (< (+ .cse3 .cse0 2) c_ULTIMATE.start_main_~y~0))) (.cse10 (or (< (+ .cse0 .cse1) c_ULTIMATE.start_main_~y~0) .cse17)) (.cse2 (or .cse15 .cse16)) (.cse11 (+ .cse14 1)) (.cse12 (+ .cse13 1))) (and (or (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse0 .cse1 4294967295)) .cse2) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse3 .cse0 4294967297)) .cse4 .cse5)) .cse6 (or (and .cse6 (let ((.cse7 (+ (* 2 (div (+ c_ULTIMATE.start_main_~x~0 2) 2)) (* 2 c_ULTIMATE.start_main_~y~0))) (.cse8 (* 4 .cse9))) (or (and .cse2 (<= .cse7 (+ .cse8 c_ULTIMATE.start_main_~x~0 3))) (and (<= .cse7 (+ .cse8 c_ULTIMATE.start_main_~x~0 7)) .cse4 .cse5))) .cse10) (and .cse4 .cse5 (<= .cse11 0)) (and .cse2 (<= .cse12 0))) .cse10 (or (and (<= 0 .cse13) .cse2) (and .cse4 .cse5 (<= 0 .cse14)) (and (or (< 0 .cse11) .cse15 .cse16) (or .cse17 (< 0 .cse12))))))))))) is different from true [2019-11-20 00:57:59,266 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse35 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse24 (* 2 .cse35))) (let ((.cse39 (div c_ULTIMATE.start_main_~x~0 2)) (.cse37 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse19 (= .cse24 c_ULTIMATE.start_main_~y~0)) (.cse40 (* .cse35 (- 2)))) (let ((.cse17 (div (+ .cse40 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296)) (.cse2 (not .cse19)) (.cse3 (< c_ULTIMATE.start_main_~y~0 .cse37)) (.cse16 (div (+ .cse40 c_ULTIMATE.start_main_~y~0) 4294967296)) (.cse13 (* 2 .cse39)) (.cse36 (* 4294967296 (div c_ULTIMATE.start_main_~x~0 4294967296))) (.cse38 (* .cse39 (- 2)))) (let ((.cse0 (div (+ .cse38 c_ULTIMATE.start_main_~x~0) 4294967296)) (.cse21 (div (+ .cse38 c_ULTIMATE.start_main_~x~0 (- 2)) 4294967296)) (.cse22 (<= .cse36 c_ULTIMATE.start_main_~x~0)) (.cse23 (= c_ULTIMATE.start_main_~x~0 .cse13)) (.cse25 (* 4294967296 .cse16)) (.cse20 (and .cse2 .cse3)) (.cse26 (* 4294967296 .cse17)) (.cse18 (<= .cse37 c_ULTIMATE.start_main_~y~0))) (let ((.cse6 (* 8589934592 .cse16)) (.cse5 (or .cse18 .cse19)) (.cse11 (* 8589934592 .cse17)) (.cse27 (or .cse18 .cse19 (< (+ .cse26 .cse24 2) c_ULTIMATE.start_main_~y~0))) (.cse28 (or (< (+ .cse24 .cse25) c_ULTIMATE.start_main_~y~0) .cse20)) (.cse1 (or .cse22 .cse23)) (.cse14 (* 4294967296 .cse21)) (.cse15 (* 4294967296 .cse0)) (.cse9 (< c_ULTIMATE.start_main_~x~0 .cse36)) (.cse10 (not .cse23))) (or (and (<= (+ .cse0 1) 0) .cse1) (and (or (let ((.cse4 (+ .cse17 1)) (.cse12 (+ .cse16 1))) (and (let ((.cse7 (+ .cse13 .cse15)) (.cse8 (+ .cse13 .cse14 3))) (or (and .cse2 .cse3 (<= .cse4 0)) (and .cse5 (or (and .cse1 (<= (+ c_ULTIMATE.start_main_~x~0 .cse6 1) .cse7)) (and (<= (+ c_ULTIMATE.start_main_~x~0 .cse6) .cse8) .cse9 .cse10))) (and .cse2 .cse3 (or (and (<= (+ .cse11 c_ULTIMATE.start_main_~x~0 1) .cse7) .cse1) (and (<= (+ .cse11 c_ULTIMATE.start_main_~x~0) .cse8) .cse9 .cse10))) (and .cse5 (<= .cse12 0)))) (or (and (<= 0 .cse16) .cse5) (and .cse2 .cse3 (<= 0 .cse17)) (and (or (< 0 .cse4) .cse18 .cse19) (or .cse20 (< 0 .cse12)))))) (and (or (< 0 .cse21) .cse22 .cse23) (or (and .cse9 .cse10) (< 0 .cse0)))) (or (and (or (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse24 .cse25 4294967295)) .cse5) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse26 .cse24 4294967297)) .cse2 .cse3)) .cse27 .cse28) (and (<= .cse21 0) .cse9 .cse10) (and .cse1 (<= .cse0 0)))) (and .cse27 .cse28 (let ((.cse29 (+ .cse24 c_ULTIMATE.start_main_~x~0 .cse25)) (.cse30 (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse15)) (.cse34 (+ .cse26 .cse24 c_ULTIMATE.start_main_~x~0))) (or (and (or (and .cse1 (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse15 1) .cse29)) (and (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse14 3) .cse29) .cse9 .cse10)) .cse5) (and (let ((.cse33 (* 2 c_ULTIMATE.start_main_~y~0))) (let ((.cse31 (+ .cse13 .cse33 .cse15)) (.cse32 (* 4 .cse35))) (or (and (or (and .cse9 (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse14 2) .cse29) .cse10) (and .cse1 (<= .cse30 .cse29))) .cse5) (and (or (and (<= .cse31 (+ .cse32 c_ULTIMATE.start_main_~x~0 .cse6 1)) .cse1) (and (<= (+ .cse13 .cse33 .cse14 3) (+ .cse32 c_ULTIMATE.start_main_~x~0 .cse6)) .cse9 .cse10)) .cse5) (and .cse2 .cse3 (or (and (<= (+ .cse13 .cse33 .cse14) (+ .cse11 .cse32 c_ULTIMATE.start_main_~x~0 1)) .cse9 .cse10) (and .cse1 (<= .cse31 (+ .cse11 .cse32 c_ULTIMATE.start_main_~x~0 5))))) (and .cse2 .cse3 (or (and .cse9 (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse14) .cse34) .cse10) (and .cse1 (<= .cse30 (+ .cse26 .cse24 c_ULTIMATE.start_main_~x~0 2)))))))) .cse27 .cse28) (and .cse2 .cse3 (or (and (<= .cse30 (+ .cse26 .cse24 c_ULTIMATE.start_main_~x~0 1)) .cse1) (and (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse14 1) .cse34) .cse9 .cse10)))))) (and .cse9 (<= (+ .cse21 1) 0) .cse10)))))))) is different from true [2019-11-20 00:58:01,291 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse36 (* 4294967296 (div c_ULTIMATE.start_main_~x~0 4294967296)))) (and (let ((.cse35 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse24 (* 2 .cse35))) (let ((.cse39 (div c_ULTIMATE.start_main_~x~0 2)) (.cse37 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse19 (= .cse24 c_ULTIMATE.start_main_~y~0)) (.cse40 (* .cse35 (- 2)))) (let ((.cse17 (div (+ .cse40 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296)) (.cse2 (not .cse19)) (.cse3 (< c_ULTIMATE.start_main_~y~0 .cse37)) (.cse16 (div (+ .cse40 c_ULTIMATE.start_main_~y~0) 4294967296)) (.cse13 (* 2 .cse39)) (.cse38 (* .cse39 (- 2)))) (let ((.cse0 (div (+ .cse38 c_ULTIMATE.start_main_~x~0) 4294967296)) (.cse21 (div (+ .cse38 c_ULTIMATE.start_main_~x~0 (- 2)) 4294967296)) (.cse22 (<= .cse36 c_ULTIMATE.start_main_~x~0)) (.cse23 (= c_ULTIMATE.start_main_~x~0 .cse13)) (.cse25 (* 4294967296 .cse16)) (.cse20 (and .cse2 .cse3)) (.cse26 (* 4294967296 .cse17)) (.cse18 (<= .cse37 c_ULTIMATE.start_main_~y~0))) (let ((.cse6 (* 8589934592 .cse16)) (.cse5 (or .cse18 .cse19)) (.cse11 (* 8589934592 .cse17)) (.cse27 (or .cse18 .cse19 (< (+ .cse26 .cse24 2) c_ULTIMATE.start_main_~y~0))) (.cse28 (or (< (+ .cse24 .cse25) c_ULTIMATE.start_main_~y~0) .cse20)) (.cse1 (or .cse22 .cse23)) (.cse14 (* 4294967296 .cse21)) (.cse15 (* 4294967296 .cse0)) (.cse9 (< c_ULTIMATE.start_main_~x~0 .cse36)) (.cse10 (not .cse23))) (or (and (<= (+ .cse0 1) 0) .cse1) (and (or (let ((.cse4 (+ .cse17 1)) (.cse12 (+ .cse16 1))) (and (let ((.cse7 (+ .cse13 .cse15)) (.cse8 (+ .cse13 .cse14 3))) (or (and .cse2 .cse3 (<= .cse4 0)) (and .cse5 (or (and .cse1 (<= (+ c_ULTIMATE.start_main_~x~0 .cse6 1) .cse7)) (and (<= (+ c_ULTIMATE.start_main_~x~0 .cse6) .cse8) .cse9 .cse10))) (and .cse2 .cse3 (or (and (<= (+ .cse11 c_ULTIMATE.start_main_~x~0 1) .cse7) .cse1) (and (<= (+ .cse11 c_ULTIMATE.start_main_~x~0) .cse8) .cse9 .cse10))) (and .cse5 (<= .cse12 0)))) (or (and (<= 0 .cse16) .cse5) (and .cse2 .cse3 (<= 0 .cse17)) (and (or (< 0 .cse4) .cse18 .cse19) (or .cse20 (< 0 .cse12)))))) (and (or (< 0 .cse21) .cse22 .cse23) (or (and .cse9 .cse10) (< 0 .cse0)))) (or (and (or (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse24 .cse25 4294967295)) .cse5) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse26 .cse24 4294967297)) .cse2 .cse3)) .cse27 .cse28) (and (<= .cse21 0) .cse9 .cse10) (and .cse1 (<= .cse0 0)))) (and .cse27 .cse28 (let ((.cse29 (+ .cse24 c_ULTIMATE.start_main_~x~0 .cse25)) (.cse30 (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse15)) (.cse34 (+ .cse26 .cse24 c_ULTIMATE.start_main_~x~0))) (or (and (or (and .cse1 (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse15 1) .cse29)) (and (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse14 3) .cse29) .cse9 .cse10)) .cse5) (and (let ((.cse33 (* 2 c_ULTIMATE.start_main_~y~0))) (let ((.cse31 (+ .cse13 .cse33 .cse15)) (.cse32 (* 4 .cse35))) (or (and (or (and .cse9 (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse14 2) .cse29) .cse10) (and .cse1 (<= .cse30 .cse29))) .cse5) (and (or (and (<= .cse31 (+ .cse32 c_ULTIMATE.start_main_~x~0 .cse6 1)) .cse1) (and (<= (+ .cse13 .cse33 .cse14 3) (+ .cse32 c_ULTIMATE.start_main_~x~0 .cse6)) .cse9 .cse10)) .cse5) (and .cse2 .cse3 (or (and (<= (+ .cse13 .cse33 .cse14) (+ .cse11 .cse32 c_ULTIMATE.start_main_~x~0 1)) .cse9 .cse10) (and .cse1 (<= .cse31 (+ .cse11 .cse32 c_ULTIMATE.start_main_~x~0 5))))) (and .cse2 .cse3 (or (and .cse9 (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse14) .cse34) .cse10) (and .cse1 (<= .cse30 (+ .cse26 .cse24 c_ULTIMATE.start_main_~x~0 2)))))))) .cse27 .cse28) (and .cse2 .cse3 (or (and (<= .cse30 (+ .cse26 .cse24 c_ULTIMATE.start_main_~x~0 1)) .cse1) (and (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse14 1) .cse34) .cse9 .cse10)))))) (and .cse9 (<= (+ .cse21 1) 0) .cse10)))))))) (< .cse36 (+ c_ULTIMATE.start_main_~x~0 1)))) is different from false [2019-11-20 00:58:03,302 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse36 (* 4294967296 (div c_ULTIMATE.start_main_~x~0 4294967296)))) (and (let ((.cse35 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse24 (* 2 .cse35))) (let ((.cse39 (div c_ULTIMATE.start_main_~x~0 2)) (.cse37 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse19 (= .cse24 c_ULTIMATE.start_main_~y~0)) (.cse40 (* .cse35 (- 2)))) (let ((.cse17 (div (+ .cse40 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296)) (.cse2 (not .cse19)) (.cse3 (< c_ULTIMATE.start_main_~y~0 .cse37)) (.cse16 (div (+ .cse40 c_ULTIMATE.start_main_~y~0) 4294967296)) (.cse13 (* 2 .cse39)) (.cse38 (* .cse39 (- 2)))) (let ((.cse0 (div (+ .cse38 c_ULTIMATE.start_main_~x~0) 4294967296)) (.cse21 (div (+ .cse38 c_ULTIMATE.start_main_~x~0 (- 2)) 4294967296)) (.cse22 (<= .cse36 c_ULTIMATE.start_main_~x~0)) (.cse23 (= c_ULTIMATE.start_main_~x~0 .cse13)) (.cse25 (* 4294967296 .cse16)) (.cse20 (and .cse2 .cse3)) (.cse26 (* 4294967296 .cse17)) (.cse18 (<= .cse37 c_ULTIMATE.start_main_~y~0))) (let ((.cse6 (* 8589934592 .cse16)) (.cse5 (or .cse18 .cse19)) (.cse11 (* 8589934592 .cse17)) (.cse27 (or .cse18 .cse19 (< (+ .cse26 .cse24 2) c_ULTIMATE.start_main_~y~0))) (.cse28 (or (< (+ .cse24 .cse25) c_ULTIMATE.start_main_~y~0) .cse20)) (.cse1 (or .cse22 .cse23)) (.cse14 (* 4294967296 .cse21)) (.cse15 (* 4294967296 .cse0)) (.cse9 (< c_ULTIMATE.start_main_~x~0 .cse36)) (.cse10 (not .cse23))) (or (and (<= (+ .cse0 1) 0) .cse1) (and (or (let ((.cse4 (+ .cse17 1)) (.cse12 (+ .cse16 1))) (and (let ((.cse7 (+ .cse13 .cse15)) (.cse8 (+ .cse13 .cse14 3))) (or (and .cse2 .cse3 (<= .cse4 0)) (and .cse5 (or (and .cse1 (<= (+ c_ULTIMATE.start_main_~x~0 .cse6 1) .cse7)) (and (<= (+ c_ULTIMATE.start_main_~x~0 .cse6) .cse8) .cse9 .cse10))) (and .cse2 .cse3 (or (and (<= (+ .cse11 c_ULTIMATE.start_main_~x~0 1) .cse7) .cse1) (and (<= (+ .cse11 c_ULTIMATE.start_main_~x~0) .cse8) .cse9 .cse10))) (and .cse5 (<= .cse12 0)))) (or (and (<= 0 .cse16) .cse5) (and .cse2 .cse3 (<= 0 .cse17)) (and (or (< 0 .cse4) .cse18 .cse19) (or .cse20 (< 0 .cse12)))))) (and (or (< 0 .cse21) .cse22 .cse23) (or (and .cse9 .cse10) (< 0 .cse0)))) (or (and (or (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse24 .cse25 4294967295)) .cse5) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse26 .cse24 4294967297)) .cse2 .cse3)) .cse27 .cse28) (and (<= .cse21 0) .cse9 .cse10) (and .cse1 (<= .cse0 0)))) (and .cse27 .cse28 (let ((.cse29 (+ .cse24 c_ULTIMATE.start_main_~x~0 .cse25)) (.cse30 (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse15)) (.cse34 (+ .cse26 .cse24 c_ULTIMATE.start_main_~x~0))) (or (and (or (and .cse1 (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse15 1) .cse29)) (and (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse14 3) .cse29) .cse9 .cse10)) .cse5) (and (let ((.cse33 (* 2 c_ULTIMATE.start_main_~y~0))) (let ((.cse31 (+ .cse13 .cse33 .cse15)) (.cse32 (* 4 .cse35))) (or (and (or (and .cse9 (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse14 2) .cse29) .cse10) (and .cse1 (<= .cse30 .cse29))) .cse5) (and (or (and (<= .cse31 (+ .cse32 c_ULTIMATE.start_main_~x~0 .cse6 1)) .cse1) (and (<= (+ .cse13 .cse33 .cse14 3) (+ .cse32 c_ULTIMATE.start_main_~x~0 .cse6)) .cse9 .cse10)) .cse5) (and .cse2 .cse3 (or (and (<= (+ .cse13 .cse33 .cse14) (+ .cse11 .cse32 c_ULTIMATE.start_main_~x~0 1)) .cse9 .cse10) (and .cse1 (<= .cse31 (+ .cse11 .cse32 c_ULTIMATE.start_main_~x~0 5))))) (and .cse2 .cse3 (or (and .cse9 (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse14) .cse34) .cse10) (and .cse1 (<= .cse30 (+ .cse26 .cse24 c_ULTIMATE.start_main_~x~0 2)))))))) .cse27 .cse28) (and .cse2 .cse3 (or (and (<= .cse30 (+ .cse26 .cse24 c_ULTIMATE.start_main_~x~0 1)) .cse1) (and (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse14 1) .cse34) .cse9 .cse10)))))) (and .cse9 (<= (+ .cse21 1) 0) .cse10)))))))) (< .cse36 (+ c_ULTIMATE.start_main_~x~0 1)))) is different from true [2019-11-20 00:58:03,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2019-11-20 00:58:03,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343199825] [2019-11-20 00:58:03,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497149234] [2019-11-20 00:58:03,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ace554d-579d-4704-8e19-c61918849f2f/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:58:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:58:03,358 WARN L253 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-20 00:58:03,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:58:03,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:58:03,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:58:03,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 00:58:03,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:58:03,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:58:03,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 18 [2019-11-20 00:58:03,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718928453] [2019-11-20 00:58:03,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-20 00:58:03,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:58:03,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-20 00:58:03,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=106, Unknown=12, NotChecked=182, Total=342 [2019-11-20 00:58:03,534 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 19 states. [2019-11-20 00:58:05,576 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse11 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse18 (* 2 .cse11))) (let ((.cse15 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse3 (= .cse18 c_ULTIMATE.start_main_~y~0)) (.cse19 (* .cse11 (- 2)))) (let ((.cse17 (div (+ .cse19 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296)) (.cse4 (not .cse3)) (.cse5 (< c_ULTIMATE.start_main_~y~0 .cse15)) (.cse16 (div (+ .cse19 c_ULTIMATE.start_main_~y~0) 4294967296))) (let ((.cse14 (+ .cse18 (* 4294967296 .cse16))) (.cse2 (and .cse4 .cse5)) (.cse1 (<= .cse15 c_ULTIMATE.start_main_~y~0)) (.cse6 (+ (* 4294967296 .cse17) .cse18 2))) (let ((.cse0 (or .cse1 .cse3 (< .cse6 c_ULTIMATE.start_main_~y~0))) (.cse12 (or (< .cse14 c_ULTIMATE.start_main_~y~0) .cse2)) (.cse10 (or .cse1 .cse3)) (.cse7 (+ .cse17 1)) (.cse13 (+ .cse16 1))) (and (not (= 0 (mod c_ULTIMATE.start_main_~y~0 2))) .cse0 (or .cse1 .cse2 .cse3) (or (and .cse4 .cse5 (<= c_ULTIMATE.start_main_~y~0 .cse6)) (and .cse4 .cse5 (<= .cse7 0)) (and .cse0 (let ((.cse8 (* 2 c_ULTIMATE.start_main_~y~0)) (.cse9 (* 4 .cse11))) (or (and .cse4 .cse5 (<= (+ (* 2 (div (+ c_ULTIMATE.start_main_~x~0 2) 2)) .cse8) (+ .cse9 c_ULTIMATE.start_main_~x~0 5))) (and (<= (+ (* 2 (div c_ULTIMATE.start_main_~x~0 2)) .cse8) (+ .cse9 c_ULTIMATE.start_main_~x~0 1)) .cse10))) .cse12) (and .cse10 (<= .cse13 0)) (and (<= c_ULTIMATE.start_main_~y~0 .cse14) .cse10)) (< .cse15 (+ c_ULTIMATE.start_main_~y~0 1)) (or .cse1 (not (= .cse6 c_ULTIMATE.start_main_~y~0)) .cse3) .cse12 (= c_ULTIMATE.start_main_~x~0 1) (or (and (<= 0 .cse16) .cse10) (and .cse4 .cse5 (<= 0 .cse17)) (and (or (< 0 .cse7) .cse1 .cse3) (or .cse2 (< 0 .cse13)))) (or (not (= .cse14 c_ULTIMATE.start_main_~y~0)) .cse2)))))))) is different from false [2019-11-20 00:58:07,612 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse18 (* 2 .cse7))) (let ((.cse15 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse14 (= .cse18 c_ULTIMATE.start_main_~y~0)) (.cse19 (* .cse7 (- 2)))) (let ((.cse17 (div (+ .cse19 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296)) (.cse0 (not .cse14)) (.cse1 (< c_ULTIMATE.start_main_~y~0 .cse15)) (.cse16 (div (+ .cse19 c_ULTIMATE.start_main_~y~0) 4294967296))) (let ((.cse11 (+ .cse18 (* 4294967296 .cse16))) (.cse13 (and .cse0 .cse1)) (.cse12 (<= .cse15 c_ULTIMATE.start_main_~y~0)) (.cse2 (+ (* 4294967296 .cse17) .cse18 2))) (let ((.cse8 (or .cse12 .cse14 (< .cse2 c_ULTIMATE.start_main_~y~0))) (.cse9 (or (< .cse11 c_ULTIMATE.start_main_~y~0) .cse13)) (.cse4 (or .cse12 .cse14)) (.cse3 (+ .cse17 1)) (.cse10 (+ .cse16 1))) (and (not (= 0 (mod c_ULTIMATE.start_main_~y~0 2))) (or (and .cse0 .cse1 (<= c_ULTIMATE.start_main_~y~0 .cse2)) (and .cse0 .cse1 (<= .cse3 0)) (and (let ((.cse5 (* 2 c_ULTIMATE.start_main_~y~0)) (.cse6 (* 4 .cse7))) (or (and .cse4 (<= (+ (* 2 (div (+ c_ULTIMATE.start_main_~x~0 2) 2)) .cse5) (+ .cse6 c_ULTIMATE.start_main_~x~0 3))) (and .cse0 .cse1 (<= (+ (* 2 (div (+ c_ULTIMATE.start_main_~x~0 4) 2)) .cse5) (+ .cse6 c_ULTIMATE.start_main_~x~0 7))))) .cse8 .cse9) (and .cse4 (<= .cse10 0)) (and (<= c_ULTIMATE.start_main_~y~0 .cse11) .cse4)) .cse8 (or .cse12 .cse13 .cse14) (< .cse15 (+ c_ULTIMATE.start_main_~y~0 1)) (or .cse12 (not (= .cse2 c_ULTIMATE.start_main_~y~0)) .cse14) .cse9 (= (+ c_ULTIMATE.start_main_~x~0 1) 0) (or (and (<= 0 .cse16) .cse4) (and .cse0 .cse1 (<= 0 .cse17)) (and (or (< 0 .cse3) .cse12 .cse14) (or .cse13 (< 0 .cse10)))) (or (not (= .cse11 c_ULTIMATE.start_main_~y~0)) .cse13)))))))) is different from false [2019-11-20 00:58:09,655 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse12 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse0 (* 2 .cse12)) (.cse23 (* .cse12 (- 2)))) (let ((.cse16 (div (+ .cse23 c_ULTIMATE.start_main_~y~0) 4294967296)) (.cse7 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse19 (= .cse0 c_ULTIMATE.start_main_~y~0)) (.cse17 (div (+ .cse23 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296))) (let ((.cse3 (* 4294967296 .cse17)) (.cse4 (not .cse19)) (.cse5 (< c_ULTIMATE.start_main_~y~0 .cse7)) (.cse1 (* 4294967296 .cse16))) (let ((.cse21 (+ .cse0 .cse1)) (.cse20 (and .cse4 .cse5)) (.cse18 (<= .cse7 c_ULTIMATE.start_main_~y~0)) (.cse22 (+ .cse3 .cse0 2))) (let ((.cse6 (or .cse18 .cse19 (< .cse22 c_ULTIMATE.start_main_~y~0))) (.cse8 (or .cse18 (not (= .cse22 c_ULTIMATE.start_main_~y~0)) .cse19)) (.cse9 (or (< .cse21 c_ULTIMATE.start_main_~y~0) .cse20)) (.cse2 (or .cse18 .cse19)) (.cse14 (+ .cse17 1)) (.cse15 (+ .cse16 1)) (.cse13 (or (not (= .cse21 c_ULTIMATE.start_main_~y~0)) .cse20))) (and (not (= 0 (mod c_ULTIMATE.start_main_~y~0 2))) (or (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse0 .cse1 4294967295)) .cse2) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse3 .cse0 4294967297)) .cse4 .cse5)) .cse6 (< .cse7 (+ c_ULTIMATE.start_main_~y~0 1)) .cse8 .cse9 (or (and .cse6 (let ((.cse10 (+ (* 2 (div (+ c_ULTIMATE.start_main_~x~0 2) 2)) (* 2 c_ULTIMATE.start_main_~y~0))) (.cse11 (* 4 .cse12))) (or (and .cse2 (<= .cse10 (+ .cse11 c_ULTIMATE.start_main_~x~0 3))) (and (<= .cse10 (+ .cse11 c_ULTIMATE.start_main_~x~0 7)) .cse4 .cse5))) .cse8 .cse9 .cse13) (and .cse4 .cse5 (<= .cse14 0)) (and .cse2 (<= .cse15 0))) (= (+ c_ULTIMATE.start_main_~x~0 1) 0) (or (and (<= 0 .cse16) .cse2) (and .cse4 .cse5 (<= 0 .cse17)) (and (or (< 0 .cse14) .cse18 .cse19) (or .cse20 (< 0 .cse15)))) .cse13))))))) is different from false [2019-11-20 00:58:11,667 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse12 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse0 (* 2 .cse12)) (.cse23 (* .cse12 (- 2)))) (let ((.cse16 (div (+ .cse23 c_ULTIMATE.start_main_~y~0) 4294967296)) (.cse7 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse19 (= .cse0 c_ULTIMATE.start_main_~y~0)) (.cse17 (div (+ .cse23 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296))) (let ((.cse3 (* 4294967296 .cse17)) (.cse4 (not .cse19)) (.cse5 (< c_ULTIMATE.start_main_~y~0 .cse7)) (.cse1 (* 4294967296 .cse16))) (let ((.cse21 (+ .cse0 .cse1)) (.cse20 (and .cse4 .cse5)) (.cse18 (<= .cse7 c_ULTIMATE.start_main_~y~0)) (.cse22 (+ .cse3 .cse0 2))) (let ((.cse6 (or .cse18 .cse19 (< .cse22 c_ULTIMATE.start_main_~y~0))) (.cse8 (or .cse18 (not (= .cse22 c_ULTIMATE.start_main_~y~0)) .cse19)) (.cse9 (or (< .cse21 c_ULTIMATE.start_main_~y~0) .cse20)) (.cse2 (or .cse18 .cse19)) (.cse14 (+ .cse17 1)) (.cse15 (+ .cse16 1)) (.cse13 (or (not (= .cse21 c_ULTIMATE.start_main_~y~0)) .cse20))) (and (not (= 0 (mod c_ULTIMATE.start_main_~y~0 2))) (or (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse0 .cse1 4294967295)) .cse2) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse3 .cse0 4294967297)) .cse4 .cse5)) .cse6 (< .cse7 (+ c_ULTIMATE.start_main_~y~0 1)) .cse8 .cse9 (or (and .cse6 (let ((.cse10 (+ (* 2 (div (+ c_ULTIMATE.start_main_~x~0 2) 2)) (* 2 c_ULTIMATE.start_main_~y~0))) (.cse11 (* 4 .cse12))) (or (and .cse2 (<= .cse10 (+ .cse11 c_ULTIMATE.start_main_~x~0 3))) (and (<= .cse10 (+ .cse11 c_ULTIMATE.start_main_~x~0 7)) .cse4 .cse5))) .cse8 .cse9 .cse13) (and .cse4 .cse5 (<= .cse14 0)) (and .cse2 (<= .cse15 0))) (= (+ c_ULTIMATE.start_main_~x~0 1) 0) (or (and (<= 0 .cse16) .cse2) (and .cse4 .cse5 (<= 0 .cse17)) (and (or (< 0 .cse14) .cse18 .cse19) (or .cse20 (< 0 .cse15)))) .cse13))))))) is different from true [2019-11-20 00:58:13,683 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse11 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse0 (* 2 .cse11)) (.cse23 (* .cse11 (- 2)))) (let ((.cse15 (div (+ .cse23 c_ULTIMATE.start_main_~y~0) 4294967296)) (.cse22 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse18 (= .cse0 c_ULTIMATE.start_main_~y~0)) (.cse16 (div (+ .cse23 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296))) (let ((.cse3 (* 4294967296 .cse16)) (.cse4 (not .cse18)) (.cse5 (< c_ULTIMATE.start_main_~y~0 .cse22)) (.cse1 (* 4294967296 .cse15))) (let ((.cse20 (+ .cse0 .cse1)) (.cse19 (and .cse4 .cse5)) (.cse17 (<= .cse22 c_ULTIMATE.start_main_~y~0)) (.cse21 (+ .cse3 .cse0 2))) (let ((.cse6 (or .cse17 .cse18 (< .cse21 c_ULTIMATE.start_main_~y~0))) (.cse7 (or .cse17 (not (= .cse21 c_ULTIMATE.start_main_~y~0)) .cse18)) (.cse8 (or (< .cse20 c_ULTIMATE.start_main_~y~0) .cse19)) (.cse2 (or .cse17 .cse18)) (.cse13 (+ .cse16 1)) (.cse14 (+ .cse15 1)) (.cse12 (or (not (= .cse20 c_ULTIMATE.start_main_~y~0)) .cse19))) (and (not (= 0 (mod c_ULTIMATE.start_main_~y~0 2))) (or (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse0 .cse1 4294967295)) .cse2) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse3 .cse0 4294967297)) .cse4 .cse5)) .cse6 .cse7 .cse8 (= c_ULTIMATE.start_main_~x~0 1) (or (and (let ((.cse9 (+ (* 2 (div c_ULTIMATE.start_main_~x~0 2)) (* 2 c_ULTIMATE.start_main_~y~0))) (.cse10 (* 4 .cse11))) (or (and .cse4 .cse5 (<= .cse9 (+ .cse10 c_ULTIMATE.start_main_~x~0 5))) (and (<= .cse9 (+ .cse10 c_ULTIMATE.start_main_~x~0 1)) .cse2))) .cse6 .cse7 .cse8 .cse12) (and .cse4 .cse5 (<= .cse13 0)) (and .cse2 (<= .cse14 0))) (or (and (<= 0 .cse15) .cse2) (and .cse4 .cse5 (<= 0 .cse16)) (and (or (< 0 .cse13) .cse17 .cse18) (or .cse19 (< 0 .cse14)))) .cse12))))))) is different from false [2019-11-20 00:58:15,693 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse11 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse0 (* 2 .cse11)) (.cse23 (* .cse11 (- 2)))) (let ((.cse15 (div (+ .cse23 c_ULTIMATE.start_main_~y~0) 4294967296)) (.cse22 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse18 (= .cse0 c_ULTIMATE.start_main_~y~0)) (.cse16 (div (+ .cse23 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296))) (let ((.cse3 (* 4294967296 .cse16)) (.cse4 (not .cse18)) (.cse5 (< c_ULTIMATE.start_main_~y~0 .cse22)) (.cse1 (* 4294967296 .cse15))) (let ((.cse20 (+ .cse0 .cse1)) (.cse19 (and .cse4 .cse5)) (.cse17 (<= .cse22 c_ULTIMATE.start_main_~y~0)) (.cse21 (+ .cse3 .cse0 2))) (let ((.cse6 (or .cse17 .cse18 (< .cse21 c_ULTIMATE.start_main_~y~0))) (.cse7 (or .cse17 (not (= .cse21 c_ULTIMATE.start_main_~y~0)) .cse18)) (.cse8 (or (< .cse20 c_ULTIMATE.start_main_~y~0) .cse19)) (.cse2 (or .cse17 .cse18)) (.cse13 (+ .cse16 1)) (.cse14 (+ .cse15 1)) (.cse12 (or (not (= .cse20 c_ULTIMATE.start_main_~y~0)) .cse19))) (and (not (= 0 (mod c_ULTIMATE.start_main_~y~0 2))) (or (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse0 .cse1 4294967295)) .cse2) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse3 .cse0 4294967297)) .cse4 .cse5)) .cse6 .cse7 .cse8 (= c_ULTIMATE.start_main_~x~0 1) (or (and (let ((.cse9 (+ (* 2 (div c_ULTIMATE.start_main_~x~0 2)) (* 2 c_ULTIMATE.start_main_~y~0))) (.cse10 (* 4 .cse11))) (or (and .cse4 .cse5 (<= .cse9 (+ .cse10 c_ULTIMATE.start_main_~x~0 5))) (and (<= .cse9 (+ .cse10 c_ULTIMATE.start_main_~x~0 1)) .cse2))) .cse6 .cse7 .cse8 .cse12) (and .cse4 .cse5 (<= .cse13 0)) (and .cse2 (<= .cse14 0))) (or (and (<= 0 .cse15) .cse2) (and .cse4 .cse5 (<= 0 .cse16)) (and (or (< 0 .cse13) .cse17 .cse18) (or .cse19 (< 0 .cse14)))) .cse12))))))) is different from true [2019-11-20 00:58:17,763 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse0 (* 2 .cse9))) (let ((.cse18 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse16 (= .cse0 c_ULTIMATE.start_main_~y~0)) (.cse19 (* .cse9 (- 2)))) (let ((.cse14 (div (+ .cse19 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296)) (.cse4 (not .cse16)) (.cse5 (< c_ULTIMATE.start_main_~y~0 .cse18)) (.cse13 (div (+ .cse19 c_ULTIMATE.start_main_~y~0) 4294967296))) (let ((.cse1 (* 4294967296 .cse13)) (.cse17 (and .cse4 .cse5)) (.cse15 (<= .cse18 c_ULTIMATE.start_main_~y~0)) (.cse3 (* 4294967296 .cse14))) (let ((.cse6 (or .cse15 .cse16 (< (+ .cse3 .cse0 2) c_ULTIMATE.start_main_~y~0))) (.cse10 (or (< (+ .cse0 .cse1) c_ULTIMATE.start_main_~y~0) .cse17)) (.cse2 (or .cse15 .cse16)) (.cse11 (+ .cse14 1)) (.cse12 (+ .cse13 1))) (and (not (= 0 (mod c_ULTIMATE.start_main_~y~0 2))) (or (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse0 .cse1 4294967295)) .cse2) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse3 .cse0 4294967297)) .cse4 .cse5)) .cse6 (or (and .cse6 (let ((.cse7 (+ (* 2 (div (+ c_ULTIMATE.start_main_~x~0 2) 2)) (* 2 c_ULTIMATE.start_main_~y~0))) (.cse8 (* 4 .cse9))) (or (and .cse2 (<= .cse7 (+ .cse8 c_ULTIMATE.start_main_~x~0 3))) (and (<= .cse7 (+ .cse8 c_ULTIMATE.start_main_~x~0 7)) .cse4 .cse5))) .cse10) (and .cse4 .cse5 (<= .cse11 0)) (and .cse2 (<= .cse12 0))) .cse10 (= (+ c_ULTIMATE.start_main_~x~0 1) 0) (or (and (<= 0 .cse13) .cse2) (and .cse4 .cse5 (<= 0 .cse14)) (and (or (< 0 .cse11) .cse15 .cse16) (or .cse17 (< 0 .cse12))))))))))) is different from false [2019-11-20 00:58:19,773 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse9 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse0 (* 2 .cse9))) (let ((.cse18 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse16 (= .cse0 c_ULTIMATE.start_main_~y~0)) (.cse19 (* .cse9 (- 2)))) (let ((.cse14 (div (+ .cse19 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296)) (.cse4 (not .cse16)) (.cse5 (< c_ULTIMATE.start_main_~y~0 .cse18)) (.cse13 (div (+ .cse19 c_ULTIMATE.start_main_~y~0) 4294967296))) (let ((.cse1 (* 4294967296 .cse13)) (.cse17 (and .cse4 .cse5)) (.cse15 (<= .cse18 c_ULTIMATE.start_main_~y~0)) (.cse3 (* 4294967296 .cse14))) (let ((.cse6 (or .cse15 .cse16 (< (+ .cse3 .cse0 2) c_ULTIMATE.start_main_~y~0))) (.cse10 (or (< (+ .cse0 .cse1) c_ULTIMATE.start_main_~y~0) .cse17)) (.cse2 (or .cse15 .cse16)) (.cse11 (+ .cse14 1)) (.cse12 (+ .cse13 1))) (and (not (= 0 (mod c_ULTIMATE.start_main_~y~0 2))) (or (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse0 .cse1 4294967295)) .cse2) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse3 .cse0 4294967297)) .cse4 .cse5)) .cse6 (or (and .cse6 (let ((.cse7 (+ (* 2 (div (+ c_ULTIMATE.start_main_~x~0 2) 2)) (* 2 c_ULTIMATE.start_main_~y~0))) (.cse8 (* 4 .cse9))) (or (and .cse2 (<= .cse7 (+ .cse8 c_ULTIMATE.start_main_~x~0 3))) (and (<= .cse7 (+ .cse8 c_ULTIMATE.start_main_~x~0 7)) .cse4 .cse5))) .cse10) (and .cse4 .cse5 (<= .cse11 0)) (and .cse2 (<= .cse12 0))) .cse10 (= (+ c_ULTIMATE.start_main_~x~0 1) 0) (or (and (<= 0 .cse13) .cse2) (and .cse4 .cse5 (<= 0 .cse14)) (and (or (< 0 .cse11) .cse15 .cse16) (or .cse17 (< 0 .cse12))))))))))) is different from true [2019-11-20 00:58:21,819 WARN L838 $PredicateComparison]: unable to prove that (and (not (= 0 (mod c_ULTIMATE.start_main_~y~0 2))) (let ((.cse35 (div c_ULTIMATE.start_main_~y~0 2))) (let ((.cse24 (* 2 .cse35))) (let ((.cse39 (div c_ULTIMATE.start_main_~x~0 2)) (.cse37 (* 4294967296 (div c_ULTIMATE.start_main_~y~0 4294967296))) (.cse19 (= .cse24 c_ULTIMATE.start_main_~y~0)) (.cse40 (* .cse35 (- 2)))) (let ((.cse17 (div (+ .cse40 c_ULTIMATE.start_main_~y~0 (- 2)) 4294967296)) (.cse2 (not .cse19)) (.cse3 (< c_ULTIMATE.start_main_~y~0 .cse37)) (.cse16 (div (+ .cse40 c_ULTIMATE.start_main_~y~0) 4294967296)) (.cse13 (* 2 .cse39)) (.cse36 (* 4294967296 (div c_ULTIMATE.start_main_~x~0 4294967296))) (.cse38 (* .cse39 (- 2)))) (let ((.cse0 (div (+ .cse38 c_ULTIMATE.start_main_~x~0) 4294967296)) (.cse21 (div (+ .cse38 c_ULTIMATE.start_main_~x~0 (- 2)) 4294967296)) (.cse22 (<= .cse36 c_ULTIMATE.start_main_~x~0)) (.cse23 (= c_ULTIMATE.start_main_~x~0 .cse13)) (.cse25 (* 4294967296 .cse16)) (.cse20 (and .cse2 .cse3)) (.cse26 (* 4294967296 .cse17)) (.cse18 (<= .cse37 c_ULTIMATE.start_main_~y~0))) (let ((.cse6 (* 8589934592 .cse16)) (.cse5 (or .cse18 .cse19)) (.cse11 (* 8589934592 .cse17)) (.cse27 (or .cse18 .cse19 (< (+ .cse26 .cse24 2) c_ULTIMATE.start_main_~y~0))) (.cse28 (or (< (+ .cse24 .cse25) c_ULTIMATE.start_main_~y~0) .cse20)) (.cse1 (or .cse22 .cse23)) (.cse14 (* 4294967296 .cse21)) (.cse15 (* 4294967296 .cse0)) (.cse9 (< c_ULTIMATE.start_main_~x~0 .cse36)) (.cse10 (not .cse23))) (or (and (<= (+ .cse0 1) 0) .cse1) (and (or (let ((.cse4 (+ .cse17 1)) (.cse12 (+ .cse16 1))) (and (let ((.cse7 (+ .cse13 .cse15)) (.cse8 (+ .cse13 .cse14 3))) (or (and .cse2 .cse3 (<= .cse4 0)) (and .cse5 (or (and .cse1 (<= (+ c_ULTIMATE.start_main_~x~0 .cse6 1) .cse7)) (and (<= (+ c_ULTIMATE.start_main_~x~0 .cse6) .cse8) .cse9 .cse10))) (and .cse2 .cse3 (or (and (<= (+ .cse11 c_ULTIMATE.start_main_~x~0 1) .cse7) .cse1) (and (<= (+ .cse11 c_ULTIMATE.start_main_~x~0) .cse8) .cse9 .cse10))) (and .cse5 (<= .cse12 0)))) (or (and (<= 0 .cse16) .cse5) (and .cse2 .cse3 (<= 0 .cse17)) (and (or (< 0 .cse4) .cse18 .cse19) (or .cse20 (< 0 .cse12)))))) (and (or (< 0 .cse21) .cse22 .cse23) (or (and .cse9 .cse10) (< 0 .cse0)))) (or (and (or (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse24 .cse25 4294967295)) .cse5) (and (<= c_ULTIMATE.start_main_~y~0 (+ .cse26 .cse24 4294967297)) .cse2 .cse3)) .cse27 .cse28) (and (<= .cse21 0) .cse9 .cse10) (and .cse1 (<= .cse0 0)))) (and .cse27 .cse28 (let ((.cse29 (+ .cse24 c_ULTIMATE.start_main_~x~0 .cse25)) (.cse30 (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse15)) (.cse34 (+ .cse26 .cse24 c_ULTIMATE.start_main_~x~0))) (or (and (or (and .cse1 (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse15 1) .cse29)) (and (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse14 3) .cse29) .cse9 .cse10)) .cse5) (and (let ((.cse33 (* 2 c_ULTIMATE.start_main_~y~0))) (let ((.cse31 (+ .cse13 .cse33 .cse15)) (.cse32 (* 4 .cse35))) (or (and (or (and .cse9 (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse14 2) .cse29) .cse10) (and .cse1 (<= .cse30 .cse29))) .cse5) (and (or (and (<= .cse31 (+ .cse32 c_ULTIMATE.start_main_~x~0 .cse6 1)) .cse1) (and (<= (+ .cse13 .cse33 .cse14 3) (+ .cse32 c_ULTIMATE.start_main_~x~0 .cse6)) .cse9 .cse10)) .cse5) (and .cse2 .cse3 (or (and (<= (+ .cse13 .cse33 .cse14) (+ .cse11 .cse32 c_ULTIMATE.start_main_~x~0 1)) .cse9 .cse10) (and .cse1 (<= .cse31 (+ .cse11 .cse32 c_ULTIMATE.start_main_~x~0 5))))) (and .cse2 .cse3 (or (and .cse9 (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse14) .cse34) .cse10) (and .cse1 (<= .cse30 (+ .cse26 .cse24 c_ULTIMATE.start_main_~x~0 2)))))))) .cse27 .cse28) (and .cse2 .cse3 (or (and (<= .cse30 (+ .cse26 .cse24 c_ULTIMATE.start_main_~x~0 1)) .cse1) (and (<= (+ .cse13 c_ULTIMATE.start_main_~y~0 .cse14 1) .cse34) .cse9 .cse10)))))) (and .cse9 (<= (+ .cse21 1) 0) .cse10)))))))) (= (+ c_ULTIMATE.start_main_~x~0 5) 0)) is different from false [2019-11-20 00:58:30,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:58:30,009 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2019-11-20 00:58:30,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 00:58:30,010 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 16 [2019-11-20 00:58:30,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:58:30,010 INFO L225 Difference]: With dead ends: 53 [2019-11-20 00:58:30,011 INFO L226 Difference]: Without dead ends: 49 [2019-11-20 00:58:30,011 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 60.9s TimeCoverageRelationStatistics Valid=60, Invalid=127, Unknown=21, NotChecked=442, Total=650 [2019-11-20 00:58:30,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-20 00:58:30,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-11-20 00:58:30,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-20 00:58:30,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2019-11-20 00:58:30,019 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 16 [2019-11-20 00:58:30,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:58:30,019 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2019-11-20 00:58:30,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-20 00:58:30,020 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2019-11-20 00:58:30,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 00:58:30,021 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:58:30,021 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-20 00:58:30,222 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:58:30,222 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:58:30,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:58:30,223 INFO L82 PathProgramCache]: Analyzing trace with hash 489860484, now seen corresponding path program 2 times [2019-11-20 00:58:30,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:58:30,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016528561] [2019-11-20 00:58:30,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:58:30,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:58:30,678 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:58:30,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016528561] [2019-11-20 00:58:30,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019763838] [2019-11-20 00:58:30,679 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ace554d-579d-4704-8e19-c61918849f2f/bin/uautomizer/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 [2019-11-20 00:58:30,719 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 00:58:30,719 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:58:30,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 43 conjunts are in the unsatisfiable core [2019-11-20 00:58:30,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:58:30,768 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:58:30,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:58:30,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-11-20 00:58:30,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827863540] [2019-11-20 00:58:30,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-20 00:58:30,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:58:30,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-20 00:58:30,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-11-20 00:58:30,770 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 24 states. [2019-11-20 00:58:31,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:58:31,220 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2019-11-20 00:58:31,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-20 00:58:31,221 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 27 [2019-11-20 00:58:31,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:58:31,222 INFO L225 Difference]: With dead ends: 65 [2019-11-20 00:58:31,222 INFO L226 Difference]: Without dead ends: 61 [2019-11-20 00:58:31,222 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-11-20 00:58:31,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-20 00:58:31,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-11-20 00:58:31,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-20 00:58:31,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-11-20 00:58:31,228 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 27 [2019-11-20 00:58:31,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:58:31,229 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-11-20 00:58:31,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-20 00:58:31,229 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-11-20 00:58:31,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 00:58:31,230 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:58:31,233 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-20 00:58:31,433 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:58:31,434 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:58:31,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:58:31,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1485399428, now seen corresponding path program 2 times [2019-11-20 00:58:31,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:58:31,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433859032] [2019-11-20 00:58:31,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:58:31,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:58:31,562 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:58:31,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433859032] [2019-11-20 00:58:31,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878526794] [2019-11-20 00:58:31,563 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ace554d-579d-4704-8e19-c61918849f2f/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:58:31,602 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 00:58:31,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:58:31,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-20 00:58:31,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:58:31,635 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:58:31,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:58:31,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-20 00:58:31,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237518620] [2019-11-20 00:58:31,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 00:58:31,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:58:31,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 00:58:31,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-20 00:58:31,637 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 9 states. [2019-11-20 00:58:31,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:58:31,756 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2019-11-20 00:58:31,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 00:58:31,757 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2019-11-20 00:58:31,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:58:31,757 INFO L225 Difference]: With dead ends: 64 [2019-11-20 00:58:31,757 INFO L226 Difference]: Without dead ends: 39 [2019-11-20 00:58:31,758 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-20 00:58:31,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-20 00:58:31,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-11-20 00:58:31,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-20 00:58:31,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-11-20 00:58:31,761 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 27 [2019-11-20 00:58:31,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:58:31,761 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-11-20 00:58:31,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 00:58:31,762 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-11-20 00:58:31,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-20 00:58:31,762 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:58:31,763 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2019-11-20 00:58:31,970 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:58:31,970 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:58:31,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:58:31,970 INFO L82 PathProgramCache]: Analyzing trace with hash 902325004, now seen corresponding path program 3 times [2019-11-20 00:58:31,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:58:31,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142491493] [2019-11-20 00:58:31,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:58:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:58:32,735 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:58:32,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142491493] [2019-11-20 00:58:32,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450637066] [2019-11-20 00:58:32,735 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ace554d-579d-4704-8e19-c61918849f2f/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:58:32,776 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-20 00:58:32,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:58:32,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 63 conjunts are in the unsatisfiable core [2019-11-20 00:58:32,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:58:32,841 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:58:32,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:58:32,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-11-20 00:58:32,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247381941] [2019-11-20 00:58:32,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-20 00:58:32,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:58:32,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-20 00:58:32,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2019-11-20 00:58:32,843 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 34 states. [2019-11-20 00:58:33,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:58:33,585 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-11-20 00:58:33,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-20 00:58:33,586 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 38 [2019-11-20 00:58:33,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:58:33,587 INFO L225 Difference]: With dead ends: 55 [2019-11-20 00:58:33,587 INFO L226 Difference]: Without dead ends: 51 [2019-11-20 00:58:33,588 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2019-11-20 00:58:33,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-20 00:58:33,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-11-20 00:58:33,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-20 00:58:33,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-11-20 00:58:33,592 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 38 [2019-11-20 00:58:33,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:58:33,592 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-11-20 00:58:33,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-20 00:58:33,593 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-11-20 00:58:33,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-20 00:58:33,594 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:58:33,594 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2019-11-20 00:58:33,801 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:58:33,802 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:58:33,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:58:33,802 INFO L82 PathProgramCache]: Analyzing trace with hash 241133700, now seen corresponding path program 4 times [2019-11-20 00:58:33,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:58:33,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411163670] [2019-11-20 00:58:33,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:58:33,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:58:34,894 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:58:34,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411163670] [2019-11-20 00:58:34,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969875270] [2019-11-20 00:58:34,894 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ace554d-579d-4704-8e19-c61918849f2f/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:58:34,940 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-20 00:58:34,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 00:58:34,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 83 conjunts are in the unsatisfiable core [2019-11-20 00:58:34,945 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:58:35,061 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:58:35,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 00:58:35,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2019-11-20 00:58:35,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712996168] [2019-11-20 00:58:35,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-11-20 00:58:35,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:58:35,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-11-20 00:58:35,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2019-11-20 00:58:35,064 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 44 states. [2019-11-20 00:58:36,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:58:36,389 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-11-20 00:58:36,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-11-20 00:58:36,391 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 49 [2019-11-20 00:58:36,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:58:36,392 INFO L225 Difference]: With dead ends: 66 [2019-11-20 00:58:36,392 INFO L226 Difference]: Without dead ends: 62 [2019-11-20 00:58:36,393 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2019-11-20 00:58:36,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-20 00:58:36,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-11-20 00:58:36,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-20 00:58:36,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-11-20 00:58:36,403 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 49 [2019-11-20 00:58:36,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:58:36,404 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-11-20 00:58:36,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-11-20 00:58:36,404 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-11-20 00:58:36,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-20 00:58:36,407 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:58:36,408 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1] [2019-11-20 00:58:36,611 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:58:36,611 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:58:36,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:58:36,611 INFO L82 PathProgramCache]: Analyzing trace with hash -722941940, now seen corresponding path program 5 times [2019-11-20 00:58:36,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:58:36,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824632032] [2019-11-20 00:58:36,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:58:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:58:38,852 WARN L191 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 38 DAG size of output: 18 [2019-11-20 00:58:40,898 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 40 DAG size of output: 19 [2019-11-20 00:58:42,983 WARN L191 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-20 00:58:47,056 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-20 00:58:49,107 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-20 00:58:53,198 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-20 00:58:59,273 WARN L191 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-20 00:59:01,348 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-20 00:59:03,408 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-20 00:59:07,485 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-20 00:59:09,552 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-20 00:59:11,693 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-20 00:59:13,784 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-20 00:59:15,861 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-20 00:59:21,973 WARN L191 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-20 00:59:28,113 WARN L191 SmtUtils]: Spent 6.07 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-20 00:59:30,195 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-20 00:59:32,321 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-20 00:59:38,426 WARN L191 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-20 00:59:40,515 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-20 00:59:42,709 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-20 00:59:44,807 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-20 00:59:46,909 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-20 00:59:49,014 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-20 00:59:51,121 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-20 00:59:53,290 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-20 00:59:55,511 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-20 00:59:57,632 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-20 00:59:59,882 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-20 01:00:02,006 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-20 01:00:04,133 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-20 01:00:08,270 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-20 01:00:10,401 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-20 01:00:16,548 WARN L191 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-20 01:00:22,837 WARN L191 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-20 01:00:24,977 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-20 01:00:29,125 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-20 01:00:31,268 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-20 01:00:33,415 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-20 01:00:35,566 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-20 01:00:37,864 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-20 01:00:40,024 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2019-11-20 01:01:02,737 WARN L191 SmtUtils]: Spent 8.18 s on a formula simplification. DAG size of input: 121 DAG size of output: 27 [2019-11-20 01:01:15,163 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:01:15,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824632032] [2019-11-20 01:01:15,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16315451] [2019-11-20 01:01:15,163 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ace554d-579d-4704-8e19-c61918849f2f/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:01:15,218 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-20 01:01:15,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:01:15,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 109 conjunts are in the unsatisfiable core [2019-11-20 01:01:15,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:01:15,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 01:01:15,890 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:01:15,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:01:15,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 58 [2019-11-20 01:01:15,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677019687] [2019-11-20 01:01:15,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-11-20 01:01:15,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:01:15,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-11-20 01:01:15,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=3295, Unknown=7, NotChecked=0, Total=3422 [2019-11-20 01:01:15,892 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 59 states. [2019-11-20 01:01:17,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:01:17,818 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2019-11-20 01:01:17,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-11-20 01:01:17,818 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 60 [2019-11-20 01:01:17,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 01:01:17,819 INFO L225 Difference]: With dead ends: 74 [2019-11-20 01:01:17,819 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 01:01:17,820 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 158.8s TimeCoverageRelationStatistics Valid=126, Invalid=3407, Unknown=7, NotChecked=0, Total=3540 [2019-11-20 01:01:17,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 01:01:17,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 01:01:17,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 01:01:17,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 01:01:17,821 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2019-11-20 01:01:17,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 01:01:17,821 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 01:01:17,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-11-20 01:01:17,821 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 01:01:17,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 01:01:18,021 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:01:18,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 01:01:22,264 WARN L191 SmtUtils]: Spent 4.19 s on a formula simplification. DAG size of input: 220 DAG size of output: 48 [2019-11-20 01:01:22,266 INFO L444 ceAbstractionStarter]: For program point L31-1(lines 15 45) no Hoare annotation was computed. [2019-11-20 01:01:22,266 INFO L444 ceAbstractionStarter]: For program point L19-1(lines 15 45) no Hoare annotation was computed. [2019-11-20 01:01:22,266 INFO L444 ceAbstractionStarter]: For program point L15-2(lines 15 45) no Hoare annotation was computed. [2019-11-20 01:01:22,266 INFO L444 ceAbstractionStarter]: For program point L40-1(lines 15 45) no Hoare annotation was computed. [2019-11-20 01:01:22,266 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 01:01:22,267 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 01:01:22,267 INFO L444 ceAbstractionStarter]: For program point L28-1(lines 15 45) no Hoare annotation was computed. [2019-11-20 01:01:22,267 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2019-11-20 01:01:22,267 INFO L444 ceAbstractionStarter]: For program point L16(lines 16 17) no Hoare annotation was computed. [2019-11-20 01:01:22,267 INFO L444 ceAbstractionStarter]: For program point L16-2(lines 15 45) no Hoare annotation was computed. [2019-11-20 01:01:22,267 INFO L444 ceAbstractionStarter]: For program point L37-1(lines 15 45) no Hoare annotation was computed. [2019-11-20 01:01:22,267 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 01:01:22,267 INFO L444 ceAbstractionStarter]: For program point L25-1(lines 15 45) no Hoare annotation was computed. [2019-11-20 01:01:22,267 INFO L444 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2019-11-20 01:01:22,267 INFO L447 ceAbstractionStarter]: At program point L5-2(lines 1 48) the Hoare annotation is: true [2019-11-20 01:01:22,267 INFO L444 ceAbstractionStarter]: For program point L34-1(lines 15 45) no Hoare annotation was computed. [2019-11-20 01:01:22,267 INFO L444 ceAbstractionStarter]: For program point L22-1(lines 15 45) no Hoare annotation was computed. [2019-11-20 01:01:22,267 INFO L440 ceAbstractionStarter]: At program point L43-1(lines 15 45) the Hoare annotation is: (let ((.cse5 (div ULTIMATE.start_main_~y~0 2))) (let ((.cse3 (* 2 .cse5)) (.cse4 (* 4294967296 (div (+ (* .cse5 (- 2)) ULTIMATE.start_main_~y~0) 4294967296)))) (let ((.cse2 (+ .cse3 .cse4))) (let ((.cse1 (+ .cse3 ULTIMATE.start_main_~x~0 .cse4)) (.cse0 (<= ULTIMATE.start_main_~y~0 .cse2))) (or (and (<= 40 ULTIMATE.start_main_~x~0) .cse0 (<= ULTIMATE.start_main_~x~0 40)) (and (<= .cse1 (+ ULTIMATE.start_main_~y~0 100)) .cse0 (<= 100 ULTIMATE.start_main_~x~0)) (and (<= .cse1 (+ ULTIMATE.start_main_~y~0 20)) .cse0 (<= 20 ULTIMATE.start_main_~x~0)) (and .cse0 (<= .cse1 (+ ULTIMATE.start_main_~y~0 80)) (<= 80 ULTIMATE.start_main_~x~0)) (and .cse0 (<= ULTIMATE.start_main_~x~0 60) (<= 60 ULTIMATE.start_main_~x~0)) (and (<= ULTIMATE.start_main_~x~0 0) (<= 0 ULTIMATE.start_main_~x~0)) (and (not (= .cse2 ULTIMATE.start_main_~y~0)) (= (+ ULTIMATE.start_main_~x~0 5) 0))))))) [2019-11-20 01:01:22,268 INFO L444 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2019-11-20 01:01:22,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 01:01:22 BoogieIcfgContainer [2019-11-20 01:01:22,284 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 01:01:22,285 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 01:01:22,285 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 01:01:22,285 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 01:01:22,286 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:57:24" (3/4) ... [2019-11-20 01:01:22,288 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 01:01:22,296 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-20 01:01:22,297 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 01:01:22,337 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_1ace554d-579d-4704-8e19-c61918849f2f/bin/uautomizer/witness.graphml [2019-11-20 01:01:22,337 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 01:01:22,339 INFO L168 Benchmark]: Toolchain (without parser) took 238434.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 948.7 MB in the beginning and 869.6 MB in the end (delta: 79.2 MB). Peak memory consumption was 228.6 MB. Max. memory is 11.5 GB. [2019-11-20 01:01:22,339 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:01:22,339 INFO L168 Benchmark]: CACSL2BoogieTranslator took 330.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -160.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-11-20 01:01:22,340 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.56 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:01:22,340 INFO L168 Benchmark]: Boogie Preprocessor took 30.62 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:01:22,341 INFO L168 Benchmark]: RCFGBuilder took 317.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-20 01:01:22,341 INFO L168 Benchmark]: TraceAbstraction took 237657.30 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 35.1 MB). Free memory was 1.1 GB in the beginning and 878.5 MB in the end (delta: 208.2 MB). Peak memory consumption was 243.3 MB. Max. memory is 11.5 GB. [2019-11-20 01:01:22,342 INFO L168 Benchmark]: Witness Printer took 52.72 ms. Allocated memory is still 1.2 GB. Free memory was 878.5 MB in the beginning and 869.6 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. [2019-11-20 01:01:22,344 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 330.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 948.7 MB in the beginning and 1.1 GB in the end (delta: -160.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.56 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.62 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 317.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 237657.30 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 35.1 MB). Free memory was 1.1 GB in the beginning and 878.5 MB in the end (delta: 208.2 MB). Peak memory consumption was 243.3 MB. Max. memory is 11.5 GB. * Witness Printer took 52.72 ms. Allocated memory is still 1.2 GB. Free memory was 878.5 MB in the beginning and 869.6 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: (((((((40 <= x && y <= 2 * (y / 2) + 4294967296 * ((y / 2 * -2 + y) / 4294967296)) && x <= 40) || ((2 * (y / 2) + x + 4294967296 * ((y / 2 * -2 + y) / 4294967296) <= y + 100 && y <= 2 * (y / 2) + 4294967296 * ((y / 2 * -2 + y) / 4294967296)) && 100 <= x)) || ((2 * (y / 2) + x + 4294967296 * ((y / 2 * -2 + y) / 4294967296) <= y + 20 && y <= 2 * (y / 2) + 4294967296 * ((y / 2 * -2 + y) / 4294967296)) && 20 <= x)) || ((y <= 2 * (y / 2) + 4294967296 * ((y / 2 * -2 + y) / 4294967296) && 2 * (y / 2) + x + 4294967296 * ((y / 2 * -2 + y) / 4294967296) <= y + 80) && 80 <= x)) || ((y <= 2 * (y / 2) + 4294967296 * ((y / 2 * -2 + y) / 4294967296) && x <= 60) && 60 <= x)) || (x <= 0 && 0 <= x)) || (!(2 * (y / 2) + 4294967296 * ((y / 2 * -2 + y) / 4294967296) == y) && x + 5 == 0) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. Result: SAFE, OverallTime: 237.5s, OverallIterations: 11, TraceHistogramMax: 5, AutomataDifference: 31.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.2s, HoareTripleCheckerStatistics: 157 SDtfs, 47 SDslu, 243 SDs, 0 SdLazy, 7600 SolverSat, 137 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 441 GetRequests, 224 SyntacticMatches, 17 SemanticMatches, 200 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 224.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 14 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 10 NumberOfFragments, 222 HoareAnnotationTreeSize, 2 FomulaSimplifications, 73 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 1734 FormulaSimplificationTreeSizeReductionInter, 4.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 199.3s InterpolantComputationTime, 508 NumberOfCodeBlocks, 508 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 490 ConstructedInterpolants, 0 QuantifiedInterpolants, 474632 SizeOfPredicates, 13 NumberOfNonLiveVariables, 806 ConjunctsInSsa, 373 ConjunctsInUnsatCore, 18 InterpolantComputations, 4 PerfectInterpolantSequences, 26/500 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...