./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/loop-acceleration/diamond_true-unreach-call2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_38906e70-58fd-4ff9-87c1-7e4f6e5ae349/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_38906e70-58fd-4ff9-87c1-7e4f6e5ae349/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_38906e70-58fd-4ff9-87c1-7e4f6e5ae349/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_38906e70-58fd-4ff9-87c1-7e4f6e5ae349/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_38906e70-58fd-4ff9-87c1-7e4f6e5ae349/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_38906e70-58fd-4ff9-87c1-7e4f6e5ae349/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-1dbac8b [2018-11-10 12:04:11,308 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:04:11,309 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:04:11,318 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:04:11,318 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:04:11,319 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:04:11,320 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:04:11,321 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:04:11,322 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:04:11,323 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:04:11,324 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:04:11,324 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:04:11,325 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:04:11,325 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:04:11,326 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:04:11,327 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:04:11,327 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:04:11,328 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:04:11,330 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:04:11,331 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:04:11,332 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:04:11,332 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:04:11,334 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:04:11,334 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:04:11,334 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:04:11,335 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:04:11,336 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:04:11,336 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:04:11,337 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:04:11,338 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:04:11,338 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:04:11,339 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:04:11,339 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:04:11,339 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:04:11,340 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:04:11,340 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:04:11,340 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_38906e70-58fd-4ff9-87c1-7e4f6e5ae349/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 12:04:11,350 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:04:11,351 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:04:11,351 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 12:04:11,351 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 12:04:11,352 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:04:11,352 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:04:11,352 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:04:11,353 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:04:11,353 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 12:04:11,353 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:04:11,353 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 12:04:11,353 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:04:11,353 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 12:04:11,353 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 12:04:11,354 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 12:04:11,354 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 12:04:11,354 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:04:11,354 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 12:04:11,354 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:04:11,354 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:04:11,355 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 12:04:11,355 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 12:04:11,355 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 12:04:11,355 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:04:11,355 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 12:04:11,355 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 12:04:11,355 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 12:04:11,356 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 12:04:11,356 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 12:04:11,356 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_38906e70-58fd-4ff9-87c1-7e4f6e5ae349/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-10 12:04:11,382 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:04:11,392 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:04:11,394 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:04:11,395 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:04:11,396 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:04:11,396 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_38906e70-58fd-4ff9-87c1-7e4f6e5ae349/bin-2019/uautomizer/../../sv-benchmarks/c/loop-acceleration/diamond_true-unreach-call2.i [2018-11-10 12:04:11,435 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_38906e70-58fd-4ff9-87c1-7e4f6e5ae349/bin-2019/uautomizer/data/4d3b7fbb9/d8d0d84db7cd4fa697adfc4caf91fe11/FLAG875041224 [2018-11-10 12:04:11,853 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:04:11,854 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_38906e70-58fd-4ff9-87c1-7e4f6e5ae349/sv-benchmarks/c/loop-acceleration/diamond_true-unreach-call2.i [2018-11-10 12:04:11,859 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_38906e70-58fd-4ff9-87c1-7e4f6e5ae349/bin-2019/uautomizer/data/4d3b7fbb9/d8d0d84db7cd4fa697adfc4caf91fe11/FLAG875041224 [2018-11-10 12:04:11,870 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_38906e70-58fd-4ff9-87c1-7e4f6e5ae349/bin-2019/uautomizer/data/4d3b7fbb9/d8d0d84db7cd4fa697adfc4caf91fe11 [2018-11-10 12:04:11,873 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:04:11,874 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 12:04:11,874 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:04:11,874 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:04:11,877 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:04:11,878 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:04:11" (1/1) ... [2018-11-10 12:04:11,880 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc2202b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:04:11, skipping insertion in model container [2018-11-10 12:04:11,880 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:04:11" (1/1) ... [2018-11-10 12:04:11,888 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:04:11,904 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:04:12,016 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:04:12,019 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:04:12,031 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:04:12,039 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:04:12,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:04:12 WrapperNode [2018-11-10 12:04:12,040 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:04:12,040 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:04:12,040 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:04:12,040 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:04:12,048 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:04:12" (1/1) ... [2018-11-10 12:04:12,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:04:12" (1/1) ... [2018-11-10 12:04:12,051 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:04:12" (1/1) ... [2018-11-10 12:04:12,051 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:04:12" (1/1) ... [2018-11-10 12:04:12,053 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:04:12" (1/1) ... [2018-11-10 12:04:12,056 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:04:12" (1/1) ... [2018-11-10 12:04:12,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:04:12" (1/1) ... [2018-11-10 12:04:12,058 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:04:12,058 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:04:12,058 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:04:12,058 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:04:12,059 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:04:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38906e70-58fd-4ff9-87c1-7e4f6e5ae349/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-10 12:04:12,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 12:04:12,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:04:12,132 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-10 12:04:12,132 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 12:04:12,132 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 12:04:12,132 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2018-11-10 12:04:12,132 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 12:04:12,132 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 12:04:12,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 12:04:12,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:04:12,270 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:04:12,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:04:12 BoogieIcfgContainer [2018-11-10 12:04:12,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:04:12,271 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 12:04:12,271 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 12:04:12,273 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 12:04:12,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:04:11" (1/3) ... [2018-11-10 12:04:12,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589cb8b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:04:12, skipping insertion in model container [2018-11-10 12:04:12,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:04:12" (2/3) ... [2018-11-10 12:04:12,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589cb8b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:04:12, skipping insertion in model container [2018-11-10 12:04:12,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:04:12" (3/3) ... [2018-11-10 12:04:12,275 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_true-unreach-call2.i [2018-11-10 12:04:12,281 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 12:04:12,286 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 12:04:12,294 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 12:04:12,313 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:04:12,313 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 12:04:12,313 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 12:04:12,313 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 12:04:12,313 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:04:12,314 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:04:12,314 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 12:04:12,314 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:04:12,314 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 12:04:12,324 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-11-10 12:04:12,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-10 12:04:12,327 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:04:12,328 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:04:12,330 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:04:12,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:04:12,333 INFO L82 PathProgramCache]: Analyzing trace with hash 46027330, now seen corresponding path program 1 times [2018-11-10 12:04:12,334 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:04:12,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:04:12,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:04:12,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:04:12,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:04:12,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:04:12,397 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-10 12:04:12,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:04:12,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 12:04:12,401 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 12:04:12,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 12:04:12,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 12:04:12,410 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-11-10 12:04:12,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:04:12,424 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2018-11-10 12:04:12,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 12:04:12,426 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-10 12:04:12,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:04:12,432 INFO L225 Difference]: With dead ends: 39 [2018-11-10 12:04:12,432 INFO L226 Difference]: Without dead ends: 22 [2018-11-10 12:04:12,434 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 12:04:12,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-10 12:04:12,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-10 12:04:12,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-10 12:04:12,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2018-11-10 12:04:12,455 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 10 [2018-11-10 12:04:12,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:04:12,456 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2018-11-10 12:04:12,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 12:04:12,456 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2018-11-10 12:04:12,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-10 12:04:12,456 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:04:12,456 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:04:12,457 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:04:12,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:04:12,457 INFO L82 PathProgramCache]: Analyzing trace with hash -596143276, now seen corresponding path program 1 times [2018-11-10 12:04:12,457 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:04:12,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:04:12,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:04:12,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:04:12,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:04:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:04:12,511 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-10 12:04:12,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:04:12,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:04:12,513 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:04:12,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:04:12,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:04:12,513 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 3 states. [2018-11-10 12:04:12,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:04:12,587 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2018-11-10 12:04:12,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:04:12,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-10 12:04:12,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:04:12,588 INFO L225 Difference]: With dead ends: 30 [2018-11-10 12:04:12,589 INFO L226 Difference]: Without dead ends: 25 [2018-11-10 12:04:12,589 INFO L605 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-10 12:04:12,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-10 12:04:12,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-11-10 12:04:12,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-10 12:04:12,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-11-10 12:04:12,593 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 11 [2018-11-10 12:04:12,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:04:12,594 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-11-10 12:04:12,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:04:12,594 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-11-10 12:04:12,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 12:04:12,594 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:04:12,594 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:04:12,595 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:04:12,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:04:12,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1592807782, now seen corresponding path program 1 times [2018-11-10 12:04:12,596 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:04:12,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:04:12,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:04:12,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:04:12,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:04:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:04:14,672 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 27 DAG size of output: 12 [2018-11-10 12:04:14,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:04:14,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:04:14,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:04:14,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:04:14,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:04:14,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:04:14,676 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 3 states. [2018-11-10 12:04:14,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:04:14,794 INFO L93 Difference]: Finished difference Result 54 states and 85 transitions. [2018-11-10 12:04:14,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:04:14,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 12:04:14,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:04:14,797 INFO L225 Difference]: With dead ends: 54 [2018-11-10 12:04:14,797 INFO L226 Difference]: Without dead ends: 37 [2018-11-10 12:04:14,797 INFO L605 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-10 12:04:14,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-10 12:04:14,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-10 12:04:14,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-10 12:04:14,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2018-11-10 12:04:14,803 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 23 [2018-11-10 12:04:14,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:04:14,803 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2018-11-10 12:04:14,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:04:14,804 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2018-11-10 12:04:14,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 12:04:14,804 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:04:14,804 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:04:14,805 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:04:14,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:04:14,805 INFO L82 PathProgramCache]: Analyzing trace with hash 2001094936, now seen corresponding path program 1 times [2018-11-10 12:04:14,805 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:04:14,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:04:14,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:04:14,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:04:14,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:04:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:04:14,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:04:14,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:04:14,983 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38906e70-58fd-4ff9-87c1-7e4f6e5ae349/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-10 12:04:14,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:04:15,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:04:15,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:04:15,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:04:15,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:04:15,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-11-10 12:04:15,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 12:04:15,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 12:04:15,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-10 12:04:15,073 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand 13 states. [2018-11-10 12:04:15,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:04:15,222 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2018-11-10 12:04:15,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 12:04:15,224 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-11-10 12:04:15,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:04:15,224 INFO L225 Difference]: With dead ends: 54 [2018-11-10 12:04:15,225 INFO L226 Difference]: Without dead ends: 49 [2018-11-10 12:04:15,225 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-10 12:04:15,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-10 12:04:15,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-11-10 12:04:15,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-10 12:04:15,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2018-11-10 12:04:15,231 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 23 [2018-11-10 12:04:15,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:04:15,231 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2018-11-10 12:04:15,231 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 12:04:15,231 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2018-11-10 12:04:15,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 12:04:15,232 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:04:15,232 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:04:15,232 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:04:15,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:04:15,233 INFO L82 PathProgramCache]: Analyzing trace with hash 980026582, now seen corresponding path program 1 times [2018-11-10 12:04:15,233 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:04:15,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:04:15,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:04:15,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:04:15,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:04:15,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:04:15,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:04:15,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:04:15,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 12:04:15,261 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 12:04:15,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 12:04:15,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 12:04:15,261 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand 3 states. [2018-11-10 12:04:15,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:04:15,308 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2018-11-10 12:04:15,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 12:04:15,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 12:04:15,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:04:15,309 INFO L225 Difference]: With dead ends: 66 [2018-11-10 12:04:15,310 INFO L226 Difference]: Without dead ends: 49 [2018-11-10 12:04:15,310 INFO L605 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-10 12:04:15,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-10 12:04:15,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-11-10 12:04:15,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-10 12:04:15,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-11-10 12:04:15,315 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 23 [2018-11-10 12:04:15,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:04:15,315 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-11-10 12:04:15,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 12:04:15,315 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-11-10 12:04:15,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 12:04:15,316 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:04:15,316 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:04:15,316 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:04:15,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:04:15,317 INFO L82 PathProgramCache]: Analyzing trace with hash 314161752, now seen corresponding path program 1 times [2018-11-10 12:04:15,317 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:04:15,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:04:15,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:04:15,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:04:15,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:04:15,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:04:23,522 WARN L179 SmtUtils]: Spent 6.06 s on a formula simplification. DAG size of input: 59 DAG size of output: 20 [2018-11-10 12:04:25,533 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-10 12:04:31,615 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 54 DAG size of output: 18 [2018-11-10 12:04:33,626 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-10 12:04:45,719 WARN L179 SmtUtils]: Spent 8.06 s on a formula simplification. DAG size of input: 56 DAG size of output: 20 [2018-11-10 12:04:47,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:04:47,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:04:47,768 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38906e70-58fd-4ff9-87c1-7e4f6e5ae349/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-10 12:04:47,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:04:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:04:47,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:04:47,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:04:47,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:04:47,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 14 [2018-11-10 12:04:47,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 12:04:47,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 12:04:47,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=106, Unknown=7, NotChecked=42, Total=182 [2018-11-10 12:04:47,974 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 14 states. [2018-11-10 12:05:00,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:05:00,149 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-11-10 12:05:00,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 12:05:00,149 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-11-10 12:05:00,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:05:00,150 INFO L225 Difference]: With dead ends: 67 [2018-11-10 12:05:00,150 INFO L226 Difference]: Without dead ends: 36 [2018-11-10 12:05:00,150 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 10 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 44.5s TimeCoverageRelationStatistics Valid=31, Invalid=126, Unknown=7, NotChecked=46, Total=210 [2018-11-10 12:05:00,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-10 12:05:00,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-10 12:05:00,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-10 12:05:00,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-11-10 12:05:00,153 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 23 [2018-11-10 12:05:00,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:05:00,153 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-11-10 12:05:00,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 12:05:00,153 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-10 12:05:00,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-10 12:05:00,153 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:05:00,153 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:05:00,154 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:05:00,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:05:00,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1929479972, now seen corresponding path program 2 times [2018-11-10 12:05:00,154 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:05:00,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:05:00,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:05:00,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:05:00,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:05:00,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:05:00,438 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:05:00,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:05:00,439 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38906e70-58fd-4ff9-87c1-7e4f6e5ae349/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-10 12:05:00,462 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 12:05:00,478 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 12:05:00,478 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:05:00,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:05:00,506 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:05:00,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:05:00,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-11-10 12:05:00,522 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-10 12:05:00,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-10 12:05:00,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-11-10 12:05:00,523 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 23 states. [2018-11-10 12:05:00,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:05:00,707 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-11-10 12:05:00,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-10 12:05:00,707 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 35 [2018-11-10 12:05:00,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:05:00,708 INFO L225 Difference]: With dead ends: 54 [2018-11-10 12:05:00,708 INFO L226 Difference]: Without dead ends: 49 [2018-11-10 12:05:00,708 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-11-10 12:05:00,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-10 12:05:00,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-11-10 12:05:00,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-10 12:05:00,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-11-10 12:05:00,712 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 35 [2018-11-10 12:05:00,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:05:00,712 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-11-10 12:05:00,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-10 12:05:00,712 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-11-10 12:05:00,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-10 12:05:00,713 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:05:00,713 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:05:00,713 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:05:00,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:05:00,713 INFO L82 PathProgramCache]: Analyzing trace with hash 2033787552, now seen corresponding path program 3 times [2018-11-10 12:05:00,714 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:05:00,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:05:00,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:05:00,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:05:00,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:05:00,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:05:01,140 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:05:01,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:05:01,141 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38906e70-58fd-4ff9-87c1-7e4f6e5ae349/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-10 12:05:01,148 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 12:05:01,172 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-10 12:05:01,172 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:05:01,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:05:01,186 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:05:01,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:05:01,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-11-10 12:05:01,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-10 12:05:01,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-10 12:05:01,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-11-10 12:05:01,203 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 33 states. [2018-11-10 12:05:01,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:05:01,615 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-11-10 12:05:01,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-10 12:05:01,615 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 47 [2018-11-10 12:05:01,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:05:01,615 INFO L225 Difference]: With dead ends: 66 [2018-11-10 12:05:01,615 INFO L226 Difference]: Without dead ends: 61 [2018-11-10 12:05:01,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-11-10 12:05:01,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-10 12:05:01,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-11-10 12:05:01,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-10 12:05:01,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-11-10 12:05:01,620 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 47 [2018-11-10 12:05:01,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:05:01,621 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-11-10 12:05:01,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-10 12:05:01,621 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-11-10 12:05:01,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-10 12:05:01,622 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:05:01,622 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:05:01,622 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:05:01,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:05:01,624 INFO L82 PathProgramCache]: Analyzing trace with hash -99662236, now seen corresponding path program 4 times [2018-11-10 12:05:01,625 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:05:01,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:05:01,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:05:01,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:05:01,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:05:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:05:02,443 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:05:02,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:05:02,443 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38906e70-58fd-4ff9-87c1-7e4f6e5ae349/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-10 12:05:02,448 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 12:05:02,471 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 12:05:02,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:05:02,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:05:02,506 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:05:02,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:05:02,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-11-10 12:05:02,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-10 12:05:02,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-10 12:05:02,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-11-10 12:05:02,536 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 43 states. [2018-11-10 12:05:03,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:05:03,244 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-11-10 12:05:03,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-10 12:05:03,245 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 59 [2018-11-10 12:05:03,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:05:03,246 INFO L225 Difference]: With dead ends: 78 [2018-11-10 12:05:03,246 INFO L226 Difference]: Without dead ends: 73 [2018-11-10 12:05:03,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-11-10 12:05:03,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-10 12:05:03,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-11-10 12:05:03,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-10 12:05:03,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-11-10 12:05:03,253 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 59 [2018-11-10 12:05:03,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:05:03,253 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-11-10 12:05:03,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-10 12:05:03,253 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-11-10 12:05:03,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-10 12:05:03,254 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 12:05:03,254 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:05:03,254 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 12:05:03,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:05:03,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1880745000, now seen corresponding path program 5 times [2018-11-10 12:05:03,255 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:05:03,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:05:03,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:05:03,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:05:03,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:05:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:05:05,479 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 12:05:07,521 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 12:05:11,597 WARN L179 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 12:05:13,669 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 12:05:17,724 WARN L179 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 12:05:21,825 WARN L179 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 12:05:23,873 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 12:05:25,969 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 12:05:28,026 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 12:05:32,158 WARN L179 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 12:05:36,298 WARN L179 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 12:05:38,386 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 12:05:40,542 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 12:05:42,785 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 12:05:44,933 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 12:05:49,017 WARN L179 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 12:05:53,195 WARN L179 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 12:05:55,319 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 12:05:57,403 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 12:06:01,496 WARN L179 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 12:06:03,678 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 12:06:05,778 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 12:06:07,878 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 12:06:10,062 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 12:06:14,190 WARN L179 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 12:06:18,305 WARN L179 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 12:06:20,417 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 12:06:22,531 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 12:06:26,655 WARN L179 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 12:06:30,768 WARN L179 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 12:06:34,887 WARN L179 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 12:06:37,030 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 12:06:41,400 WARN L179 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-11-10 12:06:41,610 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:06:41,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:06:41,610 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_38906e70-58fd-4ff9-87c1-7e4f6e5ae349/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-10 12:06:41,616 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 12:06:41,850 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-10 12:06:41,850 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:06:41,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:06:42,400 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:06:42,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 12:06:42,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 64 [2018-11-10 12:06:42,417 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-11-10 12:06:42,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-11-10 12:06:42,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=3898, Unknown=0, NotChecked=0, Total=4032 [2018-11-10 12:06:42,418 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 64 states. [2018-11-10 12:06:43,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:06:43,825 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2018-11-10 12:06:43,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-10 12:06:43,825 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 71 [2018-11-10 12:06:43,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 12:06:43,825 INFO L225 Difference]: With dead ends: 87 [2018-11-10 12:06:43,825 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 12:06:43,826 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 98.7s TimeCoverageRelationStatistics Valid=138, Invalid=4022, Unknown=0, NotChecked=0, Total=4160 [2018-11-10 12:06:43,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 12:06:43,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 12:06:43,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 12:06:43,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 12:06:43,827 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 71 [2018-11-10 12:06:43,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 12:06:43,827 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:06:43,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-11-10 12:06:43,827 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 12:06:43,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 12:06:43,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 12:06:43,935 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 12:06:43,935 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 12:06:43,935 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 12:06:43,935 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 12:06:43,935 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 12:06:43,935 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 12:06:43,936 INFO L421 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) (and (<= .cse1 (+ main_~y~0 40)) .cse0 (<= 40 main_~x~0)) (let ((.cse2 (+ main_~x~0 5))) (and (<= 0 .cse2) (<= .cse2 0) (<= (+ .cse3 .cse4 1) main_~y~0))) (and (<= 80 main_~x~0) (<= main_~x~0 80) .cse0))))) [2018-11-10 12:06:43,936 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 12 33) no Hoare annotation was computed. [2018-11-10 12:06:43,936 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 9 35) no Hoare annotation was computed. [2018-11-10 12:06:43,936 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 12 33) no Hoare annotation was computed. [2018-11-10 12:06:43,936 INFO L425 ceAbstractionStarter]: For program point L19-1(lines 12 33) no Hoare annotation was computed. [2018-11-10 12:06:43,936 INFO L425 ceAbstractionStarter]: For program point L15-1(lines 12 33) no Hoare annotation was computed. [2018-11-10 12:06:43,936 INFO L425 ceAbstractionStarter]: For program point L12-1(lines 12 33) no Hoare annotation was computed. [2018-11-10 12:06:43,936 INFO L421 ceAbstractionStarter]: At program point L12-3(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-10 12:06:43,936 INFO L425 ceAbstractionStarter]: For program point L29-1(lines 12 33) no Hoare annotation was computed. [2018-11-10 12:06:43,936 INFO L425 ceAbstractionStarter]: For program point L25-1(lines 12 33) no Hoare annotation was computed. [2018-11-10 12:06:43,936 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 12 33) no Hoare annotation was computed. [2018-11-10 12:06:43,936 INFO L425 ceAbstractionStarter]: For program point L17-1(lines 12 33) no Hoare annotation was computed. [2018-11-10 12:06:43,937 INFO L425 ceAbstractionStarter]: For program point L13(lines 13 14) no Hoare annotation was computed. [2018-11-10 12:06:43,937 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 9 35) no Hoare annotation was computed. [2018-11-10 12:06:43,937 INFO L425 ceAbstractionStarter]: For program point L13-2(lines 12 33) no Hoare annotation was computed. [2018-11-10 12:06:43,937 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 9 35) the Hoare annotation is: true [2018-11-10 12:06:43,937 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-10 12:06:43,937 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-10 12:06:43,937 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-10 12:06:43,937 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-10 12:06:43,937 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-10 12:06:43,937 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-10 12:06:43,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 12:06:43 BoogieIcfgContainer [2018-11-10 12:06:43,949 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 12:06:43,949 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:06:43,949 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:06:43,949 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:06:43,950 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:04:12" (3/4) ... [2018-11-10 12:06:43,953 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 12:06:43,958 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 12:06:43,959 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 12:06:43,959 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-10 12:06:43,962 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-11-10 12:06:43,962 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 12:06:43,963 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 12:06:43,997 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_38906e70-58fd-4ff9-87c1-7e4f6e5ae349/bin-2019/uautomizer/witness.graphml [2018-11-10 12:06:43,997 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:06:43,998 INFO L168 Benchmark]: Toolchain (without parser) took 152124.94 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 224.9 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -107.4 MB). Peak memory consumption was 117.5 MB. Max. memory is 11.5 GB. [2018-11-10 12:06:43,998 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:06:43,999 INFO L168 Benchmark]: CACSL2BoogieTranslator took 165.73 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:06:43,999 INFO L168 Benchmark]: Boogie Preprocessor took 17.60 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:06:43,999 INFO L168 Benchmark]: RCFGBuilder took 212.74 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -149.4 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2018-11-10 12:06:44,000 INFO L168 Benchmark]: TraceAbstraction took 151677.70 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 112.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.6 MB). Peak memory consumption was 131.8 MB. Max. memory is 11.5 GB. [2018-11-10 12:06:44,000 INFO L168 Benchmark]: Witness Printer took 48.04 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. [2018-11-10 12:06:44,002 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 165.73 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.60 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 212.74 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -149.4 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 151677.70 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 112.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.6 MB). Peak memory consumption was 131.8 MB. Max. memory is 11.5 GB. * Witness Printer took 48.04 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 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)) || ((2 * (y / 2) + x + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) <= y + 40 && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) && 40 <= x)) || ((0 <= x + 5 && x + 5 <= 0) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) + 1 <= y)) || ((80 <= x && x <= 80) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 28 locations, 1 error locations. SAFE Result, 151.6s OverallTime, 10 OverallIterations, 6 TraceHistogramMax, 15.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 211 SDtfs, 27 SDslu, 2012 SDs, 0 SdLazy, 7604 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 456 GetRequests, 250 SyntacticMatches, 23 SemanticMatches, 183 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 146.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=9, 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, 10 MinimizatonAttempts, 7 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 18 PreInvPairs, 27 NumberOfFragments, 289 HoareAnnotationTreeSize, 18 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 184 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 135.3s InterpolantComputationTime, 583 NumberOfCodeBlocks, 583 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 567 ConstructedInterpolants, 0 QuantifiedInterpolants, 469363 SizeOfPredicates, 8 NumberOfNonLiveVariables, 812 ConjunctsInSsa, 350 ConjunctsInUnsatCore, 16 InterpolantComputations, 4 PerfectInterpolantSequences, 4/548 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...