./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-acceleration/diamond_true-unreach-call2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_340706df-155e-4261-a9ca-cbf3509225de/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_340706df-155e-4261-a9ca-cbf3509225de/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_340706df-155e-4261-a9ca-cbf3509225de/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_340706df-155e-4261-a9ca-cbf3509225de/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-acceleration/diamond_true-unreach-call2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_340706df-155e-4261-a9ca-cbf3509225de/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_340706df-155e-4261-a9ca-cbf3509225de/bin-2019/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 3de88212c8693b9f87e164f2a8585947c848ea21 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 14:22:20,272 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 14:22:20,273 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 14:22:20,279 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 14:22:20,279 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 14:22:20,280 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 14:22:20,281 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 14:22:20,281 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 14:22:20,282 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 14:22:20,283 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 14:22:20,283 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 14:22:20,283 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 14:22:20,284 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 14:22:20,284 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 14:22:20,285 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 14:22:20,285 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 14:22:20,285 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 14:22:20,286 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 14:22:20,287 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 14:22:20,288 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 14:22:20,289 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 14:22:20,289 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 14:22:20,291 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 14:22:20,291 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 14:22:20,291 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 14:22:20,291 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 14:22:20,292 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 14:22:20,292 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 14:22:20,293 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 14:22:20,293 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 14:22:20,293 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 14:22:20,293 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 14:22:20,294 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 14:22:20,294 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 14:22:20,294 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 14:22:20,294 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 14:22:20,295 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_340706df-155e-4261-a9ca-cbf3509225de/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 14:22:20,302 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 14:22:20,302 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 14:22:20,302 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 14:22:20,302 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 14:22:20,303 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 14:22:20,303 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 14:22:20,303 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 14:22:20,303 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 14:22:20,303 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 14:22:20,303 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 14:22:20,303 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 14:22:20,303 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 14:22:20,304 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 14:22:20,304 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 14:22:20,304 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 14:22:20,304 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 14:22:20,304 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 14:22:20,304 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 14:22:20,304 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 14:22:20,304 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 14:22:20,304 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 14:22:20,304 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 14:22:20,305 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 14:22:20,305 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 14:22:20,305 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 14:22:20,305 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 14:22:20,305 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 14:22:20,305 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 14:22:20,305 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 14:22:20,305 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 14:22:20,305 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_340706df-155e-4261-a9ca-cbf3509225de/bin-2019/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 -> 3de88212c8693b9f87e164f2a8585947c848ea21 [2018-12-02 14:22:20,323 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 14:22:20,332 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 14:22:20,334 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 14:22:20,335 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 14:22:20,336 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 14:22:20,336 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_340706df-155e-4261-a9ca-cbf3509225de/bin-2019/uautomizer/../../sv-benchmarks/c/loop-acceleration/diamond_true-unreach-call2.i [2018-12-02 14:22:20,379 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_340706df-155e-4261-a9ca-cbf3509225de/bin-2019/uautomizer/data/546144396/ad20a9b2ecb647c58492b1c2db1a24c6/FLAG0efaaf201 [2018-12-02 14:22:20,669 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 14:22:20,669 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_340706df-155e-4261-a9ca-cbf3509225de/sv-benchmarks/c/loop-acceleration/diamond_true-unreach-call2.i [2018-12-02 14:22:20,673 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_340706df-155e-4261-a9ca-cbf3509225de/bin-2019/uautomizer/data/546144396/ad20a9b2ecb647c58492b1c2db1a24c6/FLAG0efaaf201 [2018-12-02 14:22:20,683 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_340706df-155e-4261-a9ca-cbf3509225de/bin-2019/uautomizer/data/546144396/ad20a9b2ecb647c58492b1c2db1a24c6 [2018-12-02 14:22:20,684 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 14:22:20,685 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 14:22:20,686 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 14:22:20,686 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 14:22:20,688 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 14:22:20,688 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:22:20" (1/1) ... [2018-12-02 14:22:20,690 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42aa496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:20, skipping insertion in model container [2018-12-02 14:22:20,690 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:22:20" (1/1) ... [2018-12-02 14:22:20,694 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 14:22:20,704 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 14:22:20,804 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:22:20,806 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 14:22:20,819 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:22:20,827 INFO L195 MainTranslator]: Completed translation [2018-12-02 14:22:20,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:20 WrapperNode [2018-12-02 14:22:20,827 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 14:22:20,827 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 14:22:20,828 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 14:22:20,828 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 14:22:20,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:20" (1/1) ... [2018-12-02 14:22:20,836 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:20" (1/1) ... [2018-12-02 14:22:20,840 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 14:22:20,840 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 14:22:20,840 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 14:22:20,840 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 14:22:20,846 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:20" (1/1) ... [2018-12-02 14:22:20,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:20" (1/1) ... [2018-12-02 14:22:20,846 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:20" (1/1) ... [2018-12-02 14:22:20,847 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:20" (1/1) ... [2018-12-02 14:22:20,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:20" (1/1) ... [2018-12-02 14:22:20,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:20" (1/1) ... [2018-12-02 14:22:20,853 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:20" (1/1) ... [2018-12-02 14:22:20,854 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 14:22:20,854 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 14:22:20,854 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 14:22:20,854 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 14:22:20,855 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_340706df-155e-4261-a9ca-cbf3509225de/bin-2019/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 [2018-12-02 14:22:20,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 14:22:20,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 14:22:20,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 14:22:20,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 14:22:20,919 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 14:22:20,919 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 14:22:20,919 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-02 14:22:20,919 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-02 14:22:21,044 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 14:22:21,045 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 14:22:21,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:22:21 BoogieIcfgContainer [2018-12-02 14:22:21,045 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 14:22:21,046 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 14:22:21,046 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 14:22:21,048 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 14:22:21,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:22:20" (1/3) ... [2018-12-02 14:22:21,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f1a7c47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:22:21, skipping insertion in model container [2018-12-02 14:22:21,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:22:20" (2/3) ... [2018-12-02 14:22:21,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f1a7c47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:22:21, skipping insertion in model container [2018-12-02 14:22:21,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:22:21" (3/3) ... [2018-12-02 14:22:21,050 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_true-unreach-call2.i [2018-12-02 14:22:21,056 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 14:22:21,060 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 14:22:21,069 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 14:22:21,086 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 14:22:21,087 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 14:22:21,087 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 14:22:21,087 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 14:22:21,087 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 14:22:21,087 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 14:22:21,087 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 14:22:21,087 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 14:22:21,087 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 14:22:21,097 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-12-02 14:22:21,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 14:22:21,100 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:22:21,100 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:22:21,101 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:22:21,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:22:21,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1906239810, now seen corresponding path program 1 times [2018-12-02 14:22:21,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:22:21,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:22:21,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:22:21,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:22:21,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:22:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:22:21,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:22:21,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:22:21,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 14:22:21,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-02 14:22:21,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 14:22:21,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 14:22:21,177 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-12-02 14:22:21,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:22:21,189 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2018-12-02 14:22:21,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 14:22:21,190 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-12-02 14:22:21,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:22:21,194 INFO L225 Difference]: With dead ends: 38 [2018-12-02 14:22:21,194 INFO L226 Difference]: Without dead ends: 21 [2018-12-02 14:22:21,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 14:22:21,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-02 14:22:21,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-02 14:22:21,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-02 14:22:21,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2018-12-02 14:22:21,216 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 10 [2018-12-02 14:22:21,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:22:21,216 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 31 transitions. [2018-12-02 14:22:21,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-02 14:22:21,217 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2018-12-02 14:22:21,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 14:22:21,217 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:22:21,217 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:22:21,217 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:22:21,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:22:21,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1847134466, now seen corresponding path program 1 times [2018-12-02 14:22:21,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:22:21,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:22:21,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:22:21,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:22:21,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:22:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:22:21,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:22:21,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:22:21,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:22:21,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:22:21,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:22:21,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:22:21,278 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. Second operand 3 states. [2018-12-02 14:22:21,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:22:21,312 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2018-12-02 14:22:21,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:22:21,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 14:22:21,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:22:21,314 INFO L225 Difference]: With dead ends: 28 [2018-12-02 14:22:21,314 INFO L226 Difference]: Without dead ends: 23 [2018-12-02 14:22:21,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:22:21,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-02 14:22:21,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-12-02 14:22:21,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-02 14:22:21,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2018-12-02 14:22:21,318 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 10 [2018-12-02 14:22:21,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:22:21,318 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2018-12-02 14:22:21,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:22:21,318 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2018-12-02 14:22:21,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 14:22:21,319 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:22:21,319 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:22:21,319 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:22:21,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:22:21,319 INFO L82 PathProgramCache]: Analyzing trace with hash -129940435, now seen corresponding path program 1 times [2018-12-02 14:22:21,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:22:21,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:22:21,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:22:21,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:22:21,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:22:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:22:23,380 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 27 DAG size of output: 12 [2018-12-02 14:22:23,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:22:23,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:22:23,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:22:23,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:22:23,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:22:23,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:22:23,383 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 3 states. [2018-12-02 14:22:23,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:22:23,443 INFO L93 Difference]: Finished difference Result 50 states and 81 transitions. [2018-12-02 14:22:23,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:22:23,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-02 14:22:23,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:22:23,445 INFO L225 Difference]: With dead ends: 50 [2018-12-02 14:22:23,445 INFO L226 Difference]: Without dead ends: 34 [2018-12-02 14:22:23,446 INFO L631 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 [2018-12-02 14:22:23,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-02 14:22:23,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-12-02 14:22:23,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-02 14:22:23,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2018-12-02 14:22:23,452 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 21 [2018-12-02 14:22:23,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:22:23,452 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2018-12-02 14:22:23,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:22:23,452 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2018-12-02 14:22:23,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 14:22:23,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:22:23,453 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:22:23,453 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:22:23,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:22:23,454 INFO L82 PathProgramCache]: Analyzing trace with hash 263086575, now seen corresponding path program 1 times [2018-12-02 14:22:23,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:22:23,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:22:23,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:22:23,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:22:23,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:22:23,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:22:23,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:22:23,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:22:23,612 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_340706df-155e-4261-a9ca-cbf3509225de/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:22:23,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:22:23,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:22:23,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:22:23,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:22:23,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:22:23,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-12-02 14:22:23,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 14:22:23,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 14:22:23,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-12-02 14:22:23,688 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 14 states. [2018-12-02 14:22:23,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:22:23,884 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2018-12-02 14:22:23,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 14:22:23,884 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2018-12-02 14:22:23,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:22:23,885 INFO L225 Difference]: With dead ends: 51 [2018-12-02 14:22:23,885 INFO L226 Difference]: Without dead ends: 46 [2018-12-02 14:22:23,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-12-02 14:22:23,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-02 14:22:23,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-12-02 14:22:23,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 14:22:23,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2018-12-02 14:22:23,891 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 21 [2018-12-02 14:22:23,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:22:23,891 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2018-12-02 14:22:23,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 14:22:23,892 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2018-12-02 14:22:23,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 14:22:23,892 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:22:23,893 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:22:23,893 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:22:23,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:22:23,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1016777103, now seen corresponding path program 1 times [2018-12-02 14:22:23,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:22:23,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:22:23,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:22:23,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:22:23,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:22:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:22:25,918 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_main_~y~0 2))) (let ((.cse1 (* 2 .cse4))) (let ((.cse2 (* (- 2) .cse4)) (.cse0 (= .cse1 c_main_~y~0)) (.cse3 (* 4294967296 (div c_main_~y~0 4294967296)))) (and (or .cse0 (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2 (- 2)) 4294967296)) 2) c_main_~y~0)) (<= .cse3 c_main_~y~0)) (or (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2) 4294967296))) c_main_~y~0)) (and (not .cse0) (< c_main_~y~0 .cse3))))))) is different from false [2018-12-02 14:22:25,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:22:25,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:22:25,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:22:25,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:22:25,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:22:25,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-12-02 14:22:25,922 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand 3 states. [2018-12-02 14:22:25,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:22:25,925 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2018-12-02 14:22:25,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:22:25,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-02 14:22:25,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:22:25,926 INFO L225 Difference]: With dead ends: 60 [2018-12-02 14:22:25,926 INFO L226 Difference]: Without dead ends: 44 [2018-12-02 14:22:25,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-12-02 14:22:25,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-02 14:22:25,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-02 14:22:25,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 14:22:25,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2018-12-02 14:22:25,931 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 21 [2018-12-02 14:22:25,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:22:25,931 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2018-12-02 14:22:25,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:22:25,932 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2018-12-02 14:22:25,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 14:22:25,932 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:22:25,932 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:22:25,933 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:22:25,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:22:25,933 INFO L82 PathProgramCache]: Analyzing trace with hash -2027894353, now seen corresponding path program 1 times [2018-12-02 14:22:25,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:22:25,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:22:25,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:22:25,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:22:25,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:22:25,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:22:27,957 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_main_~y~0 2))) (let ((.cse1 (* 2 .cse4))) (let ((.cse2 (* (- 2) .cse4)) (.cse0 (= .cse1 c_main_~y~0)) (.cse3 (* 4294967296 (div c_main_~y~0 4294967296)))) (and (or .cse0 (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2 (- 2)) 4294967296)) 2) c_main_~y~0)) (<= .cse3 c_main_~y~0)) (or (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2) 4294967296))) c_main_~y~0)) (and (not .cse0) (< c_main_~y~0 .cse3))))))) is different from false [2018-12-02 14:22:27,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:22:27,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:22:27,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:22:27,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:22:27,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:22:27,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-12-02 14:22:27,961 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand 3 states. [2018-12-02 14:22:27,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:22:27,964 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2018-12-02 14:22:27,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:22:27,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-02 14:22:27,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:22:27,965 INFO L225 Difference]: With dead ends: 60 [2018-12-02 14:22:27,965 INFO L226 Difference]: Without dead ends: 44 [2018-12-02 14:22:27,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-12-02 14:22:27,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-02 14:22:27,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-02 14:22:27,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 14:22:27,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2018-12-02 14:22:27,970 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 21 [2018-12-02 14:22:27,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:22:27,970 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2018-12-02 14:22:27,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:22:27,970 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2018-12-02 14:22:27,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 14:22:27,971 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:22:27,971 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:22:27,971 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:22:27,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:22:27,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1680266929, now seen corresponding path program 1 times [2018-12-02 14:22:27,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:22:27,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:22:27,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:22:27,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:22:27,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:22:27,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:22:29,999 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_main_~y~0 2))) (let ((.cse1 (* 2 .cse4))) (let ((.cse2 (* (- 2) .cse4)) (.cse0 (= .cse1 c_main_~y~0)) (.cse3 (* 4294967296 (div c_main_~y~0 4294967296)))) (and (or .cse0 (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2 (- 2)) 4294967296)) 2) c_main_~y~0)) (<= .cse3 c_main_~y~0)) (or (not (= (+ .cse1 (* 4294967296 (div (+ c_main_~y~0 .cse2) 4294967296))) c_main_~y~0)) (and (not .cse0) (< c_main_~y~0 .cse3))))))) is different from false [2018-12-02 14:22:30,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:22:30,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:22:30,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:22:30,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:22:30,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:22:30,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-12-02 14:22:30,003 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand 3 states. [2018-12-02 14:22:30,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:22:30,005 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-12-02 14:22:30,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:22:30,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-02 14:22:30,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:22:30,006 INFO L225 Difference]: With dead ends: 60 [2018-12-02 14:22:30,006 INFO L226 Difference]: Without dead ends: 44 [2018-12-02 14:22:30,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-12-02 14:22:30,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-02 14:22:30,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-02 14:22:30,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 14:22:30,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-12-02 14:22:30,011 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 21 [2018-12-02 14:22:30,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:22:30,011 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-12-02 14:22:30,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:22:30,012 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-12-02 14:22:30,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 14:22:30,012 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:22:30,012 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:22:30,013 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:22:30,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:22:30,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1938432367, now seen corresponding path program 1 times [2018-12-02 14:22:30,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:22:30,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:22:30,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:22:30,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:22:30,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:22:30,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:22:30,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:22:30,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:22:30,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:22:30,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:22:30,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:22:30,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:22:30,051 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 3 states. [2018-12-02 14:22:30,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:22:30,083 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2018-12-02 14:22:30,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:22:30,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-02 14:22:30,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:22:30,084 INFO L225 Difference]: With dead ends: 61 [2018-12-02 14:22:30,084 INFO L226 Difference]: Without dead ends: 45 [2018-12-02 14:22:30,085 INFO L631 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 [2018-12-02 14:22:30,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-02 14:22:30,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-12-02 14:22:30,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 14:22:30,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-12-02 14:22:30,088 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 21 [2018-12-02 14:22:30,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:22:30,088 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-12-02 14:22:30,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:22:30,088 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-12-02 14:22:30,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 14:22:30,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:22:30,089 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:22:30,089 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:22:30,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:22:30,089 INFO L82 PathProgramCache]: Analyzing trace with hash -345519953, now seen corresponding path program 1 times [2018-12-02 14:22:30,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:22:30,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:22:30,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:22:30,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:22:30,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:22:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:22:34,247 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse12)) (.cse11 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse11 c_main_~y~0)) (.cse10 (* (- 2) .cse12)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse11)) (.cse9 (div (+ c_main_~y~0 .cse10 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse10) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= c_main_~x~0 1) (<= 1 c_main_~x~0) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from true [2018-12-02 14:22:42,324 WARN L180 SmtUtils]: Spent 8.06 s on a formula simplification. DAG size of input: 54 DAG size of output: 18 [2018-12-02 14:22:44,335 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse13 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse13)) (.cse12 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse12 c_main_~y~0)) (.cse11 (* (- 2) .cse13)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse10 (+ c_main_~x~0 1)) (.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse12)) (.cse9 (div (+ c_main_~y~0 .cse11 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse11) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= .cse10 0) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (<= 0 .cse10) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-12-02 14:22:46,355 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse36 (div c_main_~x~0 2))) (let ((.cse0 (+ .cse36 3)) (.cse1 (+ c_main_~x~0 5))) (and (or (< 0 .cse0) (let ((.cse37 (div c_main_~y~0 2))) (let ((.cse11 (* 2 .cse36)) (.cse12 (* 2 .cse37)) (.cse34 (* (- 2) .cse37)) (.cse35 (* (- 2) .cse36))) (let ((.cse4 (div (+ c_main_~x~0 .cse35 (- 2)) 4294967296)) (.cse30 (div (+ c_main_~y~0 .cse34 (- 2)) 4294967296)) (.cse6 (div (+ c_main_~x~0 .cse35) 4294967296)) (.cse31 (div (+ c_main_~y~0 .cse34) 4294967296)) (.cse16 (= c_main_~y~0 .cse12)) (.cse7 (= .cse11 c_main_~x~0)) (.cse33 (* 4294967296 (div c_main_~x~0 4294967296))) (.cse32 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse17 (<= .cse32 c_main_~y~0)) (.cse8 (<= .cse33 c_main_~x~0)) (.cse2 (not .cse7)) (.cse3 (< c_main_~x~0 .cse33)) (.cse22 (not .cse16)) (.cse23 (< c_main_~y~0 .cse32)) (.cse21 (* 4294967296 .cse31)) (.cse20 (* 4294967296 .cse6)) (.cse13 (* 4294967296 .cse30)) (.cse10 (* 4294967296 .cse4))) (let ((.cse26 (+ c_main_~y~0 .cse10 .cse11)) (.cse9 (+ .cse12 c_main_~x~0 .cse13)) (.cse25 (+ .cse12 c_main_~x~0 .cse13 2)) (.cse27 (+ c_main_~y~0 .cse10 .cse11 2)) (.cse14 (+ c_main_~y~0 .cse11 .cse20)) (.cse19 (+ .cse12 c_main_~x~0 .cse21)) (.cse18 (and .cse22 .cse23)) (.cse15 (and .cse2 .cse3)) (.cse5 (or .cse7 .cse8)) (.cse24 (or .cse16 .cse17))) (and (<= 0 .cse1) (or (and .cse2 .cse3 (<= (+ .cse4 1) 0)) (and .cse5 (<= (+ .cse6 1) 0)) (and (or (and (or .cse7 .cse8 (< .cse9 (+ c_main_~y~0 .cse10 .cse11 1))) (or (< (+ .cse12 c_main_~x~0 .cse13 1) .cse14) .cse15)) .cse16 .cse17) (or .cse18 (and (or .cse15 (< .cse19 (+ c_main_~y~0 .cse11 .cse20 1))) (or (< .cse19 (+ c_main_~y~0 .cse10 .cse11 3)) .cse7 .cse8)))) (and (or (< (+ .cse12 .cse13 2) c_main_~y~0) .cse16 .cse17) (or .cse18 (< (+ .cse12 .cse21) c_main_~y~0))) (and (<= (+ .cse12 .cse13 3) c_main_~y~0) .cse22 .cse23) (and .cse24 (<= (+ .cse12 .cse21 1) c_main_~y~0)) (and (or (and (or (< .cse25 .cse14) .cse15) (or (< .cse9 .cse26) .cse7 .cse8)) .cse16 .cse17) (or .cse18 (and (or .cse7 .cse8 (< .cse19 .cse27)) (or (< .cse19 .cse14) .cse15))))) (or (and .cse22 .cse23 (or (and (<= .cse26 .cse9) .cse2 .cse3) (and .cse5 (<= .cse14 .cse25)))) (and (or (and .cse2 (<= .cse27 .cse19) .cse3) (and .cse5 (<= .cse14 .cse19))) .cse24) (and (or (< 0 .cse6) .cse15) (or (< 0 .cse4) .cse7 .cse8)) (let ((.cse29 (+ .cse30 1)) (.cse28 (+ .cse31 1))) (and (or (and (or .cse18 (and (or .cse15 (< .cse6 .cse28)) (or (< .cse4 .cse28) .cse7 .cse8))) (or (and (or (< .cse6 .cse29) .cse15) (or .cse7 (< .cse4 .cse29) .cse8)) .cse16 .cse17)) (and .cse22 .cse23 (<= 0 .cse30)) (and (<= 0 .cse31) .cse24)) (or (and (<= c_main_~y~0 (+ .cse12 3)) .cse22 .cse23) (and (or (and .cse5 (<= .cse29 .cse6)) (and .cse2 (<= .cse29 .cse4) .cse3)) .cse22 .cse23) (and (<= c_main_~y~0 (+ .cse12 1)) .cse24) (and (or (and .cse2 (<= .cse28 .cse4) .cse3) (and .cse5 (<= .cse28 .cse6))) .cse24) (<= c_main_~x~0 .cse11)))))))))))) (or (<= .cse0 0) (<= .cse1 0))))) is different from false [2018-12-02 14:22:50,514 WARN L180 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 170 DAG size of output: 21 [2018-12-02 14:22:50,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2018-12-02 14:22:50,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:22:50,533 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_340706df-155e-4261-a9ca-cbf3509225de/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:22:50,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:22:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:22:50,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:22:50,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:22:50,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:22:50,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 15 [2018-12-02 14:22:50,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 14:22:50,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 14:22:50,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=111, Unknown=4, NotChecked=66, Total=210 [2018-12-02 14:22:50,694 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 15 states. [2018-12-02 14:22:52,775 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse12 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse12)) (.cse11 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse11 c_main_~y~0)) (.cse10 (* (- 2) .cse12)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse11)) (.cse9 (div (+ c_main_~y~0 .cse10 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse10) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= c_main_~x~0 1) (<= 1 c_main_~x~0) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (not (= (mod c_main_~y~0 2) 0)) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-12-02 14:23:00,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:23:00,903 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-12-02 14:23:00,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 14:23:00,903 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2018-12-02 14:23:00,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:23:00,904 INFO L225 Difference]: With dead ends: 62 [2018-12-02 14:23:00,904 INFO L226 Difference]: Without dead ends: 33 [2018-12-02 14:23:00,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 9 SemanticMatches, 15 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 30.5s TimeCoverageRelationStatistics Valid=35, Invalid=132, Unknown=5, NotChecked=100, Total=272 [2018-12-02 14:23:00,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-02 14:23:00,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-02 14:23:00,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-02 14:23:00,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-02 14:23:00,906 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 21 [2018-12-02 14:23:00,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:23:00,906 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-12-02 14:23:00,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 14:23:00,906 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-02 14:23:00,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 14:23:00,907 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:23:00,907 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:23:00,907 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:23:00,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:23:00,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1061692130, now seen corresponding path program 2 times [2018-12-02 14:23:00,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:23:00,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:23:00,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:23:00,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:23:00,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:23:00,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:23:01,145 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:23:01,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:23:01,145 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_340706df-155e-4261-a9ca-cbf3509225de/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:23:01,151 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 14:23:01,161 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 14:23:01,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:23:01,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:23:01,185 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:23:01,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:23:01,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-12-02 14:23:01,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-02 14:23:01,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-02 14:23:01,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-12-02 14:23:01,201 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 24 states. [2018-12-02 14:23:01,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:23:01,417 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-12-02 14:23:01,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-02 14:23:01,417 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 32 [2018-12-02 14:23:01,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:23:01,418 INFO L225 Difference]: With dead ends: 50 [2018-12-02 14:23:01,418 INFO L226 Difference]: Without dead ends: 45 [2018-12-02 14:23:01,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-12-02 14:23:01,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-02 14:23:01,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-12-02 14:23:01,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 14:23:01,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-02 14:23:01,421 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 32 [2018-12-02 14:23:01,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:23:01,421 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-02 14:23:01,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-02 14:23:01,421 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-02 14:23:01,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-02 14:23:01,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:23:01,422 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:23:01,422 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:23:01,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:23:01,422 INFO L82 PathProgramCache]: Analyzing trace with hash 263609359, now seen corresponding path program 3 times [2018-12-02 14:23:01,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:23:01,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:23:01,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:23:01,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:23:01,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:23:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:23:01,822 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:23:01,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:23:01,823 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_340706df-155e-4261-a9ca-cbf3509225de/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:23:01,829 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 14:23:01,844 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-02 14:23:01,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:23:01,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:23:01,899 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:23:01,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:23:01,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-12-02 14:23:01,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-02 14:23:01,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-02 14:23:01,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2018-12-02 14:23:01,915 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 34 states. [2018-12-02 14:23:02,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:23:02,313 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-12-02 14:23:02,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-02 14:23:02,314 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 43 [2018-12-02 14:23:02,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:23:02,314 INFO L225 Difference]: With dead ends: 61 [2018-12-02 14:23:02,314 INFO L226 Difference]: Without dead ends: 56 [2018-12-02 14:23:02,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2018-12-02 14:23:02,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-02 14:23:02,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2018-12-02 14:23:02,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-02 14:23:02,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-12-02 14:23:02,318 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 43 [2018-12-02 14:23:02,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:23:02,318 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-12-02 14:23:02,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-02 14:23:02,318 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-12-02 14:23:02,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 14:23:02,319 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:23:02,319 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:23:02,319 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:23:02,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:23:02,320 INFO L82 PathProgramCache]: Analyzing trace with hash 915707074, now seen corresponding path program 4 times [2018-12-02 14:23:02,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:23:02,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:23:02,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:23:02,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:23:02,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:23:02,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:23:02,966 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:23:02,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:23:02,966 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_340706df-155e-4261-a9ca-cbf3509225de/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:23:02,972 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 14:23:02,985 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 14:23:02,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:23:02,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:23:03,034 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:23:03,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:23:03,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2018-12-02 14:23:03,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-02 14:23:03,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-02 14:23:03,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2018-12-02 14:23:03,049 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 44 states. [2018-12-02 14:23:03,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:23:03,672 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-12-02 14:23:03,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-02 14:23:03,672 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 54 [2018-12-02 14:23:03,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:23:03,673 INFO L225 Difference]: With dead ends: 72 [2018-12-02 14:23:03,673 INFO L226 Difference]: Without dead ends: 67 [2018-12-02 14:23:03,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2018-12-02 14:23:03,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-02 14:23:03,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-12-02 14:23:03,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-02 14:23:03,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-12-02 14:23:03,678 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 54 [2018-12-02 14:23:03,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:23:03,678 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-12-02 14:23:03,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-02 14:23:03,678 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-12-02 14:23:03,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 14:23:03,679 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:23:03,679 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:23:03,679 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:23:03,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:23:03,680 INFO L82 PathProgramCache]: Analyzing trace with hash -161874385, now seen corresponding path program 5 times [2018-12-02 14:23:03,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:23:03,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:23:03,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:23:03,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:23:03,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:23:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:23:05,782 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse9))) (let ((.cse8 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse7 (= c_main_~y~0 .cse0)) (.cse6 (* (- 2) .cse9))) (let ((.cse1 (* 4294967296 (div (+ c_main_~y~0 .cse6 (- 2)) 4294967296))) (.cse2 (not .cse7)) (.cse3 (< c_main_~y~0 .cse8)) (.cse5 (or .cse7 (<= .cse8 c_main_~y~0))) (.cse4 (* 4294967296 (div (+ c_main_~y~0 .cse6) 4294967296)))) (and (or (and (<= (+ .cse0 c_main_~x~0 .cse1) c_main_~y~0) .cse2 .cse3) (and (<= (+ .cse0 c_main_~x~0 .cse4) (+ c_main_~y~0 2)) .cse5)) (<= 2 c_main_~x~0) (or (and (= (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (and .cse5 (= (+ .cse0 .cse4) c_main_~y~0)))))))) is different from true [2018-12-02 14:23:07,793 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse9))) (let ((.cse8 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse7 (= c_main_~y~0 .cse0)) (.cse6 (* (- 2) .cse9))) (let ((.cse3 (* 4294967296 (div (+ c_main_~y~0 .cse6 (- 2)) 4294967296))) (.cse4 (not .cse7)) (.cse5 (< c_main_~y~0 .cse8)) (.cse2 (or .cse7 (<= .cse8 c_main_~y~0))) (.cse1 (* 4294967296 (div (+ c_main_~y~0 .cse6) 4294967296)))) (and (or (and (<= (+ .cse0 c_main_~x~0 .cse1) (+ c_main_~y~0 4)) .cse2) (and (<= (+ .cse0 c_main_~x~0 .cse3) (+ c_main_~y~0 2)) .cse4 .cse5)) (<= 4 c_main_~x~0) (or (and (= (+ .cse0 .cse3 2) c_main_~y~0) .cse4 .cse5) (and .cse2 (= (+ .cse0 .cse1) c_main_~y~0)))))))) is different from true [2018-12-02 14:23:11,878 WARN L180 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 14:23:13,984 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 14:23:16,044 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 14:23:18,099 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 14:23:20,154 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 14:23:24,221 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 14:23:26,284 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 14:23:28,345 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 14:23:30,414 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 14:23:32,495 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 14:23:36,672 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 14:23:42,859 WARN L180 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 14:23:46,958 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 14:23:49,046 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 14:23:51,136 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 14:23:53,328 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 14:23:55,426 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 14:24:01,537 WARN L180 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 14:24:07,665 WARN L180 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 14:24:11,782 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 14:24:13,901 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 14:24:20,040 WARN L180 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 14:24:24,166 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 14:24:30,293 WARN L180 SmtUtils]: Spent 6.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 14:24:32,398 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 14:24:34,525 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 14:24:38,772 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 14:24:42,916 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 14:24:45,053 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 14:24:49,190 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 14:24:53,343 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 14:24:55,474 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 14:24:59,642 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 14:25:07,807 WARN L180 SmtUtils]: Spent 8.06 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 14:25:09,961 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 14:25:16,123 WARN L180 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 14:25:22,587 WARN L180 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 14:25:24,745 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-12-02 14:25:45,190 WARN L180 SmtUtils]: Spent 10.15 s on a formula simplification. DAG size of input: 120 DAG size of output: 27 [2018-12-02 14:25:59,625 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2018-12-02 14:25:59,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:25:59,625 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_340706df-155e-4261-a9ca-cbf3509225de/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:25:59,632 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-02 14:26:00,755 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-12-02 14:26:00,755 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:26:00,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:26:01,432 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:26:01,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 14:26:01,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 66 [2018-12-02 14:26:01,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-02 14:26:01,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-02 14:26:01,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=3895, Unknown=7, NotChecked=250, Total=4290 [2018-12-02 14:26:01,448 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 66 states. [2018-12-02 14:26:03,585 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 39 DAG size of output: 16 [2018-12-02 14:26:04,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:26:04,903 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2018-12-02 14:26:04,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-02 14:26:04,903 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 65 [2018-12-02 14:26:04,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:26:04,904 INFO L225 Difference]: With dead ends: 80 [2018-12-02 14:26:04,904 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 14:26:04,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 178.6s TimeCoverageRelationStatistics Valid=148, Invalid=4275, Unknown=7, NotChecked=262, Total=4692 [2018-12-02 14:26:04,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 14:26:04,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 14:26:04,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 14:26:04,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 14:26:04,905 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2018-12-02 14:26:04,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:26:04,905 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 14:26:04,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-02 14:26:04,905 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 14:26:04,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 14:26:04,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 14:26:05,009 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-02 14:26:05,009 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 14:26:05,009 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 14:26:05,009 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-02 14:26:05,009 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 14:26:05,009 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 14:26:05,009 INFO L444 ceAbstractionStarter]: At program point L31-1(lines 12 33) the Hoare annotation is: (let ((.cse5 (div main_~y~0 2))) (let ((.cse3 (* 2 .cse5)) (.cse4 (* 4294967296 (div (+ main_~y~0 (* (- 2) .cse5)) 4294967296)))) (let ((.cse1 (+ .cse3 main_~x~0 .cse4)) (.cse0 (= (+ .cse3 .cse4) main_~y~0))) (or (and (<= main_~x~0 0) (<= 0 main_~x~0)) (and (<= 20 main_~x~0) .cse0 (<= main_~x~0 20)) (and (<= main_~x~0 60) (<= 60 main_~x~0) .cse0) (and (<= .cse1 (+ main_~y~0 100)) .cse0 (<= 100 main_~x~0)) (let ((.cse2 (+ main_~x~0 5))) (and (<= 0 .cse2) (<= .cse2 0) (<= (+ .cse3 .cse4 1) main_~y~0))) (and (<= .cse1 (+ main_~y~0 40)) .cse0 (<= 40 main_~x~0)) (and (<= 80 main_~x~0) (<= main_~x~0 80) .cse0))))) [2018-12-02 14:26:05,009 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 12 33) no Hoare annotation was computed. [2018-12-02 14:26:05,009 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 9 35) no Hoare annotation was computed. [2018-12-02 14:26:05,009 INFO L448 ceAbstractionStarter]: For program point L23-1(lines 12 33) no Hoare annotation was computed. [2018-12-02 14:26:05,009 INFO L448 ceAbstractionStarter]: For program point L19-1(lines 12 33) no Hoare annotation was computed. [2018-12-02 14:26:05,010 INFO L448 ceAbstractionStarter]: For program point L15-1(lines 12 33) no Hoare annotation was computed. [2018-12-02 14:26:05,010 INFO L444 ceAbstractionStarter]: At program point L12-2(lines 12 33) the Hoare annotation is: (let ((.cse3 (div main_~y~0 2))) (let ((.cse0 (* 2 .cse3)) (.cse1 (* 4294967296 (div (+ main_~y~0 (* (- 2) .cse3)) 4294967296)))) (or (and (<= main_~y~0 (+ .cse0 .cse1)) (<= (+ .cse0 main_~x~0 .cse1) (+ main_~y~0 100)) (<= 100 main_~x~0)) (let ((.cse2 (+ main_~x~0 5))) (and (<= 0 .cse2) (<= .cse2 0) (<= (+ .cse0 .cse1 1) main_~y~0)))))) [2018-12-02 14:26:05,010 INFO L448 ceAbstractionStarter]: For program point L29-1(lines 12 33) no Hoare annotation was computed. [2018-12-02 14:26:05,010 INFO L448 ceAbstractionStarter]: For program point L25-1(lines 12 33) no Hoare annotation was computed. [2018-12-02 14:26:05,010 INFO L448 ceAbstractionStarter]: For program point L21-1(lines 12 33) no Hoare annotation was computed. [2018-12-02 14:26:05,010 INFO L448 ceAbstractionStarter]: For program point L17-1(lines 12 33) no Hoare annotation was computed. [2018-12-02 14:26:05,010 INFO L448 ceAbstractionStarter]: For program point L13(lines 13 14) no Hoare annotation was computed. [2018-12-02 14:26:05,010 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 9 35) no Hoare annotation was computed. [2018-12-02 14:26:05,010 INFO L448 ceAbstractionStarter]: For program point L13-2(lines 12 33) no Hoare annotation was computed. [2018-12-02 14:26:05,010 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 9 35) the Hoare annotation is: true [2018-12-02 14:26:05,010 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-12-02 14:26:05,010 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-12-02 14:26:05,010 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-12-02 14:26:05,010 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-12-02 14:26:05,010 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-12-02 14:26:05,010 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-12-02 14:26:05,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:26:05 BoogieIcfgContainer [2018-12-02 14:26:05,019 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 14:26:05,019 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 14:26:05,019 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 14:26:05,019 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 14:26:05,020 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:22:21" (3/4) ... [2018-12-02 14:26:05,022 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 14:26:05,025 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 14:26:05,025 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 14:26:05,026 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-12-02 14:26:05,028 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-12-02 14:26:05,028 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-02 14:26:05,028 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 14:26:05,053 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_340706df-155e-4261-a9ca-cbf3509225de/bin-2019/uautomizer/witness.graphml [2018-12-02 14:26:05,053 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 14:26:05,054 INFO L168 Benchmark]: Toolchain (without parser) took 224369.17 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 244.8 MB). Free memory was 952.2 MB in the beginning and 1.0 GB in the end (delta: -50.3 MB). Peak memory consumption was 194.6 MB. Max. memory is 11.5 GB. [2018-12-02 14:26:05,054 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:26:05,054 INFO L168 Benchmark]: CACSL2BoogieTranslator took 141.48 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 941.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 14:26:05,055 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.44 ms. Allocated memory is still 1.0 GB. Free memory is still 941.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:26:05,055 INFO L168 Benchmark]: Boogie Preprocessor took 13.95 ms. Allocated memory is still 1.0 GB. Free memory was 941.5 MB in the beginning and 938.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 14:26:05,055 INFO L168 Benchmark]: RCFGBuilder took 191.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 938.8 MB in the beginning and 1.1 GB in the end (delta: -174.0 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2018-12-02 14:26:05,055 INFO L168 Benchmark]: TraceAbstraction took 223973.26 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 104.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 110.3 MB). Peak memory consumption was 215.1 MB. Max. memory is 11.5 GB. [2018-12-02 14:26:05,055 INFO L168 Benchmark]: Witness Printer took 34.28 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:26:05,056 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 141.48 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 941.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.44 ms. Allocated memory is still 1.0 GB. Free memory is still 941.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.95 ms. Allocated memory is still 1.0 GB. Free memory was 941.5 MB in the beginning and 938.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 191.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 938.8 MB in the beginning and 1.1 GB in the end (delta: -174.0 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 223973.26 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 104.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 110.3 MB). Peak memory consumption was 215.1 MB. Max. memory is 11.5 GB. * Witness Printer took 34.28 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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: 12]: Loop Invariant Derived loop invariant: ((((((x <= 0 && 0 <= x) || ((20 <= x && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) && x <= 20)) || ((x <= 60 && 60 <= x) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y)) || ((2 * (y / 2) + x + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) <= y + 100 && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) && 100 <= x)) || ((0 <= x + 5 && x + 5 <= 0) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) + 1 <= y)) || ((2 * (y / 2) + x + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) <= y + 40 && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) && 40 <= x)) || ((80 <= x && x <= 80) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. SAFE Result, 223.9s OverallTime, 13 OverallIterations, 5 TraceHistogramMax, 15.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 269 SDtfs, 35 SDslu, 1154 SDs, 0 SdLazy, 7342 SolverSat, 130 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 446 GetRequests, 228 SyntacticMatches, 22 SemanticMatches, 196 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 218.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 8 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 21 PreInvPairs, 30 NumberOfFragments, 289 HoareAnnotationTreeSize, 21 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 184 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 206.8s InterpolantComputationTime, 597 NumberOfCodeBlocks, 597 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 578 ConstructedInterpolants, 0 QuantifiedInterpolants, 444252 SizeOfPredicates, 8 NumberOfNonLiveVariables, 790 ConjunctsInSsa, 350 ConjunctsInUnsatCore, 19 InterpolantComputations, 7 PerfectInterpolantSequences, 5/477 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...