./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 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_44c7a51a-57bc-480c-b676-791c933301ea/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_44c7a51a-57bc-480c-b676-791c933301ea/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_44c7a51a-57bc-480c-b676-791c933301ea/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_44c7a51a-57bc-480c-b676-791c933301ea/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_44c7a51a-57bc-480c-b676-791c933301ea/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_44c7a51a-57bc-480c-b676-791c933301ea/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-0cd3be1 [2018-11-28 12:27:07,681 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:27:07,682 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:27:07,690 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:27:07,690 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:27:07,691 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:27:07,691 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:27:07,693 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:27:07,694 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:27:07,694 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:27:07,695 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:27:07,695 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:27:07,696 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:27:07,696 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:27:07,697 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:27:07,697 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:27:07,698 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:27:07,699 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:27:07,700 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:27:07,701 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:27:07,702 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:27:07,703 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:27:07,705 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:27:07,705 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:27:07,705 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:27:07,705 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:27:07,706 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:27:07,707 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:27:07,707 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:27:07,708 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:27:07,708 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:27:07,709 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:27:07,709 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:27:07,709 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:27:07,709 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:27:07,710 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:27:07,710 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_44c7a51a-57bc-480c-b676-791c933301ea/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 12:27:07,720 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:27:07,720 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:27:07,721 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 12:27:07,721 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 12:27:07,722 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:27:07,722 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:27:07,722 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:27:07,722 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:27:07,722 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 12:27:07,722 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:27:07,723 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 12:27:07,723 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:27:07,723 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 12:27:07,723 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 12:27:07,723 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 12:27:07,723 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 12:27:07,723 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 12:27:07,724 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:27:07,724 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 12:27:07,724 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:27:07,724 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:27:07,724 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 12:27:07,724 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 12:27:07,724 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 12:27:07,725 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:27:07,725 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 12:27:07,725 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 12:27:07,725 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:27:07,725 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 12:27:07,725 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 12:27:07,726 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_44c7a51a-57bc-480c-b676-791c933301ea/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-11-28 12:27:07,750 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:27:07,759 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:27:07,762 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:27:07,763 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:27:07,764 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:27:07,764 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_44c7a51a-57bc-480c-b676-791c933301ea/bin-2019/uautomizer/../../sv-benchmarks/c/loop-acceleration/diamond_true-unreach-call2.i [2018-11-28 12:27:07,811 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_44c7a51a-57bc-480c-b676-791c933301ea/bin-2019/uautomizer/data/34778c431/8fbb08788f744c39b2f6962c76c40e7f/FLAGe913c1cca [2018-11-28 12:27:08,134 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:27:08,135 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_44c7a51a-57bc-480c-b676-791c933301ea/sv-benchmarks/c/loop-acceleration/diamond_true-unreach-call2.i [2018-11-28 12:27:08,138 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_44c7a51a-57bc-480c-b676-791c933301ea/bin-2019/uautomizer/data/34778c431/8fbb08788f744c39b2f6962c76c40e7f/FLAGe913c1cca [2018-11-28 12:27:08,570 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_44c7a51a-57bc-480c-b676-791c933301ea/bin-2019/uautomizer/data/34778c431/8fbb08788f744c39b2f6962c76c40e7f [2018-11-28 12:27:08,573 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:27:08,574 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 12:27:08,574 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:27:08,574 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:27:08,577 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:27:08,577 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:27:08" (1/1) ... [2018-11-28 12:27:08,579 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a4dd75d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:08, skipping insertion in model container [2018-11-28 12:27:08,579 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:27:08" (1/1) ... [2018-11-28 12:27:08,584 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:27:08,595 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:27:08,701 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:27:08,703 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:27:08,716 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:27:08,725 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:27:08,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:08 WrapperNode [2018-11-28 12:27:08,725 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:27:08,726 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 12:27:08,726 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 12:27:08,726 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 12:27:08,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:08" (1/1) ... [2018-11-28 12:27:08,735 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:08" (1/1) ... [2018-11-28 12:27:08,742 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 12:27:08,742 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:27:08,742 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:27:08,742 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:27:08,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:08" (1/1) ... [2018-11-28 12:27:08,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:08" (1/1) ... [2018-11-28 12:27:08,750 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:08" (1/1) ... [2018-11-28 12:27:08,750 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:08" (1/1) ... [2018-11-28 12:27:08,752 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:08" (1/1) ... [2018-11-28 12:27:08,756 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:08" (1/1) ... [2018-11-28 12:27:08,757 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:08" (1/1) ... [2018-11-28 12:27:08,758 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:27:08,758 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:27:08,758 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:27:08,758 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:27:08,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_44c7a51a-57bc-480c-b676-791c933301ea/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-11-28 12:27:08,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 12:27:08,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 12:27:08,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:27:08,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:27:08,844 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 12:27:08,844 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 12:27:08,844 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-28 12:27:08,844 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-28 12:27:09,004 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:27:09,004 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 12:27:09,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:27:09 BoogieIcfgContainer [2018-11-28 12:27:09,005 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:27:09,005 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 12:27:09,005 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 12:27:09,008 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 12:27:09,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:27:08" (1/3) ... [2018-11-28 12:27:09,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39523b82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:27:09, skipping insertion in model container [2018-11-28 12:27:09,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:08" (2/3) ... [2018-11-28 12:27:09,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39523b82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:27:09, skipping insertion in model container [2018-11-28 12:27:09,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:27:09" (3/3) ... [2018-11-28 12:27:09,011 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_true-unreach-call2.i [2018-11-28 12:27:09,020 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 12:27:09,026 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 12:27:09,040 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 12:27:09,064 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:27:09,065 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 12:27:09,065 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 12:27:09,065 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 12:27:09,065 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:27:09,065 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:27:09,065 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 12:27:09,065 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:27:09,065 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 12:27:09,082 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-28 12:27:09,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 12:27:09,087 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:09,087 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:27:09,089 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:09,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:09,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1906239810, now seen corresponding path program 1 times [2018-11-28 12:27:09,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:09,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:09,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:09,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:09,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:09,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:09,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:27:09,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:09,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 12:27:09,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-28 12:27:09,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 12:27:09,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 12:27:09,198 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-28 12:27:09,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:09,215 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2018-11-28 12:27:09,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 12:27:09,216 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-28 12:27:09,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:09,223 INFO L225 Difference]: With dead ends: 38 [2018-11-28 12:27:09,223 INFO L226 Difference]: Without dead ends: 21 [2018-11-28 12:27:09,225 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-11-28 12:27:09,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-28 12:27:09,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-28 12:27:09,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 12:27:09,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2018-11-28 12:27:09,249 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 10 [2018-11-28 12:27:09,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:09,249 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 31 transitions. [2018-11-28 12:27:09,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-28 12:27:09,249 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2018-11-28 12:27:09,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 12:27:09,250 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:09,250 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:27:09,250 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:09,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:09,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1847134466, now seen corresponding path program 1 times [2018-11-28 12:27:09,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:09,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:09,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:09,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:09,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:09,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:09,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:27:09,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:09,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:09,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:09,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:09,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:09,330 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. Second operand 3 states. [2018-11-28 12:27:09,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:09,384 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2018-11-28 12:27:09,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:09,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 12:27:09,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:09,386 INFO L225 Difference]: With dead ends: 28 [2018-11-28 12:27:09,386 INFO L226 Difference]: Without dead ends: 23 [2018-11-28 12:27:09,387 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-11-28 12:27:09,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-28 12:27:09,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-11-28 12:27:09,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-28 12:27:09,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2018-11-28 12:27:09,391 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 10 [2018-11-28 12:27:09,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:09,391 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2018-11-28 12:27:09,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:09,392 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2018-11-28 12:27:09,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 12:27:09,392 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:09,392 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-11-28 12:27:09,392 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:09,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:09,393 INFO L82 PathProgramCache]: Analyzing trace with hash -129940435, now seen corresponding path program 1 times [2018-11-28 12:27:09,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:09,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:09,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:09,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:09,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:11,474 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 27 DAG size of output: 12 [2018-11-28 12:27:11,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:27:11,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:11,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:11,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:11,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:11,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:11,477 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 3 states. [2018-11-28 12:27:11,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:11,559 INFO L93 Difference]: Finished difference Result 50 states and 81 transitions. [2018-11-28 12:27:11,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:11,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-28 12:27:11,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:11,561 INFO L225 Difference]: With dead ends: 50 [2018-11-28 12:27:11,561 INFO L226 Difference]: Without dead ends: 34 [2018-11-28 12:27:11,561 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-11-28 12:27:11,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-28 12:27:11,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-28 12:27:11,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-28 12:27:11,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2018-11-28 12:27:11,570 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 21 [2018-11-28 12:27:11,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:11,571 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2018-11-28 12:27:11,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:11,571 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2018-11-28 12:27:11,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 12:27:11,572 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:11,572 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-11-28 12:27:11,572 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:11,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:11,572 INFO L82 PathProgramCache]: Analyzing trace with hash 263086575, now seen corresponding path program 1 times [2018-11-28 12:27:11,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:11,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:11,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:11,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:11,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:11,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:27:11,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:27:11,745 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_44c7a51a-57bc-480c-b676-791c933301ea/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-11-28 12:27:11,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:11,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:27:11,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:27:11,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:27:11,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-28 12:27:11,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 12:27:11,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 12:27:11,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-28 12:27:11,866 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 14 states. [2018-11-28 12:27:12,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:12,027 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2018-11-28 12:27:12,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 12:27:12,028 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2018-11-28 12:27:12,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:12,029 INFO L225 Difference]: With dead ends: 51 [2018-11-28 12:27:12,029 INFO L226 Difference]: Without dead ends: 46 [2018-11-28 12:27:12,030 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-11-28 12:27:12,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-28 12:27:12,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-11-28 12:27:12,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 12:27:12,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2018-11-28 12:27:12,037 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 21 [2018-11-28 12:27:12,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:12,037 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2018-11-28 12:27:12,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 12:27:12,038 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2018-11-28 12:27:12,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 12:27:12,038 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:12,038 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-11-28 12:27:12,039 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:12,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:12,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1016777103, now seen corresponding path program 1 times [2018-11-28 12:27:12,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:12,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:12,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:12,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:12,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:12,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:14,067 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-11-28 12:27:14,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:27:14,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:14,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:14,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:14,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:14,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-11-28 12:27:14,071 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand 3 states. [2018-11-28 12:27:14,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:14,073 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2018-11-28 12:27:14,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:14,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-28 12:27:14,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:14,074 INFO L225 Difference]: With dead ends: 60 [2018-11-28 12:27:14,074 INFO L226 Difference]: Without dead ends: 44 [2018-11-28 12:27:14,075 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-11-28 12:27:14,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-28 12:27:14,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-28 12:27:14,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 12:27:14,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2018-11-28 12:27:14,079 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 21 [2018-11-28 12:27:14,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:14,079 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2018-11-28 12:27:14,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:14,079 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2018-11-28 12:27:14,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 12:27:14,080 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:14,080 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-11-28 12:27:14,080 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:14,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:14,080 INFO L82 PathProgramCache]: Analyzing trace with hash -2027894353, now seen corresponding path program 1 times [2018-11-28 12:27:14,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:14,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:14,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:14,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:14,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:14,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:16,112 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-11-28 12:27:16,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:27:16,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:16,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:16,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:16,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:16,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-11-28 12:27:16,116 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand 3 states. [2018-11-28 12:27:16,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:16,120 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2018-11-28 12:27:16,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:16,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-28 12:27:16,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:16,121 INFO L225 Difference]: With dead ends: 60 [2018-11-28 12:27:16,121 INFO L226 Difference]: Without dead ends: 44 [2018-11-28 12:27:16,122 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-11-28 12:27:16,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-28 12:27:16,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-28 12:27:16,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 12:27:16,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2018-11-28 12:27:16,128 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 21 [2018-11-28 12:27:16,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:16,128 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2018-11-28 12:27:16,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:16,128 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2018-11-28 12:27:16,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 12:27:16,129 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:16,129 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-11-28 12:27:16,130 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:16,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:16,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1680266929, now seen corresponding path program 1 times [2018-11-28 12:27:16,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:16,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:16,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:16,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:16,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:18,163 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-11-28 12:27:18,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:27:18,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:18,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:18,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:18,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:18,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=2, Unknown=1, NotChecked=0, Total=6 [2018-11-28 12:27:18,166 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand 3 states. [2018-11-28 12:27:18,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:18,168 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-11-28 12:27:18,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:18,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-28 12:27:18,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:18,169 INFO L225 Difference]: With dead ends: 60 [2018-11-28 12:27:18,169 INFO L226 Difference]: Without dead ends: 44 [2018-11-28 12:27:18,170 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-11-28 12:27:18,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-28 12:27:18,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-28 12:27:18,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 12:27:18,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-11-28 12:27:18,173 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 21 [2018-11-28 12:27:18,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:18,173 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-11-28 12:27:18,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:18,173 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-11-28 12:27:18,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 12:27:18,174 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:18,174 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-11-28 12:27:18,174 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:18,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:18,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1938432367, now seen corresponding path program 1 times [2018-11-28 12:27:18,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:18,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:18,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:18,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:18,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:18,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:18,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:27:18,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:27:18,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 12:27:18,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 12:27:18,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 12:27:18,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 12:27:18,220 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 3 states. [2018-11-28 12:27:18,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:18,277 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2018-11-28 12:27:18,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 12:27:18,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-28 12:27:18,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:18,278 INFO L225 Difference]: With dead ends: 61 [2018-11-28 12:27:18,278 INFO L226 Difference]: Without dead ends: 45 [2018-11-28 12:27:18,278 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-11-28 12:27:18,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-28 12:27:18,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-11-28 12:27:18,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 12:27:18,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-11-28 12:27:18,281 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 21 [2018-11-28 12:27:18,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:18,282 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-11-28 12:27:18,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 12:27:18,282 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-28 12:27:18,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 12:27:18,283 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:18,283 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-11-28 12:27:18,283 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:18,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:18,283 INFO L82 PathProgramCache]: Analyzing trace with hash -345519953, now seen corresponding path program 1 times [2018-11-28 12:27:18,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:18,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:18,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:18,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:18,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:20,444 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse14 (div c_main_~y~0 2))) (let ((.cse9 (* 2 .cse14))) (let ((.cse13 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse4 (= c_main_~y~0 .cse9)) (.cse12 (* (- 2) .cse14))) (let ((.cse11 (div (+ c_main_~y~0 .cse12) 4294967296)) (.cse7 (not .cse4)) (.cse8 (< c_main_~y~0 .cse13)) (.cse5 (<= .cse13 c_main_~y~0)) (.cse10 (div (+ c_main_~y~0 .cse12 (- 2)) 4294967296))) (let ((.cse3 (+ .cse9 (* 4294967296 .cse10) 2)) (.cse0 (+ c_main_~x~0 3)) (.cse2 (or .cse4 .cse5)) (.cse6 (and .cse7 .cse8)) (.cse1 (+ .cse9 (* 4294967296 .cse11)))) (and (<= 0 .cse0) (or (and (<= .cse1 c_main_~y~0) .cse2) (and (or (< .cse3 c_main_~y~0) .cse4 .cse5) (or .cse6 (< .cse1 c_main_~y~0))) (and (<= .cse3 c_main_~y~0) .cse7 .cse8)) (or (and (<= c_main_~y~0 (+ .cse9 3)) .cse7 .cse8) (and (<= c_main_~y~0 (+ .cse9 1)) .cse2)) (or .cse4 (not (= .cse3 c_main_~y~0)) .cse5) (<= .cse0 0) (or (and .cse7 .cse8 (<= 0 .cse10)) (and (<= 0 .cse11) .cse2)) (or .cse6 (not (= .cse1 c_main_~y~0))))))))) is different from false [2018-11-28 12:27:22,466 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)) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-11-28 12:27:32,555 WARN L180 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 54 DAG size of output: 18 [2018-11-28 12:27:34,566 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-11-28 12:27:36,587 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-11-28 12:27:42,766 WARN L180 SmtUtils]: Spent 6.14 s on a formula simplification. DAG size of input: 170 DAG size of output: 21 [2018-11-28 12:27:42,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2018-11-28 12:27:42,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:27:42,785 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_44c7a51a-57bc-480c-b676-791c933301ea/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-11-28 12:27:42,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:42,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:42,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:27:42,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:27:42,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:27:42,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 16 [2018-11-28 12:27:42,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-28 12:27:42,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-28 12:27:42,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=110, Unknown=7, NotChecked=92, Total=240 [2018-11-28 12:27:42,985 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 16 states. [2018-11-28 12:27:45,052 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse14 (div c_main_~y~0 2))) (let ((.cse9 (* 2 .cse14))) (let ((.cse13 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse4 (= c_main_~y~0 .cse9)) (.cse12 (* (- 2) .cse14))) (let ((.cse11 (div (+ c_main_~y~0 .cse12) 4294967296)) (.cse7 (not .cse4)) (.cse8 (< c_main_~y~0 .cse13)) (.cse5 (<= .cse13 c_main_~y~0)) (.cse10 (div (+ c_main_~y~0 .cse12 (- 2)) 4294967296))) (let ((.cse3 (+ .cse9 (* 4294967296 .cse10) 2)) (.cse0 (+ c_main_~x~0 3)) (.cse2 (or .cse4 .cse5)) (.cse6 (and .cse7 .cse8)) (.cse1 (+ .cse9 (* 4294967296 .cse11)))) (and (<= 0 .cse0) (or (and (<= .cse1 c_main_~y~0) .cse2) (and (or (< .cse3 c_main_~y~0) .cse4 .cse5) (or .cse6 (< .cse1 c_main_~y~0))) (and (<= .cse3 c_main_~y~0) .cse7 .cse8)) (or (and (<= c_main_~y~0 (+ .cse9 3)) .cse7 .cse8) (and (<= c_main_~y~0 (+ .cse9 1)) .cse2)) (or .cse4 (not (= .cse3 c_main_~y~0)) .cse5) (<= .cse0 0) (not (= (mod c_main_~y~0 2) 0)) (or (and .cse7 .cse8 (<= 0 .cse10)) (and (<= 0 .cse11) .cse2)) (or .cse6 (not (= .cse1 c_main_~y~0))))))))) is different from false [2018-11-28 12:27:47,067 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-11-28 12:27:59,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:59,198 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-11-28 12:27:59,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 12:27:59,198 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2018-11-28 12:27:59,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:59,199 INFO L225 Difference]: With dead ends: 62 [2018-11-28 12:27:59,199 INFO L226 Difference]: Without dead ends: 33 [2018-11-28 12:27:59,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 40.6s TimeCoverageRelationStatistics Valid=39, Invalid=132, Unknown=9, NotChecked=162, Total=342 [2018-11-28 12:27:59,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-28 12:27:59,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-28 12:27:59,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-28 12:27:59,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-28 12:27:59,201 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 21 [2018-11-28 12:27:59,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:59,202 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-11-28 12:27:59,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-28 12:27:59,202 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-28 12:27:59,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 12:27:59,202 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:59,202 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-11-28 12:27:59,202 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:59,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:59,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1061692130, now seen corresponding path program 2 times [2018-11-28 12:27:59,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:59,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:59,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:59,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:27:59,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:59,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:27:59,467 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:27:59,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:27:59,467 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_44c7a51a-57bc-480c-b676-791c933301ea/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-11-28 12:27:59,474 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 12:27:59,485 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 12:27:59,486 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:27:59,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:27:59,520 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:27:59,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:27:59,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-28 12:27:59,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-28 12:27:59,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-28 12:27:59,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2018-11-28 12:27:59,545 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 24 states. [2018-11-28 12:27:59,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:27:59,747 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-11-28 12:27:59,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-28 12:27:59,747 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 32 [2018-11-28 12:27:59,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:27:59,748 INFO L225 Difference]: With dead ends: 50 [2018-11-28 12:27:59,748 INFO L226 Difference]: Without dead ends: 45 [2018-11-28 12:27:59,748 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-11-28 12:27:59,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-28 12:27:59,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-11-28 12:27:59,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 12:27:59,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-11-28 12:27:59,751 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 32 [2018-11-28 12:27:59,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:27:59,751 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-11-28 12:27:59,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-28 12:27:59,751 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-28 12:27:59,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-28 12:27:59,752 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:27:59,752 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-11-28 12:27:59,752 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:27:59,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:27:59,752 INFO L82 PathProgramCache]: Analyzing trace with hash 263609359, now seen corresponding path program 3 times [2018-11-28 12:27:59,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:27:59,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:27:59,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:59,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:27:59,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:27:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:28:00,251 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:28:00,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:28:00,251 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_44c7a51a-57bc-480c-b676-791c933301ea/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-11-28 12:28:00,257 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 12:28:00,274 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-28 12:28:00,274 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:28:00,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:28:00,325 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:28:00,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:28:00,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-11-28 12:28:00,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-28 12:28:00,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-28 12:28:00,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2018-11-28 12:28:00,348 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 34 states. [2018-11-28 12:28:00,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:28:00,714 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-11-28 12:28:00,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-28 12:28:00,715 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 43 [2018-11-28 12:28:00,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:28:00,715 INFO L225 Difference]: With dead ends: 61 [2018-11-28 12:28:00,716 INFO L226 Difference]: Without dead ends: 56 [2018-11-28 12:28:00,716 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-11-28 12:28:00,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-28 12:28:00,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2018-11-28 12:28:00,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-28 12:28:00,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-11-28 12:28:00,721 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 43 [2018-11-28 12:28:00,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:28:00,723 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-11-28 12:28:00,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-28 12:28:00,723 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-11-28 12:28:00,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 12:28:00,724 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:28:00,724 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-11-28 12:28:00,724 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:28:00,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:28:00,724 INFO L82 PathProgramCache]: Analyzing trace with hash 915707074, now seen corresponding path program 4 times [2018-11-28 12:28:00,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:28:00,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:28:00,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:00,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:28:00,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:00,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:28:01,504 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:28:01,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:28:01,505 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_44c7a51a-57bc-480c-b676-791c933301ea/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-11-28 12:28:01,511 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 12:28:01,525 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 12:28:01,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:28:01,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:28:01,572 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:28:01,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:28:01,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2018-11-28 12:28:01,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-28 12:28:01,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-28 12:28:01,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2018-11-28 12:28:01,588 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 44 states. [2018-11-28 12:28:02,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:28:02,216 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-11-28 12:28:02,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-28 12:28:02,217 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 54 [2018-11-28 12:28:02,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:28:02,218 INFO L225 Difference]: With dead ends: 72 [2018-11-28 12:28:02,218 INFO L226 Difference]: Without dead ends: 67 [2018-11-28 12:28:02,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2018-11-28 12:28:02,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-28 12:28:02,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-11-28 12:28:02,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-28 12:28:02,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-11-28 12:28:02,224 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 54 [2018-11-28 12:28:02,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:28:02,224 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-11-28 12:28:02,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-28 12:28:02,224 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-11-28 12:28:02,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-28 12:28:02,225 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:28:02,225 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-11-28 12:28:02,225 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:28:02,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:28:02,226 INFO L82 PathProgramCache]: Analyzing trace with hash -161874385, now seen corresponding path program 5 times [2018-11-28 12:28:02,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:28:02,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:28:02,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:02,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 12:28:02,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:28:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:28:04,341 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-11-28 12:28:06,352 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-11-28 12:28:08,474 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-28 12:28:12,534 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-28 12:28:16,593 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-28 12:28:18,648 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-28 12:28:22,711 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-28 12:28:24,868 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-28 12:28:28,939 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-28 12:28:35,026 WARN L180 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-28 12:28:39,099 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-28 12:28:43,192 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-28 12:28:45,266 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-28 12:28:47,349 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-28 12:28:49,447 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-28 12:28:51,634 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-28 12:28:53,723 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-28 12:28:59,845 WARN L180 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-28 12:29:03,956 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-28 12:29:10,149 WARN L180 SmtUtils]: Spent 6.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-28 12:29:12,239 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-28 12:29:20,469 WARN L180 SmtUtils]: Spent 8.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-28 12:29:24,589 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-28 12:29:28,696 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-28 12:29:32,919 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-28 12:29:35,030 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-28 12:29:39,279 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-28 12:29:41,391 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-28 12:29:45,510 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-28 12:29:47,758 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-28 12:29:49,898 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-28 12:29:52,021 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-28 12:29:54,164 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-28 12:29:56,289 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-28 12:29:58,559 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-28 12:30:00,698 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-28 12:30:02,833 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-28 12:30:31,252 WARN L180 SmtUtils]: Spent 20.17 s on a formula simplification. DAG size of input: 120 DAG size of output: 27 [2018-11-28 12:30:45,640 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 106 refuted. 1 times theorem prover too weak. 0 trivial. 8 not checked. [2018-11-28 12:30:45,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 12:30:45,640 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_44c7a51a-57bc-480c-b676-791c933301ea/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-11-28 12:30:45,646 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 12:30:46,784 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-28 12:30:46,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 12:30:46,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:30:47,437 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 12:30:47,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 12:30:47,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 66 [2018-11-28 12:30:47,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-11-28 12:30:47,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-11-28 12:30:47,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=3896, Unknown=6, NotChecked=250, Total=4290 [2018-11-28 12:30:47,454 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 66 states. [2018-11-28 12:30:49,604 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) (<= c_main_~x~0 4) (or (and (= (+ .cse0 .cse3 2) c_main_~y~0) .cse4 .cse5) (and .cse2 (= (+ .cse0 .cse1) c_main_~y~0)))))))) is different from true [2018-11-28 12:30:50,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:30:50,676 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2018-11-28 12:30:50,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-28 12:30:50,677 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 65 [2018-11-28 12:30:50,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:30:50,677 INFO L225 Difference]: With dead ends: 80 [2018-11-28 12:30:50,677 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 12:30:50,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 165.9s TimeCoverageRelationStatistics Valid=147, Invalid=4148, Unknown=7, NotChecked=390, Total=4692 [2018-11-28 12:30:50,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 12:30:50,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 12:30:50,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 12:30:50,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 12:30:50,679 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2018-11-28 12:30:50,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:30:50,679 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 12:30:50,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-11-28 12:30:50,679 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 12:30:50,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 12:30:50,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 12:30:50,767 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 12:30:50,768 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 12:30:50,768 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 12:30:50,768 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 12:30:50,768 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 12:30:50,768 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 12:30:50,768 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 (<= .cse1 (+ main_~y~0 100)) .cse0 (<= 100 main_~x~0)) (and (<= main_~x~0 60) (<= 60 main_~x~0) .cse0) (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-11-28 12:30:50,768 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 12 33) no Hoare annotation was computed. [2018-11-28 12:30:50,768 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 9 35) no Hoare annotation was computed. [2018-11-28 12:30:50,768 INFO L448 ceAbstractionStarter]: For program point L23-1(lines 12 33) no Hoare annotation was computed. [2018-11-28 12:30:50,768 INFO L448 ceAbstractionStarter]: For program point L19-1(lines 12 33) no Hoare annotation was computed. [2018-11-28 12:30:50,768 INFO L448 ceAbstractionStarter]: For program point L15-1(lines 12 33) no Hoare annotation was computed. [2018-11-28 12:30:50,768 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-11-28 12:30:50,768 INFO L448 ceAbstractionStarter]: For program point L29-1(lines 12 33) no Hoare annotation was computed. [2018-11-28 12:30:50,768 INFO L448 ceAbstractionStarter]: For program point L25-1(lines 12 33) no Hoare annotation was computed. [2018-11-28 12:30:50,768 INFO L448 ceAbstractionStarter]: For program point L21-1(lines 12 33) no Hoare annotation was computed. [2018-11-28 12:30:50,768 INFO L448 ceAbstractionStarter]: For program point L17-1(lines 12 33) no Hoare annotation was computed. [2018-11-28 12:30:50,769 INFO L448 ceAbstractionStarter]: For program point L13(lines 13 14) no Hoare annotation was computed. [2018-11-28 12:30:50,769 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 9 35) no Hoare annotation was computed. [2018-11-28 12:30:50,769 INFO L448 ceAbstractionStarter]: For program point L13-2(lines 12 33) no Hoare annotation was computed. [2018-11-28 12:30:50,769 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 9 35) the Hoare annotation is: true [2018-11-28 12:30:50,769 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-28 12:30:50,769 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-28 12:30:50,769 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-28 12:30:50,769 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-28 12:30:50,769 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-28 12:30:50,769 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-28 12:30:50,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:30:50 BoogieIcfgContainer [2018-11-28 12:30:50,778 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 12:30:50,779 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:30:50,779 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:30:50,779 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:30:50,779 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:27:09" (3/4) ... [2018-11-28 12:30:50,782 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 12:30:50,786 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 12:30:50,786 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 12:30:50,786 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-28 12:30:50,789 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-28 12:30:50,789 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-28 12:30:50,790 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 12:30:50,823 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_44c7a51a-57bc-480c-b676-791c933301ea/bin-2019/uautomizer/witness.graphml [2018-11-28 12:30:50,824 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:30:50,824 INFO L168 Benchmark]: Toolchain (without parser) took 222250.99 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 234.9 MB). Free memory was 955.3 MB in the beginning and 981.1 MB in the end (delta: -25.8 MB). Peak memory consumption was 209.1 MB. Max. memory is 11.5 GB. [2018-11-28 12:30:50,825 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:30:50,825 INFO L168 Benchmark]: CACSL2BoogieTranslator took 151.24 ms. Allocated memory is still 1.0 GB. Free memory was 955.3 MB in the beginning and 944.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:30:50,826 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.91 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:30:50,826 INFO L168 Benchmark]: Boogie Preprocessor took 15.75 ms. Allocated memory is still 1.0 GB. Free memory was 944.6 MB in the beginning and 939.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 12:30:50,826 INFO L168 Benchmark]: RCFGBuilder took 246.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -165.1 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2018-11-28 12:30:50,827 INFO L168 Benchmark]: TraceAbstraction took 221772.95 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 109.6 MB). Free memory was 1.1 GB in the beginning and 989.9 MB in the end (delta: 114.5 MB). Peak memory consumption was 224.1 MB. Max. memory is 11.5 GB. [2018-11-28 12:30:50,827 INFO L168 Benchmark]: Witness Printer took 45.15 ms. Allocated memory is still 1.3 GB. Free memory was 989.9 MB in the beginning and 981.1 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. [2018-11-28 12:30:50,829 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 151.24 ms. Allocated memory is still 1.0 GB. Free memory was 955.3 MB in the beginning and 944.6 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 15.91 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.75 ms. Allocated memory is still 1.0 GB. Free memory was 944.6 MB in the beginning and 939.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 246.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -165.1 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 221772.95 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 109.6 MB). Free memory was 1.1 GB in the beginning and 989.9 MB in the end (delta: 114.5 MB). Peak memory consumption was 224.1 MB. Max. memory is 11.5 GB. * Witness Printer took 45.15 ms. Allocated memory is still 1.3 GB. Free memory was 989.9 MB in the beginning and 981.1 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. 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)) || ((2 * (y / 2) + x + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) <= y + 100 && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) && 100 <= x)) || ((x <= 60 && 60 <= x) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y)) || ((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, 221.7s OverallTime, 13 OverallIterations, 5 TraceHistogramMax, 21.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 269 SDtfs, 35 SDslu, 1194 SDs, 0 SdLazy, 7286 SolverSat, 129 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 447 GetRequests, 229 SyntacticMatches, 20 SemanticMatches, 198 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 216.4s 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, 198.7s InterpolantComputationTime, 597 NumberOfCodeBlocks, 597 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 578 ConstructedInterpolants, 0 QuantifiedInterpolants, 450112 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...