./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops/insertion_sort_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops/insertion_sort_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/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 9722a10940ebd7a5d75170225a40cd37454d0528 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 11:40:55,659 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:40:55,660 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:40:55,667 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:40:55,668 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:40:55,668 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:40:55,669 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:40:55,670 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:40:55,671 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:40:55,671 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:40:55,672 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:40:55,672 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:40:55,673 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:40:55,673 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:40:55,674 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:40:55,674 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:40:55,675 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:40:55,676 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:40:55,677 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:40:55,678 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:40:55,678 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:40:55,679 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:40:55,680 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:40:55,680 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:40:55,680 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:40:55,681 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:40:55,681 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:40:55,682 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:40:55,682 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:40:55,683 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:40:55,683 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:40:55,684 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:40:55,684 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:40:55,684 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:40:55,685 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:40:55,685 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:40:55,686 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 11:40:55,692 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:40:55,692 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:40:55,693 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 11:40:55,693 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 11:40:55,693 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:40:55,694 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:40:55,694 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:40:55,694 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:40:55,694 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:40:55,694 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:40:55,694 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:40:55,694 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:40:55,695 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 11:40:55,695 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 11:40:55,695 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 11:40:55,695 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:40:55,695 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:40:55,695 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:40:55,695 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 11:40:55,695 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:40:55,696 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:40:55,696 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 11:40:55,696 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 11:40:55,696 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:40:55,696 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:40:55,696 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 11:40:55,696 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 11:40:55,697 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:40:55,697 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 11:40:55,697 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 11:40:55,697 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_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/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 -> 9722a10940ebd7a5d75170225a40cd37454d0528 [2018-11-28 11:40:55,721 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:40:55,730 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:40:55,732 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:40:55,733 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:40:55,734 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:40:55,734 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/bin-2019/uautomizer/../../sv-benchmarks/c/loops/insertion_sort_false-unreach-call_true-termination.i [2018-11-28 11:40:55,778 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/bin-2019/uautomizer/data/e11b082d0/184e5765f4c64629bf1191ec28f8b655/FLAGa06d8fb45 [2018-11-28 11:40:56,164 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:40:56,165 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/sv-benchmarks/c/loops/insertion_sort_false-unreach-call_true-termination.i [2018-11-28 11:40:56,168 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/bin-2019/uautomizer/data/e11b082d0/184e5765f4c64629bf1191ec28f8b655/FLAGa06d8fb45 [2018-11-28 11:40:56,177 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/bin-2019/uautomizer/data/e11b082d0/184e5765f4c64629bf1191ec28f8b655 [2018-11-28 11:40:56,179 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:40:56,180 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:40:56,181 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:40:56,181 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:40:56,183 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:40:56,183 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:40:56" (1/1) ... [2018-11-28 11:40:56,185 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e63cc75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:56, skipping insertion in model container [2018-11-28 11:40:56,185 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:40:56" (1/1) ... [2018-11-28 11:40:56,189 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:40:56,199 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:40:56,299 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:40:56,301 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:40:56,313 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:40:56,324 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:40:56,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:56 WrapperNode [2018-11-28 11:40:56,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:40:56,325 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:40:56,325 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:40:56,325 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:40:56,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:56" (1/1) ... [2018-11-28 11:40:56,338 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:56" (1/1) ... [2018-11-28 11:40:56,344 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:40:56,344 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:40:56,344 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:40:56,345 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:40:56,386 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:56" (1/1) ... [2018-11-28 11:40:56,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:56" (1/1) ... [2018-11-28 11:40:56,388 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:56" (1/1) ... [2018-11-28 11:40:56,388 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:56" (1/1) ... [2018-11-28 11:40:56,394 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:56" (1/1) ... [2018-11-28 11:40:56,398 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:56" (1/1) ... [2018-11-28 11:40:56,399 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:56" (1/1) ... [2018-11-28 11:40:56,400 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:40:56,401 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:40:56,401 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:40:56,401 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:40:56,402 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 11:40:56,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 11:40:56,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 11:40:56,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 11:40:56,437 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 11:40:56,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:40:56,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:40:56,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 11:40:56,438 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 11:40:56,438 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 11:40:56,438 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-28 11:40:56,438 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-28 11:40:56,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 11:40:56,572 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:40:56,572 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-28 11:40:56,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:40:56 BoogieIcfgContainer [2018-11-28 11:40:56,573 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:40:56,573 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 11:40:56,573 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 11:40:56,576 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 11:40:56,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:40:56" (1/3) ... [2018-11-28 11:40:56,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55fee958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:40:56, skipping insertion in model container [2018-11-28 11:40:56,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:40:56" (2/3) ... [2018-11-28 11:40:56,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55fee958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:40:56, skipping insertion in model container [2018-11-28 11:40:56,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:40:56" (3/3) ... [2018-11-28 11:40:56,579 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort_false-unreach-call_true-termination.i [2018-11-28 11:40:56,587 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 11:40:56,594 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 11:40:56,608 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 11:40:56,631 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:40:56,631 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 11:40:56,632 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 11:40:56,632 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 11:40:56,632 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:40:56,632 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:40:56,632 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 11:40:56,632 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:40:56,632 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 11:40:56,647 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-28 11:40:56,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 11:40:56,651 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:40:56,652 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:40:56,653 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:40:56,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:40:56,659 INFO L82 PathProgramCache]: Analyzing trace with hash 342854797, now seen corresponding path program 1 times [2018-11-28 11:40:56,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:40:56,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:40:56,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:56,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:40:56,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:56,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:40:56,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:40:56,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:40:56,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:40:56,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 11:40:56,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:40:56,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:40:56,852 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 5 states. [2018-11-28 11:40:56,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:40:56,931 INFO L93 Difference]: Finished difference Result 67 states and 92 transitions. [2018-11-28 11:40:56,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:40:56,933 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-28 11:40:56,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:40:56,939 INFO L225 Difference]: With dead ends: 67 [2018-11-28 11:40:56,939 INFO L226 Difference]: Without dead ends: 33 [2018-11-28 11:40:56,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:40:56,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-28 11:40:56,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2018-11-28 11:40:56,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-28 11:40:56,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-28 11:40:56,962 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 13 [2018-11-28 11:40:56,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:40:56,962 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-28 11:40:56,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 11:40:56,963 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-28 11:40:56,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 11:40:56,963 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:40:56,963 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:40:56,964 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:40:56,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:40:56,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1336061280, now seen corresponding path program 1 times [2018-11-28 11:40:56,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:40:56,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:40:56,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:56,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:40:56,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:40:57,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:40:57,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:40:57,302 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:40:57,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:40:57,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:40:57,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:40:57,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-28 11:40:57,549 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:40:57,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-11-28 11:40:57,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:40:57,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:40:57,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:40:57,569 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-11-28 11:40:57,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-11-28 11:40:57,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-28 11:40:57,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:40:57,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:40:57,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:40:57,600 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-28 11:40:57,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:40:57,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:40:57,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-11-28 11:40:57,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 11:40:57,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 11:40:57,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-11-28 11:40:57,632 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 17 states. [2018-11-28 11:40:58,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:40:58,020 INFO L93 Difference]: Finished difference Result 86 states and 109 transitions. [2018-11-28 11:40:58,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 11:40:58,020 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 19 [2018-11-28 11:40:58,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:40:58,022 INFO L225 Difference]: With dead ends: 86 [2018-11-28 11:40:58,022 INFO L226 Difference]: Without dead ends: 67 [2018-11-28 11:40:58,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2018-11-28 11:40:58,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-28 11:40:58,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 44. [2018-11-28 11:40:58,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-28 11:40:58,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2018-11-28 11:40:58,031 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 19 [2018-11-28 11:40:58,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:40:58,031 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-11-28 11:40:58,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 11:40:58,031 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-28 11:40:58,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 11:40:58,032 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:40:58,032 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:40:58,032 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:40:58,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:40:58,033 INFO L82 PathProgramCache]: Analyzing trace with hash -455852680, now seen corresponding path program 1 times [2018-11-28 11:40:58,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:40:58,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:40:58,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:58,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:40:58,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:40:58,414 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:40:58,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:40:58,414 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:40:58,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:40:58,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:40:58,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:40:58,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-11-28 11:40:58,513 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:40:58,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 47 [2018-11-28 11:40:58,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:40:58,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:40:58,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:40:58,523 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2018-11-28 11:40:58,688 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:40:58,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-11-28 11:40:58,692 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:40:58,693 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:40:58,694 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:40:58,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 72 [2018-11-28 11:40:58,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:40:58,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:40:58,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:40:58,709 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:29 [2018-11-28 11:40:58,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-11-28 11:40:58,763 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:40:58,763 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:40:58,766 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:40:58,766 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:40:58,767 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:40:58,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 49 [2018-11-28 11:40:58,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:40:58,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:40:58,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:40:58,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2018-11-28 11:40:58,788 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:40:58,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:40:58,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 28 [2018-11-28 11:40:58,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-28 11:40:58,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-28 11:40:58,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2018-11-28 11:40:58,803 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 28 states. [2018-11-28 11:40:59,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:40:59,385 INFO L93 Difference]: Finished difference Result 130 states and 165 transitions. [2018-11-28 11:40:59,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-28 11:40:59,386 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 24 [2018-11-28 11:40:59,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:40:59,388 INFO L225 Difference]: With dead ends: 130 [2018-11-28 11:40:59,388 INFO L226 Difference]: Without dead ends: 95 [2018-11-28 11:40:59,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=260, Invalid=1546, Unknown=0, NotChecked=0, Total=1806 [2018-11-28 11:40:59,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-28 11:40:59,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 58. [2018-11-28 11:40:59,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-28 11:40:59,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2018-11-28 11:40:59,396 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 24 [2018-11-28 11:40:59,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:40:59,396 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2018-11-28 11:40:59,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-28 11:40:59,397 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2018-11-28 11:40:59,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 11:40:59,398 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:40:59,398 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:40:59,398 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:40:59,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:40:59,398 INFO L82 PathProgramCache]: Analyzing trace with hash 2042668019, now seen corresponding path program 2 times [2018-11-28 11:40:59,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:40:59,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:40:59,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:59,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:40:59,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:40:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:40:59,633 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:40:59,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:40:59,633 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:40:59,640 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 11:40:59,661 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 11:40:59,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:40:59,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:40:59,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-28 11:40:59,716 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:40:59,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-11-28 11:40:59,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:40:59,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:40:59,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:40:59,728 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-11-28 11:40:59,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-11-28 11:40:59,783 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:40:59,784 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:40:59,785 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:40:59,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-11-28 11:40:59,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:40:59,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:40:59,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:40:59,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:25 [2018-11-28 11:40:59,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-11-28 11:40:59,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-28 11:40:59,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:40:59,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:40:59,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:40:59,847 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-28 11:40:59,864 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:40:59,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:40:59,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 18 [2018-11-28 11:40:59,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-28 11:40:59,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-28 11:40:59,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-11-28 11:40:59,881 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand 18 states. [2018-11-28 11:41:00,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:41:00,438 INFO L93 Difference]: Finished difference Result 147 states and 183 transitions. [2018-11-28 11:41:00,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-28 11:41:00,438 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2018-11-28 11:41:00,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:41:00,440 INFO L225 Difference]: With dead ends: 147 [2018-11-28 11:41:00,440 INFO L226 Difference]: Without dead ends: 128 [2018-11-28 11:41:00,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 16 SyntacticMatches, 7 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=932, Unknown=0, NotChecked=0, Total=1122 [2018-11-28 11:41:00,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-28 11:41:00,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 68. [2018-11-28 11:41:00,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-28 11:41:00,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 86 transitions. [2018-11-28 11:41:00,449 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 86 transitions. Word has length 25 [2018-11-28 11:41:00,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:41:00,449 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 86 transitions. [2018-11-28 11:41:00,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-28 11:41:00,450 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 86 transitions. [2018-11-28 11:41:00,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 11:41:00,450 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:41:00,450 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:41:00,451 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:41:00,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:00,451 INFO L82 PathProgramCache]: Analyzing trace with hash 2145817879, now seen corresponding path program 1 times [2018-11-28 11:41:00,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:41:00,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:41:00,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:00,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:41:00,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:00,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:00,525 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:00,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:41:00,526 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:41:00,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:41:00,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:00,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:41:00,593 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:00,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:41:00,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-11-28 11:41:00,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 11:41:00,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 11:41:00,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-28 11:41:00,609 INFO L87 Difference]: Start difference. First operand 68 states and 86 transitions. Second operand 9 states. [2018-11-28 11:41:00,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:41:00,666 INFO L93 Difference]: Finished difference Result 119 states and 148 transitions. [2018-11-28 11:41:00,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:41:00,667 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-11-28 11:41:00,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:41:00,668 INFO L225 Difference]: With dead ends: 119 [2018-11-28 11:41:00,668 INFO L226 Difference]: Without dead ends: 103 [2018-11-28 11:41:00,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:41:00,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-28 11:41:00,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 76. [2018-11-28 11:41:00,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-28 11:41:00,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2018-11-28 11:41:00,676 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 27 [2018-11-28 11:41:00,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:41:00,676 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2018-11-28 11:41:00,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 11:41:00,677 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2018-11-28 11:41:00,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 11:41:00,677 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:41:00,677 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:41:00,677 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:41:00,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:00,677 INFO L82 PathProgramCache]: Analyzing trace with hash 504300867, now seen corresponding path program 1 times [2018-11-28 11:41:00,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:41:00,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:41:00,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:00,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:41:00,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:00,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:00,846 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:00,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:41:00,847 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:41:00,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:41:00,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:00,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:41:00,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-28 11:41:00,950 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:00,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-28 11:41:00,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:00,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:00,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:00,959 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-11-28 11:41:00,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-11-28 11:41:00,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-28 11:41:00,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:00,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:00,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:00,987 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-28 11:41:00,997 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:01,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:41:01,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 17 [2018-11-28 11:41:01,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 11:41:01,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 11:41:01,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2018-11-28 11:41:01,023 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand 17 states. [2018-11-28 11:41:01,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:41:01,498 INFO L93 Difference]: Finished difference Result 211 states and 273 transitions. [2018-11-28 11:41:01,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-28 11:41:01,498 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2018-11-28 11:41:01,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:41:01,499 INFO L225 Difference]: With dead ends: 211 [2018-11-28 11:41:01,499 INFO L226 Difference]: Without dead ends: 166 [2018-11-28 11:41:01,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=392, Invalid=1330, Unknown=0, NotChecked=0, Total=1722 [2018-11-28 11:41:01,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-28 11:41:01,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 86. [2018-11-28 11:41:01,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-28 11:41:01,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 108 transitions. [2018-11-28 11:41:01,513 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 108 transitions. Word has length 30 [2018-11-28 11:41:01,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:41:01,513 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 108 transitions. [2018-11-28 11:41:01,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 11:41:01,514 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2018-11-28 11:41:01,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 11:41:01,514 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:41:01,514 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:41:01,515 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:41:01,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:01,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1205365445, now seen corresponding path program 2 times [2018-11-28 11:41:01,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:41:01,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:41:01,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:01,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:41:01,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:01,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:01,550 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:01,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:41:01,551 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:41:01,565 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 11:41:01,578 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 11:41:01,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:41:01,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:41:01,583 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:01,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:41:01,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-28 11:41:01,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 11:41:01,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:41:01,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:41:01,600 INFO L87 Difference]: Start difference. First operand 86 states and 108 transitions. Second operand 7 states. [2018-11-28 11:41:01,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:41:01,688 INFO L93 Difference]: Finished difference Result 165 states and 212 transitions. [2018-11-28 11:41:01,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 11:41:01,689 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-11-28 11:41:01,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:41:01,690 INFO L225 Difference]: With dead ends: 165 [2018-11-28 11:41:01,690 INFO L226 Difference]: Without dead ends: 104 [2018-11-28 11:41:01,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-11-28 11:41:01,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-28 11:41:01,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 76. [2018-11-28 11:41:01,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-28 11:41:01,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2018-11-28 11:41:01,699 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 30 [2018-11-28 11:41:01,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:41:01,700 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2018-11-28 11:41:01,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 11:41:01,700 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2018-11-28 11:41:01,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 11:41:01,701 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:41:01,701 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:41:01,701 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:41:01,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:01,701 INFO L82 PathProgramCache]: Analyzing trace with hash 488358411, now seen corresponding path program 3 times [2018-11-28 11:41:01,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:41:01,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:41:01,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:01,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:41:01,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:01,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:02,024 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:02,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:41:02,024 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/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-28 11:41:02,031 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 11:41:02,044 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-28 11:41:02,044 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:41:02,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:41:02,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-11-28 11:41:02,068 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:41:02,069 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:02,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 71 [2018-11-28 11:41:02,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:02,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:02,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:02,086 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2018-11-28 11:41:02,135 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:02,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2018-11-28 11:41:02,139 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:02,140 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:02,141 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:41:02,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 72 [2018-11-28 11:41:02,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:02,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:02,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:02,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:32 [2018-11-28 11:41:02,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-11-28 11:41:02,279 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:02,279 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:02,280 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:02,281 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:02,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2018-11-28 11:41:02,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:02,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:02,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:41:02,313 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:36 [2018-11-28 11:41:02,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-11-28 11:41:02,352 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:02,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-28 11:41:02,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:02,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:02,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:02,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-11-28 11:41:02,389 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:02,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:41:02,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 24 [2018-11-28 11:41:02,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-28 11:41:02,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-28 11:41:02,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2018-11-28 11:41:02,417 INFO L87 Difference]: Start difference. First operand 76 states and 90 transitions. Second operand 24 states. [2018-11-28 11:41:03,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:41:03,157 INFO L93 Difference]: Finished difference Result 135 states and 160 transitions. [2018-11-28 11:41:03,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-28 11:41:03,157 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2018-11-28 11:41:03,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:41:03,158 INFO L225 Difference]: With dead ends: 135 [2018-11-28 11:41:03,158 INFO L226 Difference]: Without dead ends: 133 [2018-11-28 11:41:03,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 18 SyntacticMatches, 8 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=248, Invalid=1392, Unknown=0, NotChecked=0, Total=1640 [2018-11-28 11:41:03,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-28 11:41:03,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 70. [2018-11-28 11:41:03,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-28 11:41:03,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2018-11-28 11:41:03,165 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 30 [2018-11-28 11:41:03,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:41:03,165 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2018-11-28 11:41:03,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-28 11:41:03,165 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2018-11-28 11:41:03,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 11:41:03,166 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:41:03,166 INFO L402 BasicCegarLoop]: trace histogram [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-28 11:41:03,166 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:41:03,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:03,166 INFO L82 PathProgramCache]: Analyzing trace with hash 586827946, now seen corresponding path program 2 times [2018-11-28 11:41:03,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:41:03,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:41:03,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:03,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:41:03,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:03,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:03,419 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:03,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:41:03,419 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/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-28 11:41:03,425 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 11:41:03,439 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 11:41:03,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:41:03,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:41:03,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-28 11:41:03,543 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:03,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-28 11:41:03,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:03,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:03,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:03,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-11-28 11:41:03,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-11-28 11:41:03,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-28 11:41:03,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:03,693 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:03,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:03,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-28 11:41:03,731 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:03,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:41:03,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2018-11-28 11:41:03,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-28 11:41:03,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-28 11:41:03,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=728, Unknown=0, NotChecked=0, Total=812 [2018-11-28 11:41:03,749 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand 29 states. [2018-11-28 11:41:24,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:41:24,414 INFO L93 Difference]: Finished difference Result 131 states and 153 transitions. [2018-11-28 11:41:24,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-28 11:41:24,414 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 33 [2018-11-28 11:41:24,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:41:24,415 INFO L225 Difference]: With dead ends: 131 [2018-11-28 11:41:24,415 INFO L226 Difference]: Without dead ends: 129 [2018-11-28 11:41:24,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=264, Invalid=1898, Unknown=0, NotChecked=0, Total=2162 [2018-11-28 11:41:24,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-28 11:41:24,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 82. [2018-11-28 11:41:24,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-28 11:41:24,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2018-11-28 11:41:24,426 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 96 transitions. Word has length 33 [2018-11-28 11:41:24,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:41:24,426 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 96 transitions. [2018-11-28 11:41:24,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-28 11:41:24,426 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 96 transitions. [2018-11-28 11:41:24,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-28 11:41:24,427 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:41:24,427 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:41:24,427 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:41:24,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:24,427 INFO L82 PathProgramCache]: Analyzing trace with hash 853695349, now seen corresponding path program 4 times [2018-11-28 11:41:24,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:41:24,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:41:24,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:24,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:41:24,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:24,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:24,741 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:24,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:41:24,741 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/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-28 11:41:24,747 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 11:41:24,759 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 11:41:24,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:41:24,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:41:24,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-11-28 11:41:24,816 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:24,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 47 [2018-11-28 11:41:24,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:24,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:24,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:24,824 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-11-28 11:41:25,398 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:25,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-11-28 11:41:25,401 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:25,402 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:25,402 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:41:25,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 73 [2018-11-28 11:41:25,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:25,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:25,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 11:41:25,416 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:61, output treesize:35 [2018-11-28 11:41:25,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-11-28 11:41:25,477 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:41:25,479 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:25,480 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:25,480 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:41:25,481 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:25,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 63 [2018-11-28 11:41:25,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:25,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:25,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:25,522 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:51, output treesize:5 [2018-11-28 11:41:25,531 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 11:41:25,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:41:25,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 28 [2018-11-28 11:41:25,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-28 11:41:25,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-28 11:41:25,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2018-11-28 11:41:25,562 INFO L87 Difference]: Start difference. First operand 82 states and 96 transitions. Second operand 28 states. [2018-11-28 11:41:26,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:41:26,656 INFO L93 Difference]: Finished difference Result 168 states and 202 transitions. [2018-11-28 11:41:26,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-28 11:41:26,656 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 35 [2018-11-28 11:41:26,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:41:26,657 INFO L225 Difference]: With dead ends: 168 [2018-11-28 11:41:26,658 INFO L226 Difference]: Without dead ends: 126 [2018-11-28 11:41:26,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=425, Invalid=2545, Unknown=0, NotChecked=0, Total=2970 [2018-11-28 11:41:26,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-28 11:41:26,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 85. [2018-11-28 11:41:26,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-28 11:41:26,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2018-11-28 11:41:26,673 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 35 [2018-11-28 11:41:26,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:41:26,674 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2018-11-28 11:41:26,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-28 11:41:26,674 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2018-11-28 11:41:26,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-28 11:41:26,675 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:41:26,675 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:41:26,675 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:41:26,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:26,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1400428558, now seen corresponding path program 1 times [2018-11-28 11:41:26,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:41:26,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:41:26,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:26,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:41:26,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:26,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:27,102 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:27,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:41:27,102 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/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-28 11:41:27,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:41:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:27,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:41:27,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-28 11:41:27,188 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:27,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-11-28 11:41:27,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:27,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:27,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:27,202 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-11-28 11:41:27,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-11-28 11:41:27,285 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-28 11:41:27,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:27,287 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:27,288 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:27,289 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:27,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 43 [2018-11-28 11:41:27,292 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:27,297 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:27,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:27,301 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:35, output treesize:17 [2018-11-28 11:41:27,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-11-28 11:41:27,366 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:27,368 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:27,369 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:27,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-11-28 11:41:27,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:27,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:27,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:27,393 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-11-28 11:41:27,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-11-28 11:41:27,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-28 11:41:27,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:27,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:27,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:27,419 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-28 11:41:27,432 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 11:41:27,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:41:27,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 21 [2018-11-28 11:41:27,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 11:41:27,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 11:41:27,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2018-11-28 11:41:27,450 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand 21 states. [2018-11-28 11:41:27,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:41:27,985 INFO L93 Difference]: Finished difference Result 242 states and 289 transitions. [2018-11-28 11:41:27,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-28 11:41:27,986 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 36 [2018-11-28 11:41:27,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:41:27,987 INFO L225 Difference]: With dead ends: 242 [2018-11-28 11:41:27,987 INFO L226 Difference]: Without dead ends: 197 [2018-11-28 11:41:27,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 22 SyntacticMatches, 14 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=197, Invalid=1135, Unknown=0, NotChecked=0, Total=1332 [2018-11-28 11:41:27,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-11-28 11:41:27,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 121. [2018-11-28 11:41:27,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-11-28 11:41:28,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 145 transitions. [2018-11-28 11:41:28,000 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 145 transitions. Word has length 36 [2018-11-28 11:41:28,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:41:28,000 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 145 transitions. [2018-11-28 11:41:28,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 11:41:28,000 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 145 transitions. [2018-11-28 11:41:28,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-28 11:41:28,001 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:41:28,001 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:41:28,002 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:41:28,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:28,002 INFO L82 PathProgramCache]: Analyzing trace with hash -311016042, now seen corresponding path program 2 times [2018-11-28 11:41:28,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:41:28,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:41:28,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:28,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:41:28,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:28,347 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:28,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:41:28,347 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/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-28 11:41:28,356 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 11:41:28,370 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 11:41:28,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:41:28,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:41:28,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-28 11:41:28,541 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:28,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-11-28 11:41:28,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:28,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:28,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:41:28,557 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2018-11-28 11:41:28,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-11-28 11:41:28,626 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:28,627 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:28,628 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:28,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-11-28 11:41:28,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:28,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:28,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:28,642 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:19 [2018-11-28 11:41:28,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-11-28 11:41:28,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-28 11:41:28,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:28,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:28,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:28,662 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-28 11:41:28,673 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:28,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:41:28,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2018-11-28 11:41:28,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-28 11:41:28,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-28 11:41:28,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=495, Unknown=0, NotChecked=0, Total=600 [2018-11-28 11:41:28,690 INFO L87 Difference]: Start difference. First operand 121 states and 145 transitions. Second operand 25 states. [2018-11-28 11:41:29,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:41:29,425 INFO L93 Difference]: Finished difference Result 246 states and 295 transitions. [2018-11-28 11:41:29,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-28 11:41:29,425 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 36 [2018-11-28 11:41:29,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:41:29,426 INFO L225 Difference]: With dead ends: 246 [2018-11-28 11:41:29,427 INFO L226 Difference]: Without dead ends: 201 [2018-11-28 11:41:29,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=350, Invalid=1630, Unknown=0, NotChecked=0, Total=1980 [2018-11-28 11:41:29,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-11-28 11:41:29,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 133. [2018-11-28 11:41:29,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-28 11:41:29,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 161 transitions. [2018-11-28 11:41:29,448 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 161 transitions. Word has length 36 [2018-11-28 11:41:29,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:41:29,449 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 161 transitions. [2018-11-28 11:41:29,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-28 11:41:29,449 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 161 transitions. [2018-11-28 11:41:29,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-28 11:41:29,450 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:41:29,450 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-11-28 11:41:29,450 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:41:29,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:29,450 INFO L82 PathProgramCache]: Analyzing trace with hash -591767046, now seen corresponding path program 1 times [2018-11-28 11:41:29,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:41:29,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:41:29,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:29,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:41:29,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:29,741 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:29,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:41:29,741 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/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-28 11:41:29,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:41:29,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:29,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:41:29,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-11-28 11:41:29,869 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:29,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 47 [2018-11-28 11:41:29,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:29,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:29,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:29,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2018-11-28 11:41:29,978 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:29,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 45 [2018-11-28 11:41:29,985 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:29,986 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:41:29,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 49 [2018-11-28 11:41:29,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:29,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:30,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:41:30,000 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:30 [2018-11-28 11:41:30,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2018-11-28 11:41:30,209 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:30,210 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:41:30,211 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:30,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 31 [2018-11-28 11:41:30,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:30,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:30,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:30,220 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:5 [2018-11-28 11:41:30,257 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:30,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:41:30,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2018-11-28 11:41:30,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-28 11:41:30,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-28 11:41:30,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1151, Unknown=0, NotChecked=0, Total=1260 [2018-11-28 11:41:30,274 INFO L87 Difference]: Start difference. First operand 133 states and 161 transitions. Second operand 36 states. [2018-11-28 11:41:31,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:41:31,000 INFO L93 Difference]: Finished difference Result 192 states and 227 transitions. [2018-11-28 11:41:31,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-28 11:41:31,000 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 38 [2018-11-28 11:41:31,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:41:31,001 INFO L225 Difference]: With dead ends: 192 [2018-11-28 11:41:31,001 INFO L226 Difference]: Without dead ends: 190 [2018-11-28 11:41:31,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=258, Invalid=2394, Unknown=0, NotChecked=0, Total=2652 [2018-11-28 11:41:31,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-11-28 11:41:31,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 140. [2018-11-28 11:41:31,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-28 11:41:31,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 170 transitions. [2018-11-28 11:41:31,017 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 170 transitions. Word has length 38 [2018-11-28 11:41:31,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:41:31,017 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 170 transitions. [2018-11-28 11:41:31,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-28 11:41:31,018 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 170 transitions. [2018-11-28 11:41:31,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-28 11:41:31,018 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:41:31,018 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:41:31,018 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:41:31,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:31,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1198506493, now seen corresponding path program 3 times [2018-11-28 11:41:31,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:41:31,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:41:31,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:31,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:41:31,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:31,348 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:31,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:41:31,348 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/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-28 11:41:31,356 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 11:41:31,378 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-28 11:41:31,378 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:41:31,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:41:31,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-28 11:41:31,484 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:31,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-11-28 11:41:31,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:31,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:31,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:31,496 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-11-28 11:41:31,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-11-28 11:41:31,555 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:31,556 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:31,556 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:31,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-11-28 11:41:31,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:31,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:31,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:31,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-11-28 11:41:31,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-11-28 11:41:31,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-28 11:41:31,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:31,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:31,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:31,720 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-28 11:41:31,758 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:31,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:41:31,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 33 [2018-11-28 11:41:31,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-28 11:41:31,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-28 11:41:31,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=940, Unknown=0, NotChecked=0, Total=1056 [2018-11-28 11:41:31,774 INFO L87 Difference]: Start difference. First operand 140 states and 170 transitions. Second operand 33 states. [2018-11-28 11:41:44,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:41:44,498 INFO L93 Difference]: Finished difference Result 266 states and 316 transitions. [2018-11-28 11:41:44,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-28 11:41:44,498 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 39 [2018-11-28 11:41:44,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:41:44,499 INFO L225 Difference]: With dead ends: 266 [2018-11-28 11:41:44,500 INFO L226 Difference]: Without dead ends: 209 [2018-11-28 11:41:44,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=350, Invalid=2406, Unknown=0, NotChecked=0, Total=2756 [2018-11-28 11:41:44,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-11-28 11:41:44,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 139. [2018-11-28 11:41:44,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-28 11:41:44,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 168 transitions. [2018-11-28 11:41:44,516 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 168 transitions. Word has length 39 [2018-11-28 11:41:44,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:41:44,517 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 168 transitions. [2018-11-28 11:41:44,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-28 11:41:44,517 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 168 transitions. [2018-11-28 11:41:44,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-28 11:41:44,517 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:41:44,517 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:41:44,517 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:41:44,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:44,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1463502433, now seen corresponding path program 4 times [2018-11-28 11:41:44,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:41:44,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:41:44,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:44,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:41:44,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:44,595 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 11:41:44,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:41:44,595 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/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-28 11:41:44,601 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 11:41:44,612 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 11:41:44,612 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:41:44,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:41:44,654 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 11:41:44,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:41:44,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-11-28 11:41:44,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 11:41:44,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 11:41:44,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-28 11:41:44,669 INFO L87 Difference]: Start difference. First operand 139 states and 168 transitions. Second operand 12 states. [2018-11-28 11:41:44,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:41:44,762 INFO L93 Difference]: Finished difference Result 221 states and 266 transitions. [2018-11-28 11:41:44,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 11:41:44,762 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-11-28 11:41:44,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:41:44,763 INFO L225 Difference]: With dead ends: 221 [2018-11-28 11:41:44,763 INFO L226 Difference]: Without dead ends: 201 [2018-11-28 11:41:44,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2018-11-28 11:41:44,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-11-28 11:41:44,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 157. [2018-11-28 11:41:44,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-28 11:41:44,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 186 transitions. [2018-11-28 11:41:44,781 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 186 transitions. Word has length 41 [2018-11-28 11:41:44,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:41:44,781 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 186 transitions. [2018-11-28 11:41:44,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 11:41:44,781 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 186 transitions. [2018-11-28 11:41:44,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-28 11:41:44,782 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:41:44,783 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:41:44,783 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:41:44,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:44,783 INFO L82 PathProgramCache]: Analyzing trace with hash -2065125816, now seen corresponding path program 5 times [2018-11-28 11:41:44,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:41:44,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:41:44,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:44,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:41:44,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:44,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:45,163 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:45,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:41:45,164 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/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-28 11:41:45,172 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 11:41:45,198 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-28 11:41:45,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:41:45,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:41:45,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-11-28 11:41:45,352 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:45,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 47 [2018-11-28 11:41:45,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:45,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:45,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:45,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:48 [2018-11-28 11:41:45,414 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:45,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2018-11-28 11:41:45,422 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:45,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-11-28 11:41:45,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:45,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:45,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:45,433 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:33 [2018-11-28 11:41:45,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-11-28 11:41:45,489 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:45,490 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:45,490 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:45,498 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:45,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2018-11-28 11:41:45,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:45,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:45,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:45,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:21 [2018-11-28 11:41:45,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-11-28 11:41:45,531 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:45,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-28 11:41:45,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:45,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:45,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:45,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-11-28 11:41:45,548 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 20 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:41:45,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:41:45,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 30 [2018-11-28 11:41:45,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-28 11:41:45,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-28 11:41:45,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=723, Unknown=0, NotChecked=0, Total=870 [2018-11-28 11:41:45,565 INFO L87 Difference]: Start difference. First operand 157 states and 186 transitions. Second operand 30 states. [2018-11-28 11:41:46,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:41:46,500 INFO L93 Difference]: Finished difference Result 305 states and 364 transitions. [2018-11-28 11:41:46,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-28 11:41:46,501 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 41 [2018-11-28 11:41:46,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:41:46,502 INFO L225 Difference]: With dead ends: 305 [2018-11-28 11:41:46,502 INFO L226 Difference]: Without dead ends: 248 [2018-11-28 11:41:46,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=477, Invalid=2715, Unknown=0, NotChecked=0, Total=3192 [2018-11-28 11:41:46,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-11-28 11:41:46,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 168. [2018-11-28 11:41:46,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-28 11:41:46,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 198 transitions. [2018-11-28 11:41:46,530 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 198 transitions. Word has length 41 [2018-11-28 11:41:46,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:41:46,530 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 198 transitions. [2018-11-28 11:41:46,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-28 11:41:46,530 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 198 transitions. [2018-11-28 11:41:46,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-28 11:41:46,531 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:41:46,531 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:41:46,531 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:41:46,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:46,531 INFO L82 PathProgramCache]: Analyzing trace with hash 591821558, now seen corresponding path program 1 times [2018-11-28 11:41:46,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:41:46,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:41:46,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:46,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:41:46,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:47,000 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 1 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:47,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:41:47,000 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/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-28 11:41:47,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:41:47,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:47,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:41:47,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-11-28 11:41:47,097 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:41:47,098 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:47,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 71 [2018-11-28 11:41:47,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:47,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:47,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:47,112 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2018-11-28 11:41:47,269 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:47,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2018-11-28 11:41:47,273 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:47,273 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:47,274 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:41:47,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 72 [2018-11-28 11:41:47,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:47,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:47,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:47,287 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2018-11-28 11:41:47,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-11-28 11:41:47,350 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:47,351 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:47,351 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:47,352 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:47,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2018-11-28 11:41:47,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:47,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:47,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:41:47,368 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:36 [2018-11-28 11:41:47,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-11-28 11:41:47,420 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:47,421 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:47,422 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:47,423 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:47,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2018-11-28 11:41:47,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:47,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:47,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:47,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:21 [2018-11-28 11:41:47,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-11-28 11:41:47,452 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:47,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-28 11:41:47,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:47,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:47,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:47,455 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-11-28 11:41:47,484 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 11:41:47,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:41:47,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 31 [2018-11-28 11:41:47,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-28 11:41:47,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-28 11:41:47,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=814, Unknown=0, NotChecked=0, Total=930 [2018-11-28 11:41:47,499 INFO L87 Difference]: Start difference. First operand 168 states and 198 transitions. Second operand 31 states. [2018-11-28 11:41:48,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:41:48,184 INFO L93 Difference]: Finished difference Result 306 states and 365 transitions. [2018-11-28 11:41:48,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-28 11:41:48,185 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 41 [2018-11-28 11:41:48,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:41:48,186 INFO L225 Difference]: With dead ends: 306 [2018-11-28 11:41:48,186 INFO L226 Difference]: Without dead ends: 238 [2018-11-28 11:41:48,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 24 SyntacticMatches, 10 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=280, Invalid=1882, Unknown=0, NotChecked=0, Total=2162 [2018-11-28 11:41:48,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-11-28 11:41:48,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 174. [2018-11-28 11:41:48,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-11-28 11:41:48,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 206 transitions. [2018-11-28 11:41:48,208 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 206 transitions. Word has length 41 [2018-11-28 11:41:48,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:41:48,209 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 206 transitions. [2018-11-28 11:41:48,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-28 11:41:48,209 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 206 transitions. [2018-11-28 11:41:48,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-28 11:41:48,209 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:41:48,209 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:41:48,209 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:41:48,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:48,210 INFO L82 PathProgramCache]: Analyzing trace with hash 2135659553, now seen corresponding path program 2 times [2018-11-28 11:41:48,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:41:48,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:41:48,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:48,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:41:48,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:48,606 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:48,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:41:48,606 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:41:48,621 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 11:41:48,670 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 11:41:48,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:41:48,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:41:48,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-28 11:41:48,822 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:48,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-11-28 11:41:48,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:48,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:48,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:48,848 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-11-28 11:41:48,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-11-28 11:41:48,968 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-28 11:41:48,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:48,970 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:48,971 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:48,972 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:48,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 66 [2018-11-28 11:41:48,975 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:48,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:48,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:48,986 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:47, output treesize:25 [2018-11-28 11:41:49,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-11-28 11:41:49,035 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:49,036 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:49,036 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:49,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-11-28 11:41:49,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:49,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:49,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:49,049 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:29 [2018-11-28 11:41:49,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-11-28 11:41:49,077 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:49,078 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:49,079 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:49,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-11-28 11:41:49,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:49,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:49,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:49,090 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:19 [2018-11-28 11:41:49,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-11-28 11:41:49,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-28 11:41:49,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:49,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:49,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:49,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-28 11:41:49,119 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 4 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:49,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:41:49,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 25 [2018-11-28 11:41:49,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-28 11:41:49,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-28 11:41:49,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2018-11-28 11:41:49,134 INFO L87 Difference]: Start difference. First operand 174 states and 206 transitions. Second operand 25 states. [2018-11-28 11:41:50,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:41:50,059 INFO L93 Difference]: Finished difference Result 371 states and 447 transitions. [2018-11-28 11:41:50,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-28 11:41:50,060 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 42 [2018-11-28 11:41:50,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:41:50,061 INFO L225 Difference]: With dead ends: 371 [2018-11-28 11:41:50,061 INFO L226 Difference]: Without dead ends: 303 [2018-11-28 11:41:50,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 26 SyntacticMatches, 15 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=347, Invalid=2005, Unknown=0, NotChecked=0, Total=2352 [2018-11-28 11:41:50,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-11-28 11:41:50,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 171. [2018-11-28 11:41:50,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-28 11:41:50,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 201 transitions. [2018-11-28 11:41:50,103 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 201 transitions. Word has length 42 [2018-11-28 11:41:50,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:41:50,103 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 201 transitions. [2018-11-28 11:41:50,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-28 11:41:50,104 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 201 transitions. [2018-11-28 11:41:50,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-28 11:41:50,104 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:41:50,104 INFO L402 BasicCegarLoop]: trace histogram [4, 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] [2018-11-28 11:41:50,104 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:41:50,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:41:50,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1630887468, now seen corresponding path program 1 times [2018-11-28 11:41:50,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:41:50,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:41:50,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:50,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:41:50,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:41:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:50,803 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:50,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:41:50,803 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:41:50,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:41:50,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:41:50,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:41:50,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-28 11:41:50,873 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:50,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-11-28 11:41:50,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:50,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:50,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:50,882 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-11-28 11:41:50,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2018-11-28 11:41:50,914 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:41:50,915 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:50,915 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:50,916 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:50,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 77 [2018-11-28 11:41:50,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:50,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:50,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:50,929 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2018-11-28 11:41:51,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 47 [2018-11-28 11:41:51,077 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:51,078 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:51,079 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:51,080 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:51,080 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:51,081 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:51,081 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:41:51,082 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:41:51,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 131 [2018-11-28 11:41:51,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:51,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:51,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:41:51,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:80, output treesize:54 [2018-11-28 11:41:51,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2018-11-28 11:41:51,272 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:51,273 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:51,274 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:41:51,274 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:41:51,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 85 [2018-11-28 11:41:51,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:51,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:51,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:41:51,294 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:78, output treesize:30 [2018-11-28 11:41:51,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-11-28 11:41:51,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-28 11:41:51,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:41:51,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:51,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:41:51,441 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-28 11:41:51,485 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:41:51,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:41:51,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 43 [2018-11-28 11:41:51,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-28 11:41:51,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-28 11:41:51,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1633, Unknown=0, NotChecked=0, Total=1806 [2018-11-28 11:41:51,500 INFO L87 Difference]: Start difference. First operand 171 states and 201 transitions. Second operand 43 states. [2018-11-28 11:42:09,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:42:09,138 INFO L93 Difference]: Finished difference Result 217 states and 251 transitions. [2018-11-28 11:42:09,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-28 11:42:09,138 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-11-28 11:42:09,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:42:09,139 INFO L225 Difference]: With dead ends: 217 [2018-11-28 11:42:09,139 INFO L226 Difference]: Without dead ends: 200 [2018-11-28 11:42:09,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 21 SyntacticMatches, 8 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=549, Invalid=4707, Unknown=0, NotChecked=0, Total=5256 [2018-11-28 11:42:09,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-11-28 11:42:09,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 181. [2018-11-28 11:42:09,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-11-28 11:42:09,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 212 transitions. [2018-11-28 11:42:09,163 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 212 transitions. Word has length 43 [2018-11-28 11:42:09,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:42:09,163 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 212 transitions. [2018-11-28 11:42:09,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-28 11:42:09,163 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 212 transitions. [2018-11-28 11:42:09,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-28 11:42:09,164 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:42:09,164 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:42:09,164 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:42:09,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:42:09,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1316368837, now seen corresponding path program 1 times [2018-11-28 11:42:09,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:42:09,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:42:09,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:42:09,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:42:09,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:42:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:42:09,646 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:42:09,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:42:09,646 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:42:09,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:42:09,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:42:09,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:42:09,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-28 11:42:09,774 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:09,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-11-28 11:42:09,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:42:09,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:42:09,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:42:09,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-11-28 11:42:09,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2018-11-28 11:42:10,001 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:42:10,002 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:10,003 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:42:10,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 40 [2018-11-28 11:42:10,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:42:10,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:42:10,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:42:10,015 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2018-11-28 11:42:10,071 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:42:10,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:42:10,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 32 [2018-11-28 11:42:10,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-28 11:42:10,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-28 11:42:10,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=894, Unknown=0, NotChecked=0, Total=992 [2018-11-28 11:42:10,087 INFO L87 Difference]: Start difference. First operand 181 states and 212 transitions. Second operand 32 states. [2018-11-28 11:42:36,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:42:36,429 INFO L93 Difference]: Finished difference Result 417 states and 495 transitions. [2018-11-28 11:42:36,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-28 11:42:36,429 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 44 [2018-11-28 11:42:36,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:42:36,430 INFO L225 Difference]: With dead ends: 417 [2018-11-28 11:42:36,431 INFO L226 Difference]: Without dead ends: 349 [2018-11-28 11:42:36,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1310 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=561, Invalid=4409, Unknown=0, NotChecked=0, Total=4970 [2018-11-28 11:42:36,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-11-28 11:42:36,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 198. [2018-11-28 11:42:36,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-11-28 11:42:36,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 234 transitions. [2018-11-28 11:42:36,472 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 234 transitions. Word has length 44 [2018-11-28 11:42:36,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:42:36,472 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 234 transitions. [2018-11-28 11:42:36,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-28 11:42:36,472 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 234 transitions. [2018-11-28 11:42:36,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-28 11:42:36,473 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:42:36,473 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:42:36,473 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:42:36,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:42:36,473 INFO L82 PathProgramCache]: Analyzing trace with hash -2095999155, now seen corresponding path program 2 times [2018-11-28 11:42:36,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:42:36,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:42:36,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:42:36,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:42:36,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:42:36,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:42:37,056 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:42:37,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:42:37,057 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:42:37,063 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 11:42:37,074 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 11:42:37,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:42:37,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:42:37,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-11-28 11:42:37,166 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:37,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 47 [2018-11-28 11:42:37,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:42:37,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:42:37,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:42:37,176 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2018-11-28 11:42:37,284 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:37,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2018-11-28 11:42:37,287 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:37,288 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:37,288 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:42:37,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 72 [2018-11-28 11:42:37,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:42:37,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:42:37,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:42:37,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2018-11-28 11:42:37,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-28 11:42:37,380 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:37,381 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:37,381 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:37,382 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:37,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 67 [2018-11-28 11:42:37,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:42:37,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:42:37,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:42:37,394 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:21 [2018-11-28 11:42:37,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-11-28 11:42:37,544 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:37,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-28 11:42:37,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:42:37,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:42:37,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:42:37,546 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-11-28 11:42:37,583 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:42:37,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:42:37,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 42 [2018-11-28 11:42:37,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-28 11:42:37,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-28 11:42:37,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1530, Unknown=0, NotChecked=0, Total=1722 [2018-11-28 11:42:37,599 INFO L87 Difference]: Start difference. First operand 198 states and 234 transitions. Second operand 42 states. [2018-11-28 11:42:39,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:42:39,478 INFO L93 Difference]: Finished difference Result 337 states and 398 transitions. [2018-11-28 11:42:39,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-11-28 11:42:39,478 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 44 [2018-11-28 11:42:39,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:42:39,479 INFO L225 Difference]: With dead ends: 337 [2018-11-28 11:42:39,479 INFO L226 Difference]: Without dead ends: 335 [2018-11-28 11:42:39,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2040 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=737, Invalid=5743, Unknown=0, NotChecked=0, Total=6480 [2018-11-28 11:42:39,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-11-28 11:42:39,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 235. [2018-11-28 11:42:39,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-11-28 11:42:39,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 278 transitions. [2018-11-28 11:42:39,546 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 278 transitions. Word has length 44 [2018-11-28 11:42:39,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:42:39,547 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 278 transitions. [2018-11-28 11:42:39,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-28 11:42:39,547 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 278 transitions. [2018-11-28 11:42:39,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 11:42:39,548 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:42:39,548 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:42:39,548 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:42:39,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:42:39,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1588085580, now seen corresponding path program 5 times [2018-11-28 11:42:39,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:42:39,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:42:39,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:42:39,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:42:39,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:42:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:42:39,959 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 33 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:42:39,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:42:39,960 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:42:39,971 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 11:42:40,013 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-28 11:42:40,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:42:40,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:42:40,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-28 11:42:40,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 11:42:40,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:42:40,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:42:40,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:42:40,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2018-11-28 11:42:40,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2018-11-28 11:42:40,209 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:40,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2018-11-28 11:42:40,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:42:40,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:42:40,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:42:40,218 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:30 [2018-11-28 11:42:40,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2018-11-28 11:42:40,564 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:42:40,566 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:40,566 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:42:40,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2018-11-28 11:42:40,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:42:40,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:42:40,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:42:40,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2018-11-28 11:42:40,611 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:42:40,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:42:40,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22] total 37 [2018-11-28 11:42:40,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-28 11:42:40,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-28 11:42:40,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1216, Unknown=0, NotChecked=0, Total=1332 [2018-11-28 11:42:40,627 INFO L87 Difference]: Start difference. First operand 235 states and 278 transitions. Second operand 37 states. [2018-11-28 11:42:55,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:42:55,678 INFO L93 Difference]: Finished difference Result 356 states and 416 transitions. [2018-11-28 11:42:55,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-28 11:42:55,679 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 47 [2018-11-28 11:42:55,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:42:55,679 INFO L225 Difference]: With dead ends: 356 [2018-11-28 11:42:55,679 INFO L226 Difference]: Without dead ends: 354 [2018-11-28 11:42:55,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=277, Invalid=2585, Unknown=0, NotChecked=0, Total=2862 [2018-11-28 11:42:55,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-11-28 11:42:55,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 300. [2018-11-28 11:42:55,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-11-28 11:42:55,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 350 transitions. [2018-11-28 11:42:55,741 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 350 transitions. Word has length 47 [2018-11-28 11:42:55,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:42:55,741 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 350 transitions. [2018-11-28 11:42:55,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-28 11:42:55,741 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 350 transitions. [2018-11-28 11:42:55,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 11:42:55,742 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:42:55,742 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:42:55,742 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:42:55,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:42:55,742 INFO L82 PathProgramCache]: Analyzing trace with hash -681197923, now seen corresponding path program 2 times [2018-11-28 11:42:55,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:42:55,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:42:55,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:42:55,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:42:55,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:42:55,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:42:55,776 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-28 11:42:55,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:42:55,776 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:42:55,789 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 11:42:55,802 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 11:42:55,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:42:55,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:42:55,806 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-28 11:42:55,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:42:55,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-28 11:42:55,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 11:42:55,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:42:55,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:42:55,821 INFO L87 Difference]: Start difference. First operand 300 states and 350 transitions. Second operand 6 states. [2018-11-28 11:42:55,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:42:55,914 INFO L93 Difference]: Finished difference Result 384 states and 449 transitions. [2018-11-28 11:42:55,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:42:55,915 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-11-28 11:42:55,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:42:55,915 INFO L225 Difference]: With dead ends: 384 [2018-11-28 11:42:55,915 INFO L226 Difference]: Without dead ends: 298 [2018-11-28 11:42:55,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:42:55,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-11-28 11:42:55,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 249. [2018-11-28 11:42:55,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-11-28 11:42:55,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 286 transitions. [2018-11-28 11:42:55,971 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 286 transitions. Word has length 47 [2018-11-28 11:42:55,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:42:55,971 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 286 transitions. [2018-11-28 11:42:55,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 11:42:55,971 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 286 transitions. [2018-11-28 11:42:55,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 11:42:55,971 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:42:55,971 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 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-28 11:42:55,972 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:42:55,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:42:55,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1128146500, now seen corresponding path program 2 times [2018-11-28 11:42:55,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:42:55,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:42:55,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:42:55,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:42:55,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:42:55,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:42:56,916 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:42:56,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:42:56,916 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:42:56,923 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 11:42:56,934 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 11:42:56,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:42:56,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:42:56,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-11-28 11:42:56,994 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:42:57,001 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:57,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 71 [2018-11-28 11:42:57,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:42:57,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:42:57,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:42:57,015 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2018-11-28 11:42:57,130 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:57,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2018-11-28 11:42:57,133 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:57,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2018-11-28 11:42:57,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:42:57,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:42:57,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:42:57,144 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:32 [2018-11-28 11:42:57,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2018-11-28 11:42:57,183 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:42:57,183 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:57,184 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:57,185 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:57,186 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:57,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 95 [2018-11-28 11:42:57,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:42:57,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:42:57,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:42:57,197 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:47 [2018-11-28 11:42:57,330 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:57,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 66 [2018-11-28 11:42:57,332 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:57,333 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:57,334 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:57,334 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:57,335 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:42:57,335 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:57,336 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:42:57,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 148 [2018-11-28 11:42:57,337 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:42:57,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:42:57,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 11:42:57,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:57 [2018-11-28 11:42:57,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 48 [2018-11-28 11:42:57,488 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:57,489 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:57,490 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:57,490 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:57,491 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:57,492 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:57,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 144 [2018-11-28 11:42:57,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 11:42:57,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:42:57,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-11-28 11:42:57,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:76, output treesize:102 [2018-11-28 11:42:57,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-11-28 11:42:57,701 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:57,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-28 11:42:57,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:42:57,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:42:57,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:42:57,703 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-11-28 11:42:57,751 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:42:57,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:42:57,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 49 [2018-11-28 11:42:57,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-28 11:42:57,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-28 11:42:57,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=2123, Unknown=0, NotChecked=0, Total=2352 [2018-11-28 11:42:57,766 INFO L87 Difference]: Start difference. First operand 249 states and 286 transitions. Second operand 49 states. [2018-11-28 11:42:58,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:42:58,954 INFO L93 Difference]: Finished difference Result 273 states and 310 transitions. [2018-11-28 11:42:58,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-28 11:42:58,954 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2018-11-28 11:42:58,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:42:58,955 INFO L225 Difference]: With dead ends: 273 [2018-11-28 11:42:58,955 INFO L226 Difference]: Without dead ends: 256 [2018-11-28 11:42:58,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 24 SyntacticMatches, 8 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1854 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=470, Invalid=4500, Unknown=0, NotChecked=0, Total=4970 [2018-11-28 11:42:58,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-11-28 11:42:59,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 219. [2018-11-28 11:42:59,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-11-28 11:42:59,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 252 transitions. [2018-11-28 11:42:59,018 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 252 transitions. Word has length 48 [2018-11-28 11:42:59,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:42:59,018 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 252 transitions. [2018-11-28 11:42:59,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-28 11:42:59,018 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 252 transitions. [2018-11-28 11:42:59,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-28 11:42:59,018 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:42:59,018 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:42:59,018 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:42:59,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:42:59,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1834674623, now seen corresponding path program 1 times [2018-11-28 11:42:59,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:42:59,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:42:59,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:42:59,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:42:59,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:42:59,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:42:59,240 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 1 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:42:59,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:42:59,240 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:42:59,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:42:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:42:59,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:42:59,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-11-28 11:42:59,363 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:59,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 47 [2018-11-28 11:42:59,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:42:59,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:42:59,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:42:59,372 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2018-11-28 11:42:59,464 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:59,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2018-11-28 11:42:59,466 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:59,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-11-28 11:42:59,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:42:59,471 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:42:59,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:42:59,476 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:33 [2018-11-28 11:42:59,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-11-28 11:42:59,648 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:59,648 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:59,649 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:42:59,649 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:42:59,650 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:42:59,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2018-11-28 11:42:59,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:42:59,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:42:59,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:42:59,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:5 [2018-11-28 11:42:59,712 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 10 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:42:59,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:42:59,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22] total 38 [2018-11-28 11:42:59,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-28 11:42:59,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-28 11:42:59,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1288, Unknown=0, NotChecked=0, Total=1406 [2018-11-28 11:42:59,727 INFO L87 Difference]: Start difference. First operand 219 states and 252 transitions. Second operand 38 states. [2018-11-28 11:43:01,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:43:01,809 INFO L93 Difference]: Finished difference Result 330 states and 378 transitions. [2018-11-28 11:43:01,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-11-28 11:43:01,809 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 49 [2018-11-28 11:43:01,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:43:01,810 INFO L225 Difference]: With dead ends: 330 [2018-11-28 11:43:01,810 INFO L226 Difference]: Without dead ends: 328 [2018-11-28 11:43:01,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3063 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=824, Invalid=9076, Unknown=0, NotChecked=0, Total=9900 [2018-11-28 11:43:01,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-11-28 11:43:01,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 217. [2018-11-28 11:43:01,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-28 11:43:01,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 251 transitions. [2018-11-28 11:43:01,861 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 251 transitions. Word has length 49 [2018-11-28 11:43:01,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:43:01,861 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 251 transitions. [2018-11-28 11:43:01,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-28 11:43:01,861 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 251 transitions. [2018-11-28 11:43:01,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-28 11:43:01,861 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:43:01,861 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:43:01,861 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:43:01,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:43:01,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1831939583, now seen corresponding path program 3 times [2018-11-28 11:43:01,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:43:01,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:43:01,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:01,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:43:01,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:01,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:02,713 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 5 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:43:02,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:43:02,713 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:43:02,720 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 11:43:02,762 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-28 11:43:02,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:43:02,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:43:02,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-28 11:43:02,847 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:43:02,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-11-28 11:43:02,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:43:02,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:43:02,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:43:02,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-11-28 11:43:02,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2018-11-28 11:43:02,890 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:43:02,891 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:43:02,892 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:43:02,893 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:43:02,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 77 [2018-11-28 11:43:02,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:43:02,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:43:02,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:43:02,905 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:46 [2018-11-28 11:43:02,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 48 [2018-11-28 11:43:02,991 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:43:02,991 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:43:02,994 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:43:02,994 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:43:02,996 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:43:03,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 48 treesize of output 120 [2018-11-28 11:43:03,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 11:43:03,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:43:03,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:43:03,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:73, output treesize:130 [2018-11-28 11:43:03,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 42 [2018-11-28 11:43:03,275 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:43:03,275 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:43:03,276 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:43:03,276 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:43:03,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 84 [2018-11-28 11:43:03,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:43:03,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:43:03,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:43:03,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:30 [2018-11-28 11:43:03,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-11-28 11:43:03,350 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:43:03,351 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:43:03,351 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:43:03,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 70 [2018-11-28 11:43:03,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:43:03,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:43:03,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:43:03,363 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:23 [2018-11-28 11:43:03,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-11-28 11:43:03,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-28 11:43:03,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:43:03,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:43:03,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:43:03,483 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-28 11:43:03,537 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:43:03,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:43:03,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 46 [2018-11-28 11:43:03,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-28 11:43:03,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-28 11:43:03,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1868, Unknown=0, NotChecked=0, Total=2070 [2018-11-28 11:43:03,552 INFO L87 Difference]: Start difference. First operand 217 states and 251 transitions. Second operand 46 states. [2018-11-28 11:43:21,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:43:21,049 INFO L93 Difference]: Finished difference Result 375 states and 424 transitions. [2018-11-28 11:43:21,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-28 11:43:21,049 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 49 [2018-11-28 11:43:21,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:43:21,050 INFO L225 Difference]: With dead ends: 375 [2018-11-28 11:43:21,050 INFO L226 Difference]: Without dead ends: 373 [2018-11-28 11:43:21,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 27 SyntacticMatches, 7 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2083 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=598, Invalid=5564, Unknown=0, NotChecked=0, Total=6162 [2018-11-28 11:43:21,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-11-28 11:43:21,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 227. [2018-11-28 11:43:21,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-11-28 11:43:21,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 262 transitions. [2018-11-28 11:43:21,101 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 262 transitions. Word has length 49 [2018-11-28 11:43:21,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:43:21,101 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 262 transitions. [2018-11-28 11:43:21,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-28 11:43:21,101 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 262 transitions. [2018-11-28 11:43:21,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 11:43:21,102 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:43:21,102 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:43:21,102 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:43:21,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:43:21,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1264339310, now seen corresponding path program 2 times [2018-11-28 11:43:21,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:43:21,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:43:21,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:21,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:43:21,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:21,522 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 2 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:43:21,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:43:21,522 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:43:21,528 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 11:43:21,542 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 11:43:21,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:43:21,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:43:21,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-28 11:43:21,643 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:43:21,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-11-28 11:43:21,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:43:21,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:43:21,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:43:21,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-11-28 11:43:21,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-28 11:43:21,712 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:43:21,713 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:43:21,713 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:43:21,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 55 [2018-11-28 11:43:21,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:43:21,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:43:21,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:43:21,724 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:22 [2018-11-28 11:43:21,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-28 11:43:21,785 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:43:21,786 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:43:21,786 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:43:21,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 49 [2018-11-28 11:43:21,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:43:21,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:43:21,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:43:21,796 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2018-11-28 11:43:21,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-11-28 11:43:21,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-28 11:43:21,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:43:21,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:43:21,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:43:21,947 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-28 11:43:21,984 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:43:21,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:43:21,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 40 [2018-11-28 11:43:21,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-28 11:43:21,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-28 11:43:22,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1409, Unknown=0, NotChecked=0, Total=1560 [2018-11-28 11:43:22,000 INFO L87 Difference]: Start difference. First operand 227 states and 262 transitions. Second operand 40 states. [2018-11-28 11:43:45,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:43:45,644 INFO L93 Difference]: Finished difference Result 490 states and 571 transitions. [2018-11-28 11:43:45,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-11-28 11:43:45,644 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 50 [2018-11-28 11:43:45,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:43:45,645 INFO L225 Difference]: With dead ends: 490 [2018-11-28 11:43:45,645 INFO L226 Difference]: Without dead ends: 452 [2018-11-28 11:43:45,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2334 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=876, Invalid=6606, Unknown=0, NotChecked=0, Total=7482 [2018-11-28 11:43:45,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2018-11-28 11:43:45,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 278. [2018-11-28 11:43:45,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-11-28 11:43:45,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 323 transitions. [2018-11-28 11:43:45,755 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 323 transitions. Word has length 50 [2018-11-28 11:43:45,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:43:45,755 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 323 transitions. [2018-11-28 11:43:45,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-28 11:43:45,755 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 323 transitions. [2018-11-28 11:43:45,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 11:43:45,756 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:43:45,756 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:43:45,756 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:43:45,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:43:45,756 INFO L82 PathProgramCache]: Analyzing trace with hash -891213096, now seen corresponding path program 3 times [2018-11-28 11:43:45,756 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:43:45,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:43:45,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:45,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:43:45,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:43:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:43:46,078 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:43:46,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:43:46,079 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:43:46,087 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 11:43:46,123 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-28 11:43:46,123 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:43:46,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:43:46,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-28 11:43:46,274 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:43:46,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-11-28 11:43:46,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:43:46,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:43:46,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:43:46,285 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2018-11-28 11:43:46,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2018-11-28 11:43:46,367 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:43:46,368 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:43:46,369 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:43:46,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2018-11-28 11:43:46,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:43:46,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:43:46,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:43:46,382 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:60, output treesize:30 [2018-11-28 11:43:46,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2018-11-28 11:43:46,530 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:43:46,531 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:43:46,540 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:43:46,540 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:43:46,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 38 [2018-11-28 11:43:46,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:43:46,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:43:46,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:43:46,550 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2018-11-28 11:43:46,587 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 3 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:43:46,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:43:46,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 36 [2018-11-28 11:43:46,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-28 11:43:46,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-28 11:43:46,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1130, Unknown=0, NotChecked=0, Total=1260 [2018-11-28 11:43:46,603 INFO L87 Difference]: Start difference. First operand 278 states and 323 transitions. Second operand 36 states. [2018-11-28 11:44:11,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:11,716 INFO L93 Difference]: Finished difference Result 404 states and 470 transitions. [2018-11-28 11:44:11,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-28 11:44:11,716 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 50 [2018-11-28 11:44:11,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:11,717 INFO L225 Difference]: With dead ends: 404 [2018-11-28 11:44:11,717 INFO L226 Difference]: Without dead ends: 402 [2018-11-28 11:44:11,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1047 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=518, Invalid=3904, Unknown=0, NotChecked=0, Total=4422 [2018-11-28 11:44:11,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-11-28 11:44:11,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 297. [2018-11-28 11:44:11,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-11-28 11:44:11,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 347 transitions. [2018-11-28 11:44:11,788 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 347 transitions. Word has length 50 [2018-11-28 11:44:11,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:11,788 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 347 transitions. [2018-11-28 11:44:11,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-28 11:44:11,788 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 347 transitions. [2018-11-28 11:44:11,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-28 11:44:11,789 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:11,789 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:11,789 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:11,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:11,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1007295364, now seen corresponding path program 4 times [2018-11-28 11:44:11,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:11,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:11,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:11,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:44:11,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:11,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:11,965 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:44:11,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:44:11,965 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:44:11,973 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 11:44:11,986 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 11:44:11,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:44:11,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:44:12,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-28 11:44:12,047 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:44:12,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-28 11:44:12,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:44:12,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:44:12,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:44:12,055 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-11-28 11:44:12,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-11-28 11:44:12,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-28 11:44:12,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:44:12,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:44:12,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:44:12,226 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-28 11:44:12,255 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:44:12,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:44:12,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2018-11-28 11:44:12,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-28 11:44:12,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-28 11:44:12,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=785, Unknown=0, NotChecked=0, Total=870 [2018-11-28 11:44:12,270 INFO L87 Difference]: Start difference. First operand 297 states and 347 transitions. Second operand 30 states. [2018-11-28 11:44:32,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:32,951 INFO L93 Difference]: Finished difference Result 388 states and 451 transitions. [2018-11-28 11:44:32,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-28 11:44:32,951 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 52 [2018-11-28 11:44:32,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:32,952 INFO L225 Difference]: With dead ends: 388 [2018-11-28 11:44:32,952 INFO L226 Difference]: Without dead ends: 386 [2018-11-28 11:44:32,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=223, Invalid=1847, Unknown=0, NotChecked=0, Total=2070 [2018-11-28 11:44:32,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-11-28 11:44:33,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 303. [2018-11-28 11:44:33,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-11-28 11:44:33,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 355 transitions. [2018-11-28 11:44:33,046 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 355 transitions. Word has length 52 [2018-11-28 11:44:33,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:33,046 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 355 transitions. [2018-11-28 11:44:33,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-28 11:44:33,047 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 355 transitions. [2018-11-28 11:44:33,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-28 11:44:33,047 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:33,047 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:33,047 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:33,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:33,048 INFO L82 PathProgramCache]: Analyzing trace with hash 745072839, now seen corresponding path program 6 times [2018-11-28 11:44:33,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:33,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:33,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:33,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:44:33,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:33,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:33,591 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 3 proven. 52 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:44:33,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:44:33,592 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:44:33,599 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-28 11:44:33,623 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-28 11:44:33,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:44:33,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:44:33,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-28 11:44:33,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 11:44:33,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:44:33,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:44:33,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:44:33,673 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-28 11:44:33,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-28 11:44:33,751 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:44:33,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-11-28 11:44:33,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:44:33,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:44:33,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:44:33,760 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-11-28 11:44:33,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-11-28 11:44:33,819 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:44:33,820 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:44:33,821 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:44:33,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-11-28 11:44:33,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:44:33,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:44:33,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:44:33,841 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-11-28 11:44:34,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-11-28 11:44:34,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-28 11:44:34,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:44:34,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:44:34,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:44:34,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-28 11:44:34,086 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 3 proven. 52 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:44:34,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:44:34,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 39 [2018-11-28 11:44:34,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-28 11:44:34,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-28 11:44:34,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1341, Unknown=0, NotChecked=0, Total=1482 [2018-11-28 11:44:34,101 INFO L87 Difference]: Start difference. First operand 303 states and 355 transitions. Second operand 39 states. [2018-11-28 11:44:55,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:55,034 INFO L93 Difference]: Finished difference Result 419 states and 482 transitions. [2018-11-28 11:44:55,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-28 11:44:55,034 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 53 [2018-11-28 11:44:55,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:55,036 INFO L225 Difference]: With dead ends: 419 [2018-11-28 11:44:55,036 INFO L226 Difference]: Without dead ends: 417 [2018-11-28 11:44:55,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1060 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=424, Invalid=3358, Unknown=0, NotChecked=0, Total=3782 [2018-11-28 11:44:55,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-11-28 11:44:55,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 305. [2018-11-28 11:44:55,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-11-28 11:44:55,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 354 transitions. [2018-11-28 11:44:55,171 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 354 transitions. Word has length 53 [2018-11-28 11:44:55,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:55,172 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 354 transitions. [2018-11-28 11:44:55,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-28 11:44:55,172 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 354 transitions. [2018-11-28 11:44:55,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 11:44:55,173 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:55,173 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:55,173 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:55,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:55,173 INFO L82 PathProgramCache]: Analyzing trace with hash -175042453, now seen corresponding path program 7 times [2018-11-28 11:44:55,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:55,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:55,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:55,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:44:55,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:55,343 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-28 11:44:55,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:44:55,344 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:44:55,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:55,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:55,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:44:55,478 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-28 11:44:55,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:44:55,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2018-11-28 11:44:55,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-28 11:44:55,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 11:44:55,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-11-28 11:44:55,508 INFO L87 Difference]: Start difference. First operand 305 states and 354 transitions. Second operand 15 states. [2018-11-28 11:44:55,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:44:55,836 INFO L93 Difference]: Finished difference Result 434 states and 507 transitions. [2018-11-28 11:44:55,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 11:44:55,836 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2018-11-28 11:44:55,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:44:55,837 INFO L225 Difference]: With dead ends: 434 [2018-11-28 11:44:55,837 INFO L226 Difference]: Without dead ends: 365 [2018-11-28 11:44:55,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2018-11-28 11:44:55,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-11-28 11:44:55,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 300. [2018-11-28 11:44:55,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-11-28 11:44:55,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 348 transitions. [2018-11-28 11:44:55,939 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 348 transitions. Word has length 55 [2018-11-28 11:44:55,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:44:55,940 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 348 transitions. [2018-11-28 11:44:55,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-28 11:44:55,940 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 348 transitions. [2018-11-28 11:44:55,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 11:44:55,940 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:44:55,940 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:44:55,941 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:44:55,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:44:55,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1983848057, now seen corresponding path program 1 times [2018-11-28 11:44:55,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:44:55,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:44:55,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:55,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:55,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:44:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:56,660 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 1 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:56,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:44:56,661 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:44:56,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:44:56,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:44:56,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:44:56,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-28 11:44:56,746 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:44:56,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-11-28 11:44:56,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:44:56,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:44:56,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:44:56,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-11-28 11:44:56,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-11-28 11:44:56,800 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:44:56,800 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:44:56,801 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:44:56,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 61 [2018-11-28 11:44:56,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:44:56,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:44:56,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:44:56,816 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:34 [2018-11-28 11:44:56,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2018-11-28 11:44:56,925 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-28 11:44:56,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:44:56,927 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:44:56,928 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:44:56,929 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:44:56,929 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:44:56,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 98 [2018-11-28 11:44:56,933 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 11:44:56,941 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:44:56,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:44:56,946 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:64, output treesize:44 [2018-11-28 11:44:57,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 40 [2018-11-28 11:44:57,090 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:44:57,090 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:44:57,091 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:44:57,091 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:44:57,092 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:44:57,093 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:44:57,093 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:44:57,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 98 [2018-11-28 11:44:57,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:44:57,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:44:57,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:44:57,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:47 [2018-11-28 11:44:57,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 43 [2018-11-28 11:44:57,262 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:44:57,263 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:44:57,264 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:44:57,265 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:44:57,266 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:44:57,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 117 [2018-11-28 11:44:57,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 11:44:57,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:44:57,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 11:44:57,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:66, output treesize:79 [2018-11-28 11:44:57,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-11-28 11:44:57,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-28 11:44:57,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:44:57,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:44:57,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:44:57,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-28 11:44:57,560 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 9 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:44:57,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:44:57,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 30] total 45 [2018-11-28 11:44:57,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-28 11:44:57,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-28 11:44:57,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1775, Unknown=0, NotChecked=0, Total=1980 [2018-11-28 11:44:57,577 INFO L87 Difference]: Start difference. First operand 300 states and 348 transitions. Second operand 45 states. [2018-11-28 11:45:16,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:45:16,663 INFO L93 Difference]: Finished difference Result 533 states and 619 transitions. [2018-11-28 11:45:16,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-11-28 11:45:16,663 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 54 [2018-11-28 11:45:16,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:45:16,664 INFO L225 Difference]: With dead ends: 533 [2018-11-28 11:45:16,664 INFO L226 Difference]: Without dead ends: 531 [2018-11-28 11:45:16,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 30 SyntacticMatches, 11 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3250 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1035, Invalid=9267, Unknown=0, NotChecked=0, Total=10302 [2018-11-28 11:45:16,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-11-28 11:45:16,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 398. [2018-11-28 11:45:16,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-11-28 11:45:16,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 458 transitions. [2018-11-28 11:45:16,807 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 458 transitions. Word has length 54 [2018-11-28 11:45:16,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:45:16,807 INFO L480 AbstractCegarLoop]: Abstraction has 398 states and 458 transitions. [2018-11-28 11:45:16,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-28 11:45:16,807 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 458 transitions. [2018-11-28 11:45:16,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 11:45:16,808 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:45:16,808 INFO L402 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:45:16,808 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:45:16,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:45:16,809 INFO L82 PathProgramCache]: Analyzing trace with hash 2098824215, now seen corresponding path program 4 times [2018-11-28 11:45:16,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:45:16,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:45:16,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:45:16,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:45:16,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:45:16,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:45:17,883 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 2 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:45:17,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:45:17,884 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:45:17,889 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 11:45:17,908 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 11:45:17,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:45:17,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:45:18,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-11-28 11:45:18,020 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:18,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 47 [2018-11-28 11:45:18,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:45:18,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:18,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:18,030 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2018-11-28 11:45:18,164 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:18,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2018-11-28 11:45:18,166 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:18,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-11-28 11:45:18,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:45:18,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:18,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:45:18,179 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:41 [2018-11-28 11:45:18,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2018-11-28 11:45:18,200 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:18,202 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:18,204 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:18,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 91 [2018-11-28 11:45:18,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-11-28 11:45:18,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 11:45:18,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-28 11:45:18,248 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:137 [2018-11-28 11:45:18,493 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:18,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 67 [2018-11-28 11:45:18,496 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:18,496 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:18,497 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:45:18,498 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:18,498 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:18,499 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:45:18,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 132 [2018-11-28 11:45:18,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:45:18,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:18,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:18,515 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:78, output treesize:58 [2018-11-28 11:45:18,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 48 [2018-11-28 11:45:18,599 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:18,600 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:18,601 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:18,602 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:18,603 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:18,604 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:18,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 144 [2018-11-28 11:45:18,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 11:45:18,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 11:45:18,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 11:45:18,653 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:79, output treesize:99 [2018-11-28 11:45:18,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-11-28 11:45:18,763 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:18,764 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:18,765 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:18,766 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:18,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 75 [2018-11-28 11:45:18,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:45:18,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:18,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:18,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:23 [2018-11-28 11:45:18,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-11-28 11:45:18,948 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:18,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-28 11:45:18,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:45:18,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:18,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:18,952 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-11-28 11:45:19,015 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 5 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:45:19,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:45:19,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30] total 51 [2018-11-28 11:45:19,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-28 11:45:19,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-28 11:45:19,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2333, Unknown=0, NotChecked=0, Total=2550 [2018-11-28 11:45:19,031 INFO L87 Difference]: Start difference. First operand 398 states and 458 transitions. Second operand 51 states. [2018-11-28 11:45:20,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:45:20,474 INFO L93 Difference]: Finished difference Result 427 states and 490 transitions. [2018-11-28 11:45:20,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-28 11:45:20,474 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 54 [2018-11-28 11:45:20,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:45:20,475 INFO L225 Difference]: With dead ends: 427 [2018-11-28 11:45:20,475 INFO L226 Difference]: Without dead ends: 410 [2018-11-28 11:45:20,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 25 SyntacticMatches, 15 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2195 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=441, Invalid=4961, Unknown=0, NotChecked=0, Total=5402 [2018-11-28 11:45:20,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-11-28 11:45:20,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 387. [2018-11-28 11:45:20,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-11-28 11:45:20,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 446 transitions. [2018-11-28 11:45:20,652 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 446 transitions. Word has length 54 [2018-11-28 11:45:20,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:45:20,652 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 446 transitions. [2018-11-28 11:45:20,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-28 11:45:20,652 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 446 transitions. [2018-11-28 11:45:20,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 11:45:20,653 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:45:20,653 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:45:20,654 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:45:20,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:45:20,654 INFO L82 PathProgramCache]: Analyzing trace with hash -2049125808, now seen corresponding path program 5 times [2018-11-28 11:45:20,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:45:20,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:45:20,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:45:20,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:45:20,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:45:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:45:20,926 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 1 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:45:20,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:45:20,926 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:45:20,933 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 11:45:20,962 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-28 11:45:20,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:45:20,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:45:21,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-28 11:45:21,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-28 11:45:21,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:45:21,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:21,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:21,033 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:10 [2018-11-28 11:45:21,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-28 11:45:21,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-28 11:45:21,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:45:21,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:21,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:21,085 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:10 [2018-11-28 11:45:21,121 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:45:21,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 34 [2018-11-28 11:45:21,123 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:45:21,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 23 [2018-11-28 11:45:21,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:45:21,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:21,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:21,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:10 [2018-11-28 11:45:21,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-28 11:45:21,239 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:21,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-11-28 11:45:21,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:45:21,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:21,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 11:45:21,249 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-11-28 11:45:21,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2018-11-28 11:45:21,453 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:45:21,454 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:21,454 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:45:21,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 40 [2018-11-28 11:45:21,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:45:21,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:21,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:21,464 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2018-11-28 11:45:21,502 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:45:21,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:45:21,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 26] total 41 [2018-11-28 11:45:21,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-28 11:45:21,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-28 11:45:21,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1513, Unknown=0, NotChecked=0, Total=1640 [2018-11-28 11:45:21,517 INFO L87 Difference]: Start difference. First operand 387 states and 446 transitions. Second operand 41 states. [2018-11-28 11:45:50,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:45:50,577 INFO L93 Difference]: Finished difference Result 815 states and 956 transitions. [2018-11-28 11:45:50,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-11-28 11:45:50,577 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 55 [2018-11-28 11:45:50,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:45:50,579 INFO L225 Difference]: With dead ends: 815 [2018-11-28 11:45:50,579 INFO L226 Difference]: Without dead ends: 760 [2018-11-28 11:45:50,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2966 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=746, Invalid=8760, Unknown=0, NotChecked=0, Total=9506 [2018-11-28 11:45:50,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2018-11-28 11:45:50,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 447. [2018-11-28 11:45:50,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-11-28 11:45:50,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 523 transitions. [2018-11-28 11:45:50,722 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 523 transitions. Word has length 55 [2018-11-28 11:45:50,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:45:50,722 INFO L480 AbstractCegarLoop]: Abstraction has 447 states and 523 transitions. [2018-11-28 11:45:50,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-28 11:45:50,722 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 523 transitions. [2018-11-28 11:45:50,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 11:45:50,723 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:45:50,723 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:45:50,723 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:45:50,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:45:50,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1811316562, now seen corresponding path program 2 times [2018-11-28 11:45:50,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:45:50,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:45:50,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:45:50,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:45:50,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:45:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:45:51,085 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 1 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:45:51,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:45:51,086 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/bin-2019/uautomizer/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:45:51,094 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 11:45:51,110 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 11:45:51,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:45:51,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:45:51,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-11-28 11:45:51,278 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:51,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 47 [2018-11-28 11:45:51,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:45:51,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:51,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:51,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:48 [2018-11-28 11:45:51,456 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:51,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-11-28 11:45:51,459 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:51,460 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:51,461 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:45:51,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 73 [2018-11-28 11:45:51,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:45:51,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:51,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 11:45:51,477 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:72, output treesize:43 [2018-11-28 11:45:51,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-11-28 11:45:51,611 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:51,612 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:51,613 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:51,614 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:51,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 100 [2018-11-28 11:45:51,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:45:51,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:51,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 11:45:51,633 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:57, output treesize:38 [2018-11-28 11:45:51,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-11-28 11:45:51,878 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:51,879 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:45:51,879 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:51,880 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:45:51,881 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:51,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2018-11-28 11:45:51,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:45:51,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:51,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:51,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:5 [2018-11-28 11:45:51,937 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:45:51,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:45:51,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 26] total 44 [2018-11-28 11:45:51,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-28 11:45:51,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-28 11:45:51,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1717, Unknown=0, NotChecked=0, Total=1892 [2018-11-28 11:45:51,953 INFO L87 Difference]: Start difference. First operand 447 states and 523 transitions. Second operand 44 states. [2018-11-28 11:45:53,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:45:53,407 INFO L93 Difference]: Finished difference Result 538 states and 625 transitions. [2018-11-28 11:45:53,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-28 11:45:53,407 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 55 [2018-11-28 11:45:53,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:45:53,409 INFO L225 Difference]: With dead ends: 538 [2018-11-28 11:45:53,409 INFO L226 Difference]: Without dead ends: 536 [2018-11-28 11:45:53,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1044 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=405, Invalid=3501, Unknown=0, NotChecked=0, Total=3906 [2018-11-28 11:45:53,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-11-28 11:45:53,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 474. [2018-11-28 11:45:53,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2018-11-28 11:45:53,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 553 transitions. [2018-11-28 11:45:53,557 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 553 transitions. Word has length 55 [2018-11-28 11:45:53,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:45:53,557 INFO L480 AbstractCegarLoop]: Abstraction has 474 states and 553 transitions. [2018-11-28 11:45:53,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-28 11:45:53,557 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 553 transitions. [2018-11-28 11:45:53,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 11:45:53,558 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:45:53,558 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:45:53,558 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:45:53,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:45:53,559 INFO L82 PathProgramCache]: Analyzing trace with hash -797020350, now seen corresponding path program 3 times [2018-11-28 11:45:53,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:45:53,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:45:53,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:45:53,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:45:53,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:45:53,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:45:54,024 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 2 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:45:54,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:45:54,024 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/bin-2019/uautomizer/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:45:54,031 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 11:45:54,080 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-28 11:45:54,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:45:54,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:45:54,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-11-28 11:45:54,217 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:54,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 47 [2018-11-28 11:45:54,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:45:54,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:54,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:54,230 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2018-11-28 11:45:54,353 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:54,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 53 [2018-11-28 11:45:54,355 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:54,356 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:54,356 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 11:45:54,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 72 [2018-11-28 11:45:54,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:45:54,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:54,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:54,369 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2018-11-28 11:45:54,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-11-28 11:45:54,463 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:54,464 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:54,465 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:54,467 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:54,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2018-11-28 11:45:54,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:45:54,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:54,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:54,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:24 [2018-11-28 11:45:54,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-11-28 11:45:54,614 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:54,614 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:54,615 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:54,616 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:54,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 76 [2018-11-28 11:45:54,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:45:54,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:54,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:54,628 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:21 [2018-11-28 11:45:54,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-11-28 11:45:54,798 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 11:45:54,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-28 11:45:54,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 11:45:54,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:54,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 11:45:54,801 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-11-28 11:45:54,846 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 1 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:45:54,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:45:54,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 47 [2018-11-28 11:45:54,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-28 11:45:54,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-28 11:45:54,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1957, Unknown=0, NotChecked=0, Total=2162 [2018-11-28 11:45:54,861 INFO L87 Difference]: Start difference. First operand 474 states and 553 transitions. Second operand 47 states. [2018-11-28 11:45:55,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:45:55,968 INFO L93 Difference]: Finished difference Result 623 states and 722 transitions. [2018-11-28 11:45:55,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-28 11:45:55,968 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 55 [2018-11-28 11:45:55,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 11:45:55,970 INFO L225 Difference]: With dead ends: 623 [2018-11-28 11:45:55,970 INFO L226 Difference]: Without dead ends: 585 [2018-11-28 11:45:55,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1314 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=466, Invalid=3824, Unknown=0, NotChecked=0, Total=4290 [2018-11-28 11:45:55,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2018-11-28 11:45:56,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 490. [2018-11-28 11:45:56,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2018-11-28 11:45:56,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 573 transitions. [2018-11-28 11:45:56,121 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 573 transitions. Word has length 55 [2018-11-28 11:45:56,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 11:45:56,121 INFO L480 AbstractCegarLoop]: Abstraction has 490 states and 573 transitions. [2018-11-28 11:45:56,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-28 11:45:56,121 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 573 transitions. [2018-11-28 11:45:56,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-28 11:45:56,122 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 11:45:56,122 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 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] [2018-11-28 11:45:56,122 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 11:45:56,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:45:56,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1963459190, now seen corresponding path program 4 times [2018-11-28 11:45:56,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:45:56,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:45:56,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:45:56,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:45:56,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:45:56,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:45:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:45:56,173 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 11:45:56,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:45:56 BoogieIcfgContainer [2018-11-28 11:45:56,208 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 11:45:56,209 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:45:56,209 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:45:56,209 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:45:56,209 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:40:56" (3/4) ... [2018-11-28 11:45:56,211 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 11:45:56,260 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ec2c7543-ef44-44ff-aa98-d4d2e5393cf9/bin-2019/uautomizer/witness.graphml [2018-11-28 11:45:56,260 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:45:56,261 INFO L168 Benchmark]: Toolchain (without parser) took 300080.96 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 249.6 MB). Free memory was 956.7 MB in the beginning and 850.4 MB in the end (delta: 106.2 MB). Peak memory consumption was 355.8 MB. Max. memory is 11.5 GB. [2018-11-28 11:45:56,262 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:45:56,262 INFO L168 Benchmark]: CACSL2BoogieTranslator took 143.82 ms. Allocated memory is still 1.0 GB. Free memory was 956.7 MB in the beginning and 945.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:45:56,262 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.62 ms. Allocated memory is still 1.0 GB. Free memory is still 945.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:45:56,262 INFO L168 Benchmark]: Boogie Preprocessor took 56.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -196.1 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2018-11-28 11:45:56,262 INFO L168 Benchmark]: RCFGBuilder took 171.96 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: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2018-11-28 11:45:56,263 INFO L168 Benchmark]: TraceAbstraction took 299634.96 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 99.6 MB). Free memory was 1.1 GB in the beginning and 850.4 MB in the end (delta: 273.8 MB). Peak memory consumption was 373.4 MB. Max. memory is 11.5 GB. [2018-11-28 11:45:56,263 INFO L168 Benchmark]: Witness Printer took 51.31 ms. Allocated memory is still 1.3 GB. Free memory was 850.4 MB in the beginning and 850.4 MB in the end (delta: 3.0 kB). Peak memory consumption was 3.0 kB. Max. memory is 11.5 GB. [2018-11-28 11:45:56,266 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 976.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 143.82 ms. Allocated memory is still 1.0 GB. Free memory was 956.7 MB in the beginning and 945.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.62 ms. Allocated memory is still 1.0 GB. Free memory is still 945.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -196.1 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 171.96 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: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 299634.96 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 99.6 MB). Free memory was 1.1 GB in the beginning and 850.4 MB in the end (delta: 273.8 MB). Peak memory consumption was 373.4 MB. Max. memory is 11.5 GB. * Witness Printer took 51.31 ms. Allocated memory is still 1.3 GB. Free memory was 850.4 MB in the beginning and 850.4 MB in the end (delta: 3.0 kB). Peak memory consumption was 3.0 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L11] unsigned int SIZE=__VERIFIER_nondet_uint(); [L12] int i, j, k, key; [L13] int v[SIZE]; [L14] j=1 VAL [j=1, SIZE=4, v={4294967302:0}] [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) VAL [(i>=0) && (v[i]>key)=0, i=0, j=1, k=0, SIZE=4, v={4294967302:0}, v[i]=-7] [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] v[i+1] = key VAL [i=0, j=1, k=0, SIZE=4, v={4294967302:0}] [L14] j++ VAL [i=0, j=2, k=0, SIZE=4, v={4294967302:0}] [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) VAL [(i>=0) && (v[i]>key)=0, i=1, j=2, k=0, SIZE=4, v={4294967302:0}, v[i]=0] [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] v[i+1] = key VAL [i=1, j=2, k=0, SIZE=4, v={4294967302:0}] [L14] j++ VAL [i=1, j=3, k=0, SIZE=4, v={4294967302:0}] [L14] COND TRUE j=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) VAL [(i>=0) && (v[i]>key)=1, i=2, j=3, k=-3, SIZE=4, v={4294967302:0}, v[i]=0] [L17] COND TRUE (i>=0) && (v[i]>key) [L18] COND FALSE !(i<2) VAL [i=2, j=3, k=-3, SIZE=4, v={4294967302:0}] [L20] i = i - 1 VAL [i=1, j=3, k=-3, SIZE=4, v={4294967302:0}] [L17] (i>=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) VAL [(i>=0) && (v[i]>key)=1, i=1, j=3, k=-3, SIZE=4, v={4294967302:0}, v[i]=0] [L17] COND TRUE (i>=0) && (v[i]>key) [L18] COND TRUE i<2 [L19] EXPR v[i] [L19] v[i+1] = v[i] [L20] i = i - 1 VAL [i=0, j=3, k=-3, SIZE=4, v={4294967302:0}] [L17] (i>=0) && (v[i]>key) [L17] EXPR v[i] [L17] (i>=0) && (v[i]>key) VAL [(i>=0) && (v[i]>key)=0, i=0, j=3, k=-3, SIZE=4, v={4294967302:0}, v[i]=-7] [L17] COND FALSE !((i>=0) && (v[i]>key)) [L22] v[i+1] = key VAL [i=0, j=3, k=-3, SIZE=4, v={4294967302:0}] [L14] j++ VAL [i=0, j=4, k=-3, SIZE=4, v={4294967302:0}] [L14] COND FALSE !(j