./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c --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_ec8a0596-9c49-4dee-bffd-0bd03e721988/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ec8a0596-9c49-4dee-bffd-0bd03e721988/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ec8a0596-9c49-4dee-bffd-0bd03e721988/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ec8a0596-9c49-4dee-bffd-0bd03e721988/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_ec8a0596-9c49-4dee-bffd-0bd03e721988/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ec8a0596-9c49-4dee-bffd-0bd03e721988/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 45f0d0ab6d17adbe7cd7f36bcd9ec097795f4c36 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 09:31:48,863 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 09:31:48,864 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 09:31:48,871 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 09:31:48,871 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 09:31:48,872 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 09:31:48,872 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 09:31:48,873 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 09:31:48,875 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 09:31:48,875 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 09:31:48,876 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 09:31:48,876 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 09:31:48,877 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 09:31:48,877 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 09:31:48,878 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 09:31:48,879 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 09:31:48,879 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 09:31:48,881 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 09:31:48,882 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 09:31:48,883 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 09:31:48,884 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 09:31:48,884 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 09:31:48,886 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 09:31:48,886 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 09:31:48,886 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 09:31:48,887 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 09:31:48,888 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 09:31:48,888 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 09:31:48,889 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 09:31:48,890 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 09:31:48,890 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 09:31:48,890 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 09:31:48,890 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 09:31:48,891 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 09:31:48,891 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 09:31:48,892 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 09:31:48,892 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ec8a0596-9c49-4dee-bffd-0bd03e721988/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 09:31:48,902 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 09:31:48,902 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 09:31:48,903 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 09:31:48,903 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 09:31:48,903 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 09:31:48,904 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 09:31:48,904 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 09:31:48,904 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 09:31:48,904 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 09:31:48,904 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 09:31:48,904 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 09:31:48,904 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 09:31:48,905 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 09:31:48,905 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 09:31:48,905 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 09:31:48,905 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 09:31:48,905 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 09:31:48,905 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 09:31:48,905 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 09:31:48,906 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 09:31:48,906 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 09:31:48,906 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 09:31:48,906 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 09:31:48,906 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 09:31:48,906 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 09:31:48,906 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 09:31:48,906 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 09:31:48,907 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 09:31:48,907 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 09:31:48,907 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_ec8a0596-9c49-4dee-bffd-0bd03e721988/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 -> 45f0d0ab6d17adbe7cd7f36bcd9ec097795f4c36 [2018-11-10 09:31:48,933 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 09:31:48,942 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 09:31:48,945 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 09:31:48,946 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 09:31:48,946 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 09:31:48,947 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ec8a0596-9c49-4dee-bffd-0bd03e721988/bin-2019/uautomizer/../../sv-benchmarks/c/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-11-10 09:31:48,991 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ec8a0596-9c49-4dee-bffd-0bd03e721988/bin-2019/uautomizer/data/402c2b692/db704ff054684a27b891656ba0a86d64/FLAGd4e007d08 [2018-11-10 09:31:49,334 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 09:31:49,334 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ec8a0596-9c49-4dee-bffd-0bd03e721988/sv-benchmarks/c/psyco/psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-11-10 09:31:49,342 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ec8a0596-9c49-4dee-bffd-0bd03e721988/bin-2019/uautomizer/data/402c2b692/db704ff054684a27b891656ba0a86d64/FLAGd4e007d08 [2018-11-10 09:31:49,352 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ec8a0596-9c49-4dee-bffd-0bd03e721988/bin-2019/uautomizer/data/402c2b692/db704ff054684a27b891656ba0a86d64 [2018-11-10 09:31:49,355 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 09:31:49,356 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 09:31:49,357 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 09:31:49,357 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 09:31:49,360 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 09:31:49,360 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:31:49" (1/1) ... [2018-11-10 09:31:49,362 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b52ffc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:31:49, skipping insertion in model container [2018-11-10 09:31:49,363 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:31:49" (1/1) ... [2018-11-10 09:31:49,370 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 09:31:49,398 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 09:31:49,578 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:31:49,581 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 09:31:49,631 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:31:49,643 INFO L193 MainTranslator]: Completed translation [2018-11-10 09:31:49,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:31:49 WrapperNode [2018-11-10 09:31:49,643 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 09:31:49,644 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 09:31:49,644 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 09:31:49,644 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 09:31:49,653 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:31:49" (1/1) ... [2018-11-10 09:31:49,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:31:49" (1/1) ... [2018-11-10 09:31:49,660 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:31:49" (1/1) ... [2018-11-10 09:31:49,660 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:31:49" (1/1) ... [2018-11-10 09:31:49,672 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:31:49" (1/1) ... [2018-11-10 09:31:49,721 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:31:49" (1/1) ... [2018-11-10 09:31:49,723 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:31:49" (1/1) ... [2018-11-10 09:31:49,725 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 09:31:49,726 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 09:31:49,726 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 09:31:49,726 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 09:31:49,727 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:31:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec8a0596-9c49-4dee-bffd-0bd03e721988/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 09:31:49,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 09:31:49,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 09:31:49,774 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 09:31:49,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 09:31:49,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 09:31:49,774 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 09:31:49,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 09:31:49,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 09:31:50,356 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 09:31:50,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:31:50 BoogieIcfgContainer [2018-11-10 09:31:50,357 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 09:31:50,358 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 09:31:50,358 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 09:31:50,360 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 09:31:50,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:31:49" (1/3) ... [2018-11-10 09:31:50,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61fceab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:31:50, skipping insertion in model container [2018-11-10 09:31:50,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:31:49" (2/3) ... [2018-11-10 09:31:50,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61fceab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:31:50, skipping insertion in model container [2018-11-10 09:31:50,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:31:50" (3/3) ... [2018-11-10 09:31:50,362 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_abp_1_true-unreach-call_false-termination_true-no-overflow.c [2018-11-10 09:31:50,368 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 09:31:50,373 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 09:31:50,382 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 09:31:50,403 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 09:31:50,404 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 09:31:50,404 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 09:31:50,404 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 09:31:50,404 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 09:31:50,404 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 09:31:50,404 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 09:31:50,404 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 09:31:50,404 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 09:31:50,417 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states. [2018-11-10 09:31:50,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 09:31:50,422 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:31:50,423 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:31:50,424 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:31:50,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:31:50,428 INFO L82 PathProgramCache]: Analyzing trace with hash -784715869, now seen corresponding path program 1 times [2018-11-10 09:31:50,429 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:31:50,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:31:50,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:50,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:31:50,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:50,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:31:50,523 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 09:31:50,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:31:50,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 09:31:50,529 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 09:31:50,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 09:31:50,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 09:31:50,542 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 2 states. [2018-11-10 09:31:50,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:31:50,567 INFO L93 Difference]: Finished difference Result 222 states and 422 transitions. [2018-11-10 09:31:50,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 09:31:50,568 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-10 09:31:50,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:31:50,576 INFO L225 Difference]: With dead ends: 222 [2018-11-10 09:31:50,576 INFO L226 Difference]: Without dead ends: 104 [2018-11-10 09:31:50,578 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 09:31:50,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-10 09:31:50,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-11-10 09:31:50,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-10 09:31:50,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 169 transitions. [2018-11-10 09:31:50,604 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 169 transitions. Word has length 13 [2018-11-10 09:31:50,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:31:50,605 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 169 transitions. [2018-11-10 09:31:50,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 09:31:50,605 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 169 transitions. [2018-11-10 09:31:50,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 09:31:50,605 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:31:50,605 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:31:50,606 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:31:50,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:31:50,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1976099357, now seen corresponding path program 1 times [2018-11-10 09:31:50,606 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:31:50,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:31:50,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:50,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:31:50,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:50,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:31:50,642 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 09:31:50,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:31:50,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:31:50,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:31:50,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:31:50,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:31:50,645 INFO L87 Difference]: Start difference. First operand 104 states and 169 transitions. Second operand 3 states. [2018-11-10 09:31:50,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:31:50,710 INFO L93 Difference]: Finished difference Result 205 states and 336 transitions. [2018-11-10 09:31:50,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:31:50,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-10 09:31:50,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:31:50,711 INFO L225 Difference]: With dead ends: 205 [2018-11-10 09:31:50,711 INFO L226 Difference]: Without dead ends: 107 [2018-11-10 09:31:50,712 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 09:31:50,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-10 09:31:50,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-11-10 09:31:50,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-10 09:31:50,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 172 transitions. [2018-11-10 09:31:50,720 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 172 transitions. Word has length 14 [2018-11-10 09:31:50,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:31:50,720 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 172 transitions. [2018-11-10 09:31:50,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:31:50,721 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 172 transitions. [2018-11-10 09:31:50,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 09:31:50,721 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:31:50,721 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:31:50,721 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:31:50,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:31:50,722 INFO L82 PathProgramCache]: Analyzing trace with hash 645002054, now seen corresponding path program 1 times [2018-11-10 09:31:50,722 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:31:50,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:31:50,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:50,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:31:50,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:31:50,836 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 09:31:50,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:31:50,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:31:50,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:31:50,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:31:50,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:31:50,837 INFO L87 Difference]: Start difference. First operand 107 states and 172 transitions. Second operand 3 states. [2018-11-10 09:31:50,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:31:50,942 INFO L93 Difference]: Finished difference Result 209 states and 338 transitions. [2018-11-10 09:31:50,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:31:50,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-10 09:31:50,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:31:50,945 INFO L225 Difference]: With dead ends: 209 [2018-11-10 09:31:50,945 INFO L226 Difference]: Without dead ends: 190 [2018-11-10 09:31:50,945 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 09:31:50,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-11-10 09:31:50,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 176. [2018-11-10 09:31:50,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-11-10 09:31:50,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 285 transitions. [2018-11-10 09:31:50,955 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 285 transitions. Word has length 19 [2018-11-10 09:31:50,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:31:50,956 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 285 transitions. [2018-11-10 09:31:50,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:31:50,956 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 285 transitions. [2018-11-10 09:31:50,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 09:31:50,957 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:31:50,957 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:31:50,957 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:31:50,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:31:50,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1271474490, now seen corresponding path program 1 times [2018-11-10 09:31:50,957 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:31:50,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:31:50,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:50,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:31:50,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:31:51,011 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 09:31:51,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:31:51,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:31:51,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:31:51,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:31:51,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:31:51,012 INFO L87 Difference]: Start difference. First operand 176 states and 285 transitions. Second operand 3 states. [2018-11-10 09:31:51,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:31:51,034 INFO L93 Difference]: Finished difference Result 297 states and 481 transitions. [2018-11-10 09:31:51,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:31:51,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-10 09:31:51,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:31:51,035 INFO L225 Difference]: With dead ends: 297 [2018-11-10 09:31:51,035 INFO L226 Difference]: Without dead ends: 128 [2018-11-10 09:31:51,036 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 09:31:51,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-10 09:31:51,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-11-10 09:31:51,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-10 09:31:51,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 198 transitions. [2018-11-10 09:31:51,044 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 198 transitions. Word has length 20 [2018-11-10 09:31:51,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:31:51,044 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 198 transitions. [2018-11-10 09:31:51,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:31:51,044 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 198 transitions. [2018-11-10 09:31:51,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 09:31:51,045 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:31:51,045 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:31:51,045 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:31:51,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:31:51,046 INFO L82 PathProgramCache]: Analyzing trace with hash -2078068567, now seen corresponding path program 1 times [2018-11-10 09:31:51,046 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:31:51,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:31:51,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:51,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:31:51,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:31:51,096 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 09:31:51,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:31:51,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:31:51,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:31:51,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:31:51,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:31:51,097 INFO L87 Difference]: Start difference. First operand 126 states and 198 transitions. Second operand 3 states. [2018-11-10 09:31:51,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:31:51,148 INFO L93 Difference]: Finished difference Result 230 states and 362 transitions. [2018-11-10 09:31:51,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:31:51,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-10 09:31:51,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:31:51,150 INFO L225 Difference]: With dead ends: 230 [2018-11-10 09:31:51,150 INFO L226 Difference]: Without dead ends: 111 [2018-11-10 09:31:51,151 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 09:31:51,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-10 09:31:51,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-11-10 09:31:51,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-10 09:31:51,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 167 transitions. [2018-11-10 09:31:51,156 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 167 transitions. Word has length 25 [2018-11-10 09:31:51,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:31:51,157 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 167 transitions. [2018-11-10 09:31:51,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:31:51,157 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 167 transitions. [2018-11-10 09:31:51,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 09:31:51,158 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:31:51,158 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:31:51,158 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:31:51,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:31:51,158 INFO L82 PathProgramCache]: Analyzing trace with hash -2048080470, now seen corresponding path program 1 times [2018-11-10 09:31:51,158 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:31:51,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:31:51,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:51,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:31:51,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:51,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:31:51,210 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:31:51,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:31:51,211 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec8a0596-9c49-4dee-bffd-0bd03e721988/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 09:31:51,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:31:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:31:51,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:31:51,308 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:31:51,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:31:51,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-10 09:31:51,336 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 09:31:51,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 09:31:51,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 09:31:51,336 INFO L87 Difference]: Start difference. First operand 109 states and 167 transitions. Second operand 4 states. [2018-11-10 09:31:51,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:31:51,449 INFO L93 Difference]: Finished difference Result 192 states and 299 transitions. [2018-11-10 09:31:51,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 09:31:51,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-10 09:31:51,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:31:51,450 INFO L225 Difference]: With dead ends: 192 [2018-11-10 09:31:51,450 INFO L226 Difference]: Without dead ends: 174 [2018-11-10 09:31:51,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 09:31:51,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-11-10 09:31:51,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2018-11-10 09:31:51,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-10 09:31:51,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 265 transitions. [2018-11-10 09:31:51,459 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 265 transitions. Word has length 27 [2018-11-10 09:31:51,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:31:51,459 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 265 transitions. [2018-11-10 09:31:51,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 09:31:51,459 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 265 transitions. [2018-11-10 09:31:51,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 09:31:51,460 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:31:51,460 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:31:51,461 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:31:51,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:31:51,461 INFO L82 PathProgramCache]: Analyzing trace with hash 945458420, now seen corresponding path program 1 times [2018-11-10 09:31:51,461 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:31:51,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:31:51,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:51,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:31:51,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:31:51,542 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:31:51,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:31:51,543 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec8a0596-9c49-4dee-bffd-0bd03e721988/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 09:31:51,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:31:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:31:51,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:31:51,692 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:31:51,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:31:51,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 5 [2018-11-10 09:31:51,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 09:31:51,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 09:31:51,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 09:31:51,721 INFO L87 Difference]: Start difference. First operand 172 states and 265 transitions. Second operand 5 states. [2018-11-10 09:31:51,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:31:51,829 INFO L93 Difference]: Finished difference Result 230 states and 355 transitions. [2018-11-10 09:31:51,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 09:31:51,830 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-10 09:31:51,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:31:51,830 INFO L225 Difference]: With dead ends: 230 [2018-11-10 09:31:51,830 INFO L226 Difference]: Without dead ends: 226 [2018-11-10 09:31:51,831 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 09:31:51,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-11-10 09:31:51,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 217. [2018-11-10 09:31:51,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-10 09:31:51,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 339 transitions. [2018-11-10 09:31:51,839 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 339 transitions. Word has length 28 [2018-11-10 09:31:51,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:31:51,839 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 339 transitions. [2018-11-10 09:31:51,839 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 09:31:51,839 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 339 transitions. [2018-11-10 09:31:51,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 09:31:51,840 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:31:51,840 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:31:51,840 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:31:51,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:31:51,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1709359769, now seen corresponding path program 1 times [2018-11-10 09:31:51,841 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:31:51,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:31:51,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:51,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:31:51,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:31:51,871 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 09:31:51,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:31:51,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:31:51,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:31:51,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:31:51,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:31:51,872 INFO L87 Difference]: Start difference. First operand 217 states and 339 transitions. Second operand 3 states. [2018-11-10 09:31:51,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:31:51,898 INFO L93 Difference]: Finished difference Result 391 states and 608 transitions. [2018-11-10 09:31:51,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:31:51,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-10 09:31:51,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:31:51,899 INFO L225 Difference]: With dead ends: 391 [2018-11-10 09:31:51,899 INFO L226 Difference]: Without dead ends: 202 [2018-11-10 09:31:51,900 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 09:31:51,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-11-10 09:31:51,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2018-11-10 09:31:51,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-10 09:31:51,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 301 transitions. [2018-11-10 09:31:51,905 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 301 transitions. Word has length 29 [2018-11-10 09:31:51,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:31:51,905 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 301 transitions. [2018-11-10 09:31:51,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:31:51,905 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 301 transitions. [2018-11-10 09:31:51,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 09:31:51,906 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:31:51,906 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:31:51,906 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:31:51,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:31:51,907 INFO L82 PathProgramCache]: Analyzing trace with hash -847629460, now seen corresponding path program 1 times [2018-11-10 09:31:51,907 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:31:51,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:31:51,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:51,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:31:51,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:51,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:31:52,021 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:31:52,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:31:52,021 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec8a0596-9c49-4dee-bffd-0bd03e721988/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 09:31:52,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:31:52,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:31:52,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:31:52,066 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 09:31:52,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 09:31:52,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-11-10 09:31:52,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 09:31:52,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 09:31:52,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 09:31:52,084 INFO L87 Difference]: Start difference. First operand 200 states and 301 transitions. Second operand 6 states. [2018-11-10 09:31:52,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:31:52,179 INFO L93 Difference]: Finished difference Result 357 states and 542 transitions. [2018-11-10 09:31:52,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 09:31:52,180 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-11-10 09:31:52,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:31:52,181 INFO L225 Difference]: With dead ends: 357 [2018-11-10 09:31:52,181 INFO L226 Difference]: Without dead ends: 341 [2018-11-10 09:31:52,181 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-10 09:31:52,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-11-10 09:31:52,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 312. [2018-11-10 09:31:52,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-11-10 09:31:52,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 471 transitions. [2018-11-10 09:31:52,188 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 471 transitions. Word has length 31 [2018-11-10 09:31:52,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:31:52,188 INFO L481 AbstractCegarLoop]: Abstraction has 312 states and 471 transitions. [2018-11-10 09:31:52,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 09:31:52,188 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 471 transitions. [2018-11-10 09:31:52,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-10 09:31:52,189 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:31:52,189 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:31:52,189 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:31:52,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:31:52,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1174866170, now seen corresponding path program 1 times [2018-11-10 09:31:52,190 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:31:52,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:31:52,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:52,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:31:52,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:31:52,214 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 09:31:52,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:31:52,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:31:52,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:31:52,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:31:52,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:31:52,215 INFO L87 Difference]: Start difference. First operand 312 states and 471 transitions. Second operand 3 states. [2018-11-10 09:31:52,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:31:52,241 INFO L93 Difference]: Finished difference Result 512 states and 778 transitions. [2018-11-10 09:31:52,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:31:52,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-10 09:31:52,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:31:52,243 INFO L225 Difference]: With dead ends: 512 [2018-11-10 09:31:52,243 INFO L226 Difference]: Without dead ends: 246 [2018-11-10 09:31:52,243 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 09:31:52,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-11-10 09:31:52,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 244. [2018-11-10 09:31:52,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-11-10 09:31:52,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 364 transitions. [2018-11-10 09:31:52,248 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 364 transitions. Word has length 37 [2018-11-10 09:31:52,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:31:52,248 INFO L481 AbstractCegarLoop]: Abstraction has 244 states and 364 transitions. [2018-11-10 09:31:52,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:31:52,249 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 364 transitions. [2018-11-10 09:31:52,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-10 09:31:52,249 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:31:52,249 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:31:52,249 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:31:52,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:31:52,250 INFO L82 PathProgramCache]: Analyzing trace with hash 2138202118, now seen corresponding path program 1 times [2018-11-10 09:31:52,250 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:31:52,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:31:52,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:52,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:31:52,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:31:52,334 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:31:52,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:31:52,334 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec8a0596-9c49-4dee-bffd-0bd03e721988/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 09:31:52,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:31:52,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:31:52,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:31:52,488 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:31:52,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:31:52,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 6 [2018-11-10 09:31:52,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 09:31:52,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 09:31:52,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 09:31:52,516 INFO L87 Difference]: Start difference. First operand 244 states and 364 transitions. Second operand 6 states. [2018-11-10 09:31:52,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:31:52,686 INFO L93 Difference]: Finished difference Result 254 states and 373 transitions. [2018-11-10 09:31:52,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 09:31:52,687 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-11-10 09:31:52,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:31:52,688 INFO L225 Difference]: With dead ends: 254 [2018-11-10 09:31:52,688 INFO L226 Difference]: Without dead ends: 252 [2018-11-10 09:31:52,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 09:31:52,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-11-10 09:31:52,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 245. [2018-11-10 09:31:52,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-11-10 09:31:52,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 365 transitions. [2018-11-10 09:31:52,696 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 365 transitions. Word has length 40 [2018-11-10 09:31:52,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:31:52,696 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 365 transitions. [2018-11-10 09:31:52,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 09:31:52,697 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 365 transitions. [2018-11-10 09:31:52,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-10 09:31:52,697 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:31:52,697 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:31:52,697 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:31:52,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:31:52,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1984993975, now seen corresponding path program 1 times [2018-11-10 09:31:52,698 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:31:52,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:31:52,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:52,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:31:52,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:52,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:31:52,726 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 09:31:52,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:31:52,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:31:52,726 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:31:52,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:31:52,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:31:52,727 INFO L87 Difference]: Start difference. First operand 245 states and 365 transitions. Second operand 3 states. [2018-11-10 09:31:52,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:31:52,754 INFO L93 Difference]: Finished difference Result 428 states and 636 transitions. [2018-11-10 09:31:52,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:31:52,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-11-10 09:31:52,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:31:52,756 INFO L225 Difference]: With dead ends: 428 [2018-11-10 09:31:52,756 INFO L226 Difference]: Without dead ends: 229 [2018-11-10 09:31:52,756 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 09:31:52,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-11-10 09:31:52,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2018-11-10 09:31:52,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-11-10 09:31:52,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 328 transitions. [2018-11-10 09:31:52,764 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 328 transitions. Word has length 41 [2018-11-10 09:31:52,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:31:52,764 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 328 transitions. [2018-11-10 09:31:52,764 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:31:52,764 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 328 transitions. [2018-11-10 09:31:52,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-10 09:31:52,765 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:31:52,765 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:31:52,765 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:31:52,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:31:52,765 INFO L82 PathProgramCache]: Analyzing trace with hash -636700121, now seen corresponding path program 1 times [2018-11-10 09:31:52,765 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:31:52,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:31:52,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:52,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:31:52,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:52,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:31:52,799 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 09:31:52,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:31:52,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:31:52,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:31:52,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:31:52,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:31:52,800 INFO L87 Difference]: Start difference. First operand 227 states and 328 transitions. Second operand 3 states. [2018-11-10 09:31:52,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:31:52,836 INFO L93 Difference]: Finished difference Result 309 states and 446 transitions. [2018-11-10 09:31:52,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:31:52,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-11-10 09:31:52,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:31:52,838 INFO L225 Difference]: With dead ends: 309 [2018-11-10 09:31:52,838 INFO L226 Difference]: Without dead ends: 147 [2018-11-10 09:31:52,838 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 09:31:52,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-10 09:31:52,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2018-11-10 09:31:52,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-10 09:31:52,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 203 transitions. [2018-11-10 09:31:52,843 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 203 transitions. Word has length 50 [2018-11-10 09:31:52,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:31:52,843 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 203 transitions. [2018-11-10 09:31:52,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:31:52,843 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 203 transitions. [2018-11-10 09:31:52,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-10 09:31:52,844 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:31:52,844 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:31:52,844 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:31:52,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:31:52,844 INFO L82 PathProgramCache]: Analyzing trace with hash 783335988, now seen corresponding path program 1 times [2018-11-10 09:31:52,844 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:31:52,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:31:52,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:52,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:31:52,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:31:52,924 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 09:31:52,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:31:52,924 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec8a0596-9c49-4dee-bffd-0bd03e721988/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 09:31:52,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:31:52,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:31:52,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:31:53,039 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:31:53,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:31:53,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-11-10 09:31:53,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 09:31:53,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 09:31:53,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-10 09:31:53,057 INFO L87 Difference]: Start difference. First operand 145 states and 203 transitions. Second operand 9 states. [2018-11-10 09:31:53,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:31:53,115 INFO L93 Difference]: Finished difference Result 188 states and 263 transitions. [2018-11-10 09:31:53,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 09:31:53,115 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-11-10 09:31:53,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:31:53,116 INFO L225 Difference]: With dead ends: 188 [2018-11-10 09:31:53,116 INFO L226 Difference]: Without dead ends: 184 [2018-11-10 09:31:53,116 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-10 09:31:53,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-11-10 09:31:53,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2018-11-10 09:31:53,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-11-10 09:31:53,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 254 transitions. [2018-11-10 09:31:53,121 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 254 transitions. Word has length 51 [2018-11-10 09:31:53,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:31:53,121 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 254 transitions. [2018-11-10 09:31:53,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 09:31:53,122 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 254 transitions. [2018-11-10 09:31:53,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-10 09:31:53,122 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:31:53,122 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:31:53,122 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:31:53,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:31:53,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1248250631, now seen corresponding path program 1 times [2018-11-10 09:31:53,123 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:31:53,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:31:53,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:53,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:31:53,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:53,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:31:53,255 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:31:53,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:31:53,256 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec8a0596-9c49-4dee-bffd-0bd03e721988/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 09:31:53,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:31:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:31:53,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:31:53,403 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:31:53,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:31:53,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-10 09:31:53,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 09:31:53,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 09:31:53,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-10 09:31:53,431 INFO L87 Difference]: Start difference. First operand 181 states and 254 transitions. Second operand 9 states. [2018-11-10 09:31:53,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:31:53,588 INFO L93 Difference]: Finished difference Result 185 states and 258 transitions. [2018-11-10 09:31:53,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 09:31:53,589 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-11-10 09:31:53,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:31:53,590 INFO L225 Difference]: With dead ends: 185 [2018-11-10 09:31:53,590 INFO L226 Difference]: Without dead ends: 183 [2018-11-10 09:31:53,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-10 09:31:53,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-11-10 09:31:53,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2018-11-10 09:31:53,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-11-10 09:31:53,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 255 transitions. [2018-11-10 09:31:53,595 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 255 transitions. Word has length 61 [2018-11-10 09:31:53,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:31:53,595 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 255 transitions. [2018-11-10 09:31:53,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 09:31:53,595 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 255 transitions. [2018-11-10 09:31:53,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-10 09:31:53,595 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:31:53,596 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:31:53,596 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:31:53,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:31:53,596 INFO L82 PathProgramCache]: Analyzing trace with hash 975602849, now seen corresponding path program 1 times [2018-11-10 09:31:53,596 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:31:53,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:31:53,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:53,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:31:53,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:53,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:31:53,722 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:31:53,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:31:53,722 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec8a0596-9c49-4dee-bffd-0bd03e721988/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:31:53,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:31:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:31:53,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:31:53,810 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:31:53,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:31:53,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-10 09:31:53,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 09:31:53,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 09:31:53,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 09:31:53,828 INFO L87 Difference]: Start difference. First operand 182 states and 255 transitions. Second operand 8 states. [2018-11-10 09:31:53,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:31:53,891 INFO L93 Difference]: Finished difference Result 203 states and 284 transitions. [2018-11-10 09:31:53,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 09:31:53,892 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2018-11-10 09:31:53,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:31:53,893 INFO L225 Difference]: With dead ends: 203 [2018-11-10 09:31:53,893 INFO L226 Difference]: Without dead ends: 200 [2018-11-10 09:31:53,893 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 09:31:53,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-11-10 09:31:53,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-11-10 09:31:53,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-10 09:31:53,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 280 transitions. [2018-11-10 09:31:53,898 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 280 transitions. Word has length 70 [2018-11-10 09:31:53,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:31:53,898 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 280 transitions. [2018-11-10 09:31:53,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 09:31:53,899 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 280 transitions. [2018-11-10 09:31:53,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-10 09:31:53,899 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:31:53,899 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:31:53,899 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:31:53,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:31:53,900 INFO L82 PathProgramCache]: Analyzing trace with hash 564297596, now seen corresponding path program 1 times [2018-11-10 09:31:53,900 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:31:53,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:31:53,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:53,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:31:53,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:53,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:31:54,015 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 81 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 09:31:54,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:31:54,015 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec8a0596-9c49-4dee-bffd-0bd03e721988/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:31:54,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:31:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:31:54,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:31:54,094 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 81 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 09:31:54,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:31:54,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-10 09:31:54,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 09:31:54,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 09:31:54,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 09:31:54,111 INFO L87 Difference]: Start difference. First operand 200 states and 280 transitions. Second operand 7 states. [2018-11-10 09:31:54,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:31:54,170 INFO L93 Difference]: Finished difference Result 224 states and 311 transitions. [2018-11-10 09:31:54,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 09:31:54,171 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2018-11-10 09:31:54,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:31:54,171 INFO L225 Difference]: With dead ends: 224 [2018-11-10 09:31:54,171 INFO L226 Difference]: Without dead ends: 221 [2018-11-10 09:31:54,172 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 09:31:54,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-11-10 09:31:54,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 218. [2018-11-10 09:31:54,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-11-10 09:31:54,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 305 transitions. [2018-11-10 09:31:54,177 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 305 transitions. Word has length 79 [2018-11-10 09:31:54,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:31:54,177 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 305 transitions. [2018-11-10 09:31:54,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 09:31:54,177 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 305 transitions. [2018-11-10 09:31:54,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-10 09:31:54,178 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:31:54,178 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:31:54,178 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:31:54,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:31:54,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1030800333, now seen corresponding path program 1 times [2018-11-10 09:31:54,179 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:31:54,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:31:54,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:54,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:31:54,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:31:54,341 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:31:54,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:31:54,341 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec8a0596-9c49-4dee-bffd-0bd03e721988/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:31:54,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:31:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:31:54,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:31:54,468 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:31:54,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:31:54,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 10 [2018-11-10 09:31:54,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 09:31:54,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 09:31:54,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-11-10 09:31:54,487 INFO L87 Difference]: Start difference. First operand 218 states and 305 transitions. Second operand 10 states. [2018-11-10 09:31:54,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:31:54,644 INFO L93 Difference]: Finished difference Result 221 states and 308 transitions. [2018-11-10 09:31:54,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 09:31:54,645 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 82 [2018-11-10 09:31:54,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:31:54,646 INFO L225 Difference]: With dead ends: 221 [2018-11-10 09:31:54,646 INFO L226 Difference]: Without dead ends: 219 [2018-11-10 09:31:54,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-11-10 09:31:54,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-11-10 09:31:54,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-11-10 09:31:54,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-11-10 09:31:54,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 306 transitions. [2018-11-10 09:31:54,653 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 306 transitions. Word has length 82 [2018-11-10 09:31:54,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:31:54,653 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 306 transitions. [2018-11-10 09:31:54,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 09:31:54,653 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 306 transitions. [2018-11-10 09:31:54,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 09:31:54,654 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:31:54,654 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:31:54,654 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:31:54,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:31:54,654 INFO L82 PathProgramCache]: Analyzing trace with hash 644642791, now seen corresponding path program 1 times [2018-11-10 09:31:54,654 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:31:54,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:31:54,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:54,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:31:54,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:54,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:31:54,785 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 123 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 09:31:54,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:31:54,785 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec8a0596-9c49-4dee-bffd-0bd03e721988/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:31:54,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:31:54,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:31:54,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:31:54,925 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 16 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:31:54,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:31:54,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 15 [2018-11-10 09:31:54,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 09:31:54,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 09:31:54,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-11-10 09:31:54,943 INFO L87 Difference]: Start difference. First operand 219 states and 306 transitions. Second operand 15 states. [2018-11-10 09:31:55,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:31:55,061 INFO L93 Difference]: Finished difference Result 262 states and 366 transitions. [2018-11-10 09:31:55,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 09:31:55,062 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 93 [2018-11-10 09:31:55,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:31:55,063 INFO L225 Difference]: With dead ends: 262 [2018-11-10 09:31:55,063 INFO L226 Difference]: Without dead ends: 258 [2018-11-10 09:31:55,063 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-11-10 09:31:55,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-11-10 09:31:55,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 255. [2018-11-10 09:31:55,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-11-10 09:31:55,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 357 transitions. [2018-11-10 09:31:55,068 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 357 transitions. Word has length 93 [2018-11-10 09:31:55,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:31:55,068 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 357 transitions. [2018-11-10 09:31:55,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 09:31:55,069 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 357 transitions. [2018-11-10 09:31:55,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-10 09:31:55,069 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:31:55,069 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:31:55,069 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:31:55,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:31:55,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1306502892, now seen corresponding path program 2 times [2018-11-10 09:31:55,069 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:31:55,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:31:55,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:55,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:31:55,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:31:55,310 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 18 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:31:55,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:31:55,311 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec8a0596-9c49-4dee-bffd-0bd03e721988/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:31:55,317 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 09:31:55,397 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 09:31:55,397 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:31:55,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:31:55,450 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 18 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:31:55,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:31:55,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 14 [2018-11-10 09:31:55,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 09:31:55,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 09:31:55,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2018-11-10 09:31:55,468 INFO L87 Difference]: Start difference. First operand 255 states and 357 transitions. Second operand 14 states. [2018-11-10 09:31:55,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:31:55,830 INFO L93 Difference]: Finished difference Result 265 states and 367 transitions. [2018-11-10 09:31:55,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-10 09:31:55,830 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 103 [2018-11-10 09:31:55,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:31:55,832 INFO L225 Difference]: With dead ends: 265 [2018-11-10 09:31:55,832 INFO L226 Difference]: Without dead ends: 263 [2018-11-10 09:31:55,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 102 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-11-10 09:31:55,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-11-10 09:31:55,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 256. [2018-11-10 09:31:55,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-11-10 09:31:55,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 358 transitions. [2018-11-10 09:31:55,843 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 358 transitions. Word has length 103 [2018-11-10 09:31:55,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:31:55,843 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 358 transitions. [2018-11-10 09:31:55,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 09:31:55,843 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 358 transitions. [2018-11-10 09:31:55,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-10 09:31:55,844 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:31:55,844 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 7, 7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:31:55,844 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:31:55,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:31:55,844 INFO L82 PathProgramCache]: Analyzing trace with hash -582642674, now seen corresponding path program 2 times [2018-11-10 09:31:55,844 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:31:55,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:31:55,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:55,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:31:55,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:55,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:31:56,085 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 20 proven. 203 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-10 09:31:56,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:31:56,085 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec8a0596-9c49-4dee-bffd-0bd03e721988/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:31:56,095 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 09:31:56,189 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 09:31:56,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:31:56,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:31:56,396 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 20 proven. 219 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:31:56,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:31:56,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 20 [2018-11-10 09:31:56,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-10 09:31:56,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-10 09:31:56,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2018-11-10 09:31:56,424 INFO L87 Difference]: Start difference. First operand 256 states and 358 transitions. Second operand 20 states. [2018-11-10 09:31:56,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:31:56,863 INFO L93 Difference]: Finished difference Result 277 states and 387 transitions. [2018-11-10 09:31:56,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 09:31:56,864 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 112 [2018-11-10 09:31:56,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:31:56,865 INFO L225 Difference]: With dead ends: 277 [2018-11-10 09:31:56,865 INFO L226 Difference]: Without dead ends: 274 [2018-11-10 09:31:56,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2018-11-10 09:31:56,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-11-10 09:31:56,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2018-11-10 09:31:56,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-11-10 09:31:56,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 383 transitions. [2018-11-10 09:31:56,876 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 383 transitions. Word has length 112 [2018-11-10 09:31:56,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:31:56,876 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 383 transitions. [2018-11-10 09:31:56,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-10 09:31:56,876 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 383 transitions. [2018-11-10 09:31:56,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-10 09:31:56,878 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:31:56,878 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:31:56,878 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:31:56,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:31:56,878 INFO L82 PathProgramCache]: Analyzing trace with hash -498500945, now seen corresponding path program 2 times [2018-11-10 09:31:56,879 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:31:56,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:31:56,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:56,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:31:56,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:31:57,103 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 22 proven. 248 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 09:31:57,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:31:57,103 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec8a0596-9c49-4dee-bffd-0bd03e721988/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:31:57,116 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 09:31:57,195 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 09:31:57,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:31:57,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:31:57,240 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 22 proven. 248 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 09:31:57,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:31:57,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-10 09:31:57,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 09:31:57,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 09:31:57,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-10 09:31:57,257 INFO L87 Difference]: Start difference. First operand 274 states and 383 transitions. Second operand 9 states. [2018-11-10 09:31:57,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:31:57,337 INFO L93 Difference]: Finished difference Result 298 states and 414 transitions. [2018-11-10 09:31:57,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 09:31:57,339 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2018-11-10 09:31:57,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:31:57,340 INFO L225 Difference]: With dead ends: 298 [2018-11-10 09:31:57,340 INFO L226 Difference]: Without dead ends: 295 [2018-11-10 09:31:57,341 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 126 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-10 09:31:57,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-11-10 09:31:57,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 292. [2018-11-10 09:31:57,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-11-10 09:31:57,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 408 transitions. [2018-11-10 09:31:57,346 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 408 transitions. Word has length 121 [2018-11-10 09:31:57,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:31:57,347 INFO L481 AbstractCegarLoop]: Abstraction has 292 states and 408 transitions. [2018-11-10 09:31:57,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 09:31:57,347 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 408 transitions. [2018-11-10 09:31:57,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 09:31:57,348 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:31:57,348 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:31:57,348 INFO L424 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:31:57,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:31:57,348 INFO L82 PathProgramCache]: Analyzing trace with hash -363229152, now seen corresponding path program 2 times [2018-11-10 09:31:57,348 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:31:57,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:31:57,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:57,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:31:57,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:31:57,570 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 22 proven. 279 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:31:57,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:31:57,570 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec8a0596-9c49-4dee-bffd-0bd03e721988/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:31:57,577 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 09:31:57,657 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 09:31:57,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:31:57,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:31:57,745 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 22 proven. 279 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:31:57,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:31:57,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 14 [2018-11-10 09:31:57,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 09:31:57,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 09:31:57,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-11-10 09:31:57,763 INFO L87 Difference]: Start difference. First operand 292 states and 408 transitions. Second operand 14 states. [2018-11-10 09:31:57,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:31:57,899 INFO L93 Difference]: Finished difference Result 295 states and 411 transitions. [2018-11-10 09:31:57,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 09:31:57,900 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 124 [2018-11-10 09:31:57,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:31:57,901 INFO L225 Difference]: With dead ends: 295 [2018-11-10 09:31:57,901 INFO L226 Difference]: Without dead ends: 293 [2018-11-10 09:31:57,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 122 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-11-10 09:31:57,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-11-10 09:31:57,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2018-11-10 09:31:57,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-11-10 09:31:57,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 409 transitions. [2018-11-10 09:31:57,907 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 409 transitions. Word has length 124 [2018-11-10 09:31:57,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:31:57,907 INFO L481 AbstractCegarLoop]: Abstraction has 293 states and 409 transitions. [2018-11-10 09:31:57,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 09:31:57,907 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 409 transitions. [2018-11-10 09:31:57,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-10 09:31:57,908 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:31:57,908 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:31:57,909 INFO L424 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:31:57,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:31:57,909 INFO L82 PathProgramCache]: Analyzing trace with hash -730440230, now seen corresponding path program 2 times [2018-11-10 09:31:57,909 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:31:57,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:31:57,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:57,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:31:57,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:31:58,053 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 24 proven. 318 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 09:31:58,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:31:58,053 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec8a0596-9c49-4dee-bffd-0bd03e721988/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:31:58,060 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 09:31:58,150 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 09:31:58,150 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:31:58,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:31:58,305 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 24 proven. 339 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:31:58,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:31:58,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14] total 21 [2018-11-10 09:31:58,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-10 09:31:58,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-10 09:31:58,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-11-10 09:31:58,322 INFO L87 Difference]: Start difference. First operand 293 states and 409 transitions. Second operand 21 states. [2018-11-10 09:31:58,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:31:58,461 INFO L93 Difference]: Finished difference Result 336 states and 469 transitions. [2018-11-10 09:31:58,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 09:31:58,462 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 135 [2018-11-10 09:31:58,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:31:58,463 INFO L225 Difference]: With dead ends: 336 [2018-11-10 09:31:58,463 INFO L226 Difference]: Without dead ends: 332 [2018-11-10 09:31:58,463 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-11-10 09:31:58,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-11-10 09:31:58,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 329. [2018-11-10 09:31:58,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-11-10 09:31:58,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 460 transitions. [2018-11-10 09:31:58,472 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 460 transitions. Word has length 135 [2018-11-10 09:31:58,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:31:58,473 INFO L481 AbstractCegarLoop]: Abstraction has 329 states and 460 transitions. [2018-11-10 09:31:58,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-10 09:31:58,473 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 460 transitions. [2018-11-10 09:31:58,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-10 09:31:58,474 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:31:58,474 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 9, 9, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:31:58,475 INFO L424 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:31:58,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:31:58,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1381697249, now seen corresponding path program 3 times [2018-11-10 09:31:58,475 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:31:58,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:31:58,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:58,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:31:58,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:31:58,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:31:58,932 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 26 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:31:58,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:31:58,932 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec8a0596-9c49-4dee-bffd-0bd03e721988/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:31:58,937 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 09:31:58,986 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-10 09:31:58,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:31:58,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:31:59,301 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 208 proven. 26 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2018-11-10 09:31:59,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:31:59,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7] total 22 [2018-11-10 09:31:59,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-10 09:31:59,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-10 09:31:59,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2018-11-10 09:31:59,329 INFO L87 Difference]: Start difference. First operand 329 states and 460 transitions. Second operand 22 states. [2018-11-10 09:32:00,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:32:00,075 INFO L93 Difference]: Finished difference Result 349 states and 481 transitions. [2018-11-10 09:32:00,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-10 09:32:00,076 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 145 [2018-11-10 09:32:00,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:32:00,076 INFO L225 Difference]: With dead ends: 349 [2018-11-10 09:32:00,076 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 09:32:00,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=185, Invalid=1885, Unknown=0, NotChecked=0, Total=2070 [2018-11-10 09:32:00,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 09:32:00,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 09:32:00,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 09:32:00,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 09:32:00,077 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 145 [2018-11-10 09:32:00,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:32:00,078 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 09:32:00,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-10 09:32:00,078 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 09:32:00,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 09:32:00,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 09:32:00,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:32:00,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:32:00,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:32:00,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:32:00,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:32:00,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:32:00,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:32:00,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 09:32:00,351 WARN L179 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 45 [2018-11-10 09:32:00,396 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 09:32:00,396 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-10 09:32:00,396 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 09:32:00,397 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 09:32:00,397 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 09:32:00,397 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 09:32:00,397 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 09:32:00,397 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 14 566) no Hoare annotation was computed. [2018-11-10 09:32:00,397 INFO L425 ceAbstractionStarter]: For program point L498(lines 498 500) no Hoare annotation was computed. [2018-11-10 09:32:00,397 INFO L425 ceAbstractionStarter]: For program point L366(lines 366 368) no Hoare annotation was computed. [2018-11-10 09:32:00,397 INFO L425 ceAbstractionStarter]: For program point L466(lines 466 468) no Hoare annotation was computed. [2018-11-10 09:32:00,397 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 14 566) no Hoare annotation was computed. [2018-11-10 09:32:00,397 INFO L425 ceAbstractionStarter]: For program point L39(lines 39 58) no Hoare annotation was computed. [2018-11-10 09:32:00,397 INFO L425 ceAbstractionStarter]: For program point L40(lines 40 55) no Hoare annotation was computed. [2018-11-10 09:32:00,397 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 155) no Hoare annotation was computed. [2018-11-10 09:32:00,397 INFO L425 ceAbstractionStarter]: For program point L240(lines 240 255) no Hoare annotation was computed. [2018-11-10 09:32:00,397 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 123) no Hoare annotation was computed. [2018-11-10 09:32:00,397 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 53) no Hoare annotation was computed. [2018-11-10 09:32:00,397 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 355) no Hoare annotation was computed. [2018-11-10 09:32:00,397 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 223) no Hoare annotation was computed. [2018-11-10 09:32:00,397 INFO L425 ceAbstractionStarter]: For program point L142(lines 142 153) no Hoare annotation was computed. [2018-11-10 09:32:00,397 INFO L425 ceAbstractionStarter]: For program point L76(lines 76 91) no Hoare annotation was computed. [2018-11-10 09:32:00,397 INFO L425 ceAbstractionStarter]: For program point L440(lines 440 455) no Hoare annotation was computed. [2018-11-10 09:32:00,397 INFO L425 ceAbstractionStarter]: For program point L308(lines 308 323) no Hoare annotation was computed. [2018-11-10 09:32:00,398 INFO L425 ceAbstractionStarter]: For program point L242(lines 242 253) no Hoare annotation was computed. [2018-11-10 09:32:00,398 INFO L425 ceAbstractionStarter]: For program point L176(lines 176 191) no Hoare annotation was computed. [2018-11-10 09:32:00,398 INFO L425 ceAbstractionStarter]: For program point L110(lines 110 121) no Hoare annotation was computed. [2018-11-10 09:32:00,398 INFO L425 ceAbstractionStarter]: For program point L540(lines 540 555) no Hoare annotation was computed. [2018-11-10 09:32:00,398 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 423) no Hoare annotation was computed. [2018-11-10 09:32:00,398 INFO L425 ceAbstractionStarter]: For program point L342(lines 342 353) no Hoare annotation was computed. [2018-11-10 09:32:00,398 INFO L425 ceAbstractionStarter]: For program point L276(lines 276 291) no Hoare annotation was computed. [2018-11-10 09:32:00,398 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 221) no Hoare annotation was computed. [2018-11-10 09:32:00,398 INFO L425 ceAbstractionStarter]: For program point L78(lines 78 89) no Hoare annotation was computed. [2018-11-10 09:32:00,398 INFO L425 ceAbstractionStarter]: For program point L508(lines 508 523) no Hoare annotation was computed. [2018-11-10 09:32:00,398 INFO L425 ceAbstractionStarter]: For program point L442(lines 442 453) no Hoare annotation was computed. [2018-11-10 09:32:00,398 INFO L425 ceAbstractionStarter]: For program point L376(lines 376 391) no Hoare annotation was computed. [2018-11-10 09:32:00,398 INFO L425 ceAbstractionStarter]: For program point L310(lines 310 321) no Hoare annotation was computed. [2018-11-10 09:32:00,398 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 189) no Hoare annotation was computed. [2018-11-10 09:32:00,399 INFO L425 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2018-11-10 09:32:00,399 INFO L425 ceAbstractionStarter]: For program point L542(lines 542 553) no Hoare annotation was computed. [2018-11-10 09:32:00,399 INFO L425 ceAbstractionStarter]: For program point L476(lines 476 491) no Hoare annotation was computed. [2018-11-10 09:32:00,399 INFO L425 ceAbstractionStarter]: For program point L410(lines 410 421) no Hoare annotation was computed. [2018-11-10 09:32:00,399 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 289) no Hoare annotation was computed. [2018-11-10 09:32:00,399 INFO L425 ceAbstractionStarter]: For program point L146(lines 146 148) no Hoare annotation was computed. [2018-11-10 09:32:00,399 INFO L425 ceAbstractionStarter]: For program point L510(lines 510 521) no Hoare annotation was computed. [2018-11-10 09:32:00,399 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 389) no Hoare annotation was computed. [2018-11-10 09:32:00,399 INFO L425 ceAbstractionStarter]: For program point L246(lines 246 248) no Hoare annotation was computed. [2018-11-10 09:32:00,399 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 116) no Hoare annotation was computed. [2018-11-10 09:32:00,399 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 489) no Hoare annotation was computed. [2018-11-10 09:32:00,399 INFO L425 ceAbstractionStarter]: For program point L346(lines 346 348) no Hoare annotation was computed. [2018-11-10 09:32:00,400 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 565) no Hoare annotation was computed. [2018-11-10 09:32:00,400 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 216) no Hoare annotation was computed. [2018-11-10 09:32:00,400 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 84) no Hoare annotation was computed. [2018-11-10 09:32:00,400 INFO L425 ceAbstractionStarter]: For program point L446(lines 446 448) no Hoare annotation was computed. [2018-11-10 09:32:00,400 INFO L425 ceAbstractionStarter]: For program point L314(lines 314 316) no Hoare annotation was computed. [2018-11-10 09:32:00,400 INFO L425 ceAbstractionStarter]: For program point L182(lines 182 184) no Hoare annotation was computed. [2018-11-10 09:32:00,400 INFO L425 ceAbstractionStarter]: For program point L546(lines 546 548) no Hoare annotation was computed. [2018-11-10 09:32:00,400 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2018-11-10 09:32:00,400 INFO L425 ceAbstractionStarter]: For program point L282(lines 282 284) no Hoare annotation was computed. [2018-11-10 09:32:00,400 INFO L421 ceAbstractionStarter]: At program point L547(lines 14 566) the Hoare annotation is: false [2018-11-10 09:32:00,400 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 516) no Hoare annotation was computed. [2018-11-10 09:32:00,400 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 384) no Hoare annotation was computed. [2018-11-10 09:32:00,400 INFO L425 ceAbstractionStarter]: For program point L482(lines 482 484) no Hoare annotation was computed. [2018-11-10 09:32:00,401 INFO L421 ceAbstractionStarter]: At program point L24-3(lines 24 561) the Hoare annotation is: (let ((.cse0 (<= main_~this_buffer_empty~0 0)) (.cse1 (<= 0 main_~this_buffer_empty~0))) (or (and (<= main_~this_expect~0 0) (<= 0 main_~this_expect~0) (= main_~q~0 0) .cse0 .cse1) (and (exists ((main_~P1~0 Int)) (let ((.cse2 (mod main_~P1~0 2))) (and (= .cse2 0) (= .cse2 (mod main_~this_expect~0 2))))) (<= 5 main_~q~0) (<= 0 (+ main_~P8~0 2147483648)) (<= main_~P8~0 2147483647) .cse0 .cse1))) [2018-11-10 09:32:00,401 INFO L425 ceAbstractionStarter]: For program point L24-4(lines 24 561) no Hoare annotation was computed. [2018-11-10 09:32:00,401 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 139) no Hoare annotation was computed. [2018-11-10 09:32:00,401 INFO L425 ceAbstractionStarter]: For program point L224(lines 224 239) no Hoare annotation was computed. [2018-11-10 09:32:00,401 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 107) no Hoare annotation was computed. [2018-11-10 09:32:00,401 INFO L425 ceAbstractionStarter]: For program point L59(lines 59 158) no Hoare annotation was computed. [2018-11-10 09:32:00,401 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 339) no Hoare annotation was computed. [2018-11-10 09:32:00,401 INFO L425 ceAbstractionStarter]: For program point L192(lines 192 207) no Hoare annotation was computed. [2018-11-10 09:32:00,401 INFO L425 ceAbstractionStarter]: For program point L159(lines 159 258) no Hoare annotation was computed. [2018-11-10 09:32:00,401 INFO L425 ceAbstractionStarter]: For program point L126(lines 126 137) no Hoare annotation was computed. [2018-11-10 09:32:00,401 INFO L425 ceAbstractionStarter]: For program point L60(lines 60 75) no Hoare annotation was computed. [2018-11-10 09:32:00,401 INFO L425 ceAbstractionStarter]: For program point L424(lines 424 439) no Hoare annotation was computed. [2018-11-10 09:32:00,401 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 307) no Hoare annotation was computed. [2018-11-10 09:32:00,402 INFO L425 ceAbstractionStarter]: For program point L259(lines 259 358) no Hoare annotation was computed. [2018-11-10 09:32:00,402 INFO L425 ceAbstractionStarter]: For program point L226(lines 226 237) no Hoare annotation was computed. [2018-11-10 09:32:00,402 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 175) no Hoare annotation was computed. [2018-11-10 09:32:00,402 INFO L425 ceAbstractionStarter]: For program point L94(lines 94 105) no Hoare annotation was computed. [2018-11-10 09:32:00,402 INFO L421 ceAbstractionStarter]: At program point L557(lines 24 561) the Hoare annotation is: (let ((.cse5 (exists ((main_~P1~0 Int)) (let ((.cse9 (mod main_~P1~0 2))) (and (= .cse9 0) (= .cse9 (mod (+ main_~this_expect~0 1) 2)))))) (.cse1 (<= main_~this_buffer_empty~0 1)) (.cse3 (<= 1 main_~this_buffer_empty~0)) (.cse0 (exists ((main_~P1~0 Int)) (let ((.cse8 (mod main_~P1~0 2))) (and (= .cse8 0) (= .cse8 (mod main_~this_expect~0 2)))))) (.cse2 (<= 0 (+ main_~P8~0 2147483648))) (.cse4 (<= main_~P8~0 2147483647)) (.cse6 (<= main_~this_buffer_empty~0 0)) (.cse7 (<= 0 main_~this_buffer_empty~0))) (or (and .cse0 (and (= main_~q~0 1) .cse1 .cse2 .cse3 .cse4)) (and .cse5 .cse2 (= main_~q~0 3) .cse4 .cse6 .cse7) (and .cse5 .cse1 .cse2 (= main_~q~0 4) .cse3 .cse4) (and .cse0 (<= 5 main_~q~0) .cse2 .cse4 .cse6 .cse7) (and (<= main_~this_expect~0 0) (= main_~q~0 0) (<= 0 main_~this_expect~0) .cse6 .cse7))) [2018-11-10 09:32:00,402 INFO L425 ceAbstractionStarter]: For program point L524(lines 524 539) no Hoare annotation was computed. [2018-11-10 09:32:00,402 INFO L425 ceAbstractionStarter]: For program point L392(lines 392 407) no Hoare annotation was computed. [2018-11-10 09:32:00,402 INFO L425 ceAbstractionStarter]: For program point L359(lines 359 458) no Hoare annotation was computed. [2018-11-10 09:32:00,402 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 337) no Hoare annotation was computed. [2018-11-10 09:32:00,402 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 275) no Hoare annotation was computed. [2018-11-10 09:32:00,402 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 205) no Hoare annotation was computed. [2018-11-10 09:32:00,403 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 73) no Hoare annotation was computed. [2018-11-10 09:32:00,403 INFO L425 ceAbstractionStarter]: For program point L492(lines 492 507) no Hoare annotation was computed. [2018-11-10 09:32:00,403 INFO L425 ceAbstractionStarter]: For program point L459(lines 459 558) no Hoare annotation was computed. [2018-11-10 09:32:00,403 INFO L425 ceAbstractionStarter]: For program point L426(lines 426 437) no Hoare annotation was computed. [2018-11-10 09:32:00,403 INFO L425 ceAbstractionStarter]: For program point L360(lines 360 375) no Hoare annotation was computed. [2018-11-10 09:32:00,403 INFO L425 ceAbstractionStarter]: For program point L294(lines 294 305) no Hoare annotation was computed. [2018-11-10 09:32:00,403 INFO L425 ceAbstractionStarter]: For program point L162(lines 162 173) no Hoare annotation was computed. [2018-11-10 09:32:00,403 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 14 566) the Hoare annotation is: true [2018-11-10 09:32:00,403 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 537) no Hoare annotation was computed. [2018-11-10 09:32:00,403 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 475) no Hoare annotation was computed. [2018-11-10 09:32:00,403 INFO L425 ceAbstractionStarter]: For program point L394(lines 394 405) no Hoare annotation was computed. [2018-11-10 09:32:00,403 INFO L425 ceAbstractionStarter]: For program point L262(lines 262 273) no Hoare annotation was computed. [2018-11-10 09:32:00,403 INFO L425 ceAbstractionStarter]: For program point L130(lines 130 132) no Hoare annotation was computed. [2018-11-10 09:32:00,403 INFO L425 ceAbstractionStarter]: For program point L494(lines 494 505) no Hoare annotation was computed. [2018-11-10 09:32:00,404 INFO L425 ceAbstractionStarter]: For program point L362(lines 362 373) no Hoare annotation was computed. [2018-11-10 09:32:00,404 INFO L425 ceAbstractionStarter]: For program point L230(lines 230 232) no Hoare annotation was computed. [2018-11-10 09:32:00,404 INFO L425 ceAbstractionStarter]: For program point L98(lines 98 100) no Hoare annotation was computed. [2018-11-10 09:32:00,404 INFO L425 ceAbstractionStarter]: For program point L462(lines 462 473) no Hoare annotation was computed. [2018-11-10 09:32:00,404 INFO L425 ceAbstractionStarter]: For program point L330(lines 330 332) no Hoare annotation was computed. [2018-11-10 09:32:00,404 INFO L425 ceAbstractionStarter]: For program point L198(lines 198 200) no Hoare annotation was computed. [2018-11-10 09:32:00,404 INFO L425 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2018-11-10 09:32:00,404 INFO L425 ceAbstractionStarter]: For program point L430(lines 430 432) no Hoare annotation was computed. [2018-11-10 09:32:00,404 INFO L425 ceAbstractionStarter]: For program point L298(lines 298 300) no Hoare annotation was computed. [2018-11-10 09:32:00,404 INFO L425 ceAbstractionStarter]: For program point L166(lines 166 168) no Hoare annotation was computed. [2018-11-10 09:32:00,404 INFO L425 ceAbstractionStarter]: For program point L530(lines 530 532) no Hoare annotation was computed. [2018-11-10 09:32:00,404 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 400) no Hoare annotation was computed. [2018-11-10 09:32:00,404 INFO L425 ceAbstractionStarter]: For program point L266(lines 266 268) no Hoare annotation was computed. [2018-11-10 09:32:00,409 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 09:32:00,410 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 09:32:00,410 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 09:32:00,410 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 09:32:00,410 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 09:32:00,411 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 09:32:00,411 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 09:32:00,411 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 09:32:00,417 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 09:32:00,417 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 09:32:00,418 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 09:32:00,418 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 09:32:00,418 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 09:32:00,418 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 09:32:00,418 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 09:32:00,418 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 09:32:00,420 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 09:32:00,420 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 09:32:00,420 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 09:32:00,420 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 09:32:00,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:32:00 BoogieIcfgContainer [2018-11-10 09:32:00,422 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 09:32:00,422 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 09:32:00,422 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 09:32:00,423 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 09:32:00,426 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:31:50" (3/4) ... [2018-11-10 09:32:00,428 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 09:32:00,432 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 09:32:00,432 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 09:32:00,439 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-10 09:32:00,439 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 09:32:00,457 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((this_expect <= 0 && 0 <= this_expect) && q == 0) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == this_expect % 2) && 5 <= q) && 0 <= P8 + 2147483648) && P8 <= 2147483647) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) [2018-11-10 09:32:00,465 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ec8a0596-9c49-4dee-bffd-0bd03e721988/bin-2019/uautomizer/witness.graphml [2018-11-10 09:32:00,465 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 09:32:00,466 INFO L168 Benchmark]: Toolchain (without parser) took 11110.69 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 316.1 MB). Free memory was 960.3 MB in the beginning and 1.1 GB in the end (delta: -97.9 MB). Peak memory consumption was 218.3 MB. Max. memory is 11.5 GB. [2018-11-10 09:32:00,466 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 09:32:00,466 INFO L168 Benchmark]: CACSL2BoogieTranslator took 287.00 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 938.8 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 09:32:00,467 INFO L168 Benchmark]: Boogie Preprocessor took 81.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 938.8 MB in the beginning and 1.1 GB in the end (delta: -198.4 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2018-11-10 09:32:00,467 INFO L168 Benchmark]: RCFGBuilder took 631.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 59.5 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. [2018-11-10 09:32:00,467 INFO L168 Benchmark]: TraceAbstraction took 10064.18 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 177.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.8 MB). Peak memory consumption was 188.5 MB. Max. memory is 11.5 GB. [2018-11-10 09:32:00,467 INFO L168 Benchmark]: Witness Printer took 42.88 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: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. [2018-11-10 09:32:00,469 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.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 287.00 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 938.8 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 81.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 938.8 MB in the beginning and 1.1 GB in the end (delta: -198.4 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 631.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 59.5 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10064.18 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 177.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.8 MB). Peak memory consumption was 188.5 MB. Max. memory is 11.5 GB. * Witness Printer took 42.88 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: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 565]: 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: 24]: Loop Invariant [2018-11-10 09:32:00,477 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 09:32:00,477 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 09:32:00,477 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 09:32:00,477 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 09:32:00,477 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 09:32:00,477 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 09:32:00,478 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 09:32:00,478 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 09:32:00,478 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 09:32:00,479 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 09:32:00,479 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 09:32:00,479 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 09:32:00,479 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 09:32:00,479 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 09:32:00,479 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 09:32:00,479 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] Derived loop invariant: (((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == this_expect % 2) && (((q == 1 && this_buffer_empty <= 1) && 0 <= P8 + 2147483648) && 1 <= this_buffer_empty) && P8 <= 2147483647) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == (this_expect + 1) % 2) && 0 <= P8 + 2147483648) && q == 3) && P8 <= 2147483647) && this_buffer_empty <= 0) && 0 <= this_buffer_empty)) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == (this_expect + 1) % 2) && this_buffer_empty <= 1) && 0 <= P8 + 2147483648) && q == 4) && 1 <= this_buffer_empty) && P8 <= 2147483647)) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == this_expect % 2) && 5 <= q) && 0 <= P8 + 2147483648) && P8 <= 2147483647) && this_buffer_empty <= 0) && 0 <= this_buffer_empty)) || ((((this_expect <= 0 && q == 0) && 0 <= this_expect) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant [2018-11-10 09:32:00,480 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 09:32:00,480 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 09:32:00,480 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] [2018-11-10 09:32:00,480 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~P1~0,QUANTIFIED] Derived loop invariant: ((((this_expect <= 0 && 0 <= this_expect) && q == 0) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) || ((((((\exists main_~P1~0 : int :: main_~P1~0 % 2 == 0 && main_~P1~0 % 2 == this_expect % 2) && 5 <= q) && 0 <= P8 + 2147483648) && P8 <= 2147483647) && this_buffer_empty <= 0) && 0 <= this_buffer_empty) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 114 locations, 1 error locations. SAFE Result, 10.0s OverallTime, 25 OverallIterations, 14 TraceHistogramMax, 3.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 4867 SDtfs, 3418 SDslu, 26182 SDs, 0 SdLazy, 3105 SolverSat, 180 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1517 GetRequests, 1309 SyntacticMatches, 19 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=329occurred in iteration=24, 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.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 96 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 49 NumberOfFragments, 204 HoareAnnotationTreeSize, 7 FomulaSimplifications, 1981 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 1034 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 2852 NumberOfCodeBlocks, 2768 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 2811 ConstructedInterpolants, 42 QuantifiedInterpolants, 2209439 SizeOfPredicates, 57 NumberOfNonLiveVariables, 8173 ConjunctsInSsa, 450 ConjunctsInUnsatCore, 41 InterpolantComputations, 10 PerfectInterpolantSequences, 1038/4848 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...