./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr_false-unreach-call_false-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_102cc9ea-1c7b-42da-9fe5-a74866f1bf5d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_102cc9ea-1c7b-42da-9fe5-a74866f1bf5d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_102cc9ea-1c7b-42da-9fe5-a74866f1bf5d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_102cc9ea-1c7b-42da-9fe5-a74866f1bf5d/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr_false-unreach-call_false-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_102cc9ea-1c7b-42da-9fe5-a74866f1bf5d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_102cc9ea-1c7b-42da-9fe5-a74866f1bf5d/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 ce077c63676f801e14160b963d91b2f98c313404 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-1dbac8b [2018-11-10 07:56:39,313 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:56:39,314 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:56:39,322 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:56:39,322 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:56:39,323 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:56:39,324 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:56:39,325 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:56:39,326 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:56:39,327 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:56:39,328 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:56:39,328 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:56:39,329 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:56:39,329 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:56:39,330 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:56:39,331 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:56:39,332 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:56:39,333 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:56:39,334 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:56:39,335 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:56:39,337 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:56:39,337 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:56:39,339 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:56:39,339 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:56:39,339 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:56:39,340 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:56:39,341 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:56:39,342 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:56:39,342 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:56:39,343 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:56:39,343 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:56:39,343 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:56:39,344 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:56:39,344 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:56:39,345 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:56:39,346 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:56:39,346 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_102cc9ea-1c7b-42da-9fe5-a74866f1bf5d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 07:56:39,356 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:56:39,356 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:56:39,357 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 07:56:39,357 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 07:56:39,358 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 07:56:39,358 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 07:56:39,358 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 07:56:39,358 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:56:39,358 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 07:56:39,358 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:56:39,359 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 07:56:39,359 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:56:39,359 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 07:56:39,359 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 07:56:39,359 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 07:56:39,359 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 07:56:39,359 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:56:39,360 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 07:56:39,360 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:56:39,362 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:56:39,362 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 07:56:39,362 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 07:56:39,362 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 07:56:39,362 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:56:39,362 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 07:56:39,362 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 07:56:39,363 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 07:56:39,363 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 07:56:39,363 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 07:56:39,363 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_102cc9ea-1c7b-42da-9fe5-a74866f1bf5d/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 -> ce077c63676f801e14160b963d91b2f98c313404 [2018-11-10 07:56:39,386 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:56:39,395 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:56:39,398 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:56:39,400 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:56:39,400 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:56:39,400 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_102cc9ea-1c7b-42da-9fe5-a74866f1bf5d/bin-2019/uautomizer/../../sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr_false-unreach-call_false-termination.i [2018-11-10 07:56:39,441 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_102cc9ea-1c7b-42da-9fe5-a74866f1bf5d/bin-2019/uautomizer/data/807b0a969/c7b075451a814dab8ac8624705e98c40/FLAG1882431ae [2018-11-10 07:56:39,821 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:56:39,821 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_102cc9ea-1c7b-42da-9fe5-a74866f1bf5d/sv-benchmarks/c/list-ext2-properties/list_and_tree_cnstr_false-unreach-call_false-termination.i [2018-11-10 07:56:39,831 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_102cc9ea-1c7b-42da-9fe5-a74866f1bf5d/bin-2019/uautomizer/data/807b0a969/c7b075451a814dab8ac8624705e98c40/FLAG1882431ae [2018-11-10 07:56:39,840 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_102cc9ea-1c7b-42da-9fe5-a74866f1bf5d/bin-2019/uautomizer/data/807b0a969/c7b075451a814dab8ac8624705e98c40 [2018-11-10 07:56:39,842 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:56:39,843 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 07:56:39,843 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:56:39,843 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:56:39,845 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:56:39,846 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:56:39" (1/1) ... [2018-11-10 07:56:39,847 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f18886d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:56:39, skipping insertion in model container [2018-11-10 07:56:39,848 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:56:39" (1/1) ... [2018-11-10 07:56:39,853 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:56:39,880 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:56:40,067 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:56:40,074 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:56:40,109 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:56:40,133 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:56:40,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:56:40 WrapperNode [2018-11-10 07:56:40,133 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:56:40,134 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:56:40,134 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:56:40,134 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:56:40,182 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:56:40" (1/1) ... [2018-11-10 07:56:40,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:56:40" (1/1) ... [2018-11-10 07:56:40,191 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:56:40" (1/1) ... [2018-11-10 07:56:40,192 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:56:40" (1/1) ... [2018-11-10 07:56:40,208 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:56:40" (1/1) ... [2018-11-10 07:56:40,214 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:56:40" (1/1) ... [2018-11-10 07:56:40,216 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:56:40" (1/1) ... [2018-11-10 07:56:40,220 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:56:40,220 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:56:40,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:56:40,221 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:56:40,221 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:56:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_102cc9ea-1c7b-42da-9fe5-a74866f1bf5d/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 07:56:40,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 07:56:40,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:56:40,253 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-10 07:56:40,253 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-10 07:56:40,253 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-10 07:56:40,253 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 07:56:40,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 07:56:40,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 07:56:40,254 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-10 07:56:40,254 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-10 07:56:40,254 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-10 07:56:40,254 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-10 07:56:40,254 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-10 07:56:40,254 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-10 07:56:40,255 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-10 07:56:40,255 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-10 07:56:40,255 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-10 07:56:40,255 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-10 07:56:40,255 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-10 07:56:40,255 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-10 07:56:40,255 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-10 07:56:40,255 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-10 07:56:40,255 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-10 07:56:40,255 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-10 07:56:40,255 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-10 07:56:40,255 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-10 07:56:40,256 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-10 07:56:40,256 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-10 07:56:40,256 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-10 07:56:40,256 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-10 07:56:40,256 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-10 07:56:40,256 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-10 07:56:40,256 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-10 07:56:40,256 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-10 07:56:40,256 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-10 07:56:40,256 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-10 07:56:40,257 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-10 07:56:40,257 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-10 07:56:40,257 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-10 07:56:40,257 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-10 07:56:40,257 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-10 07:56:40,257 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-10 07:56:40,257 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-10 07:56:40,257 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-10 07:56:40,258 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-10 07:56:40,258 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-10 07:56:40,258 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-10 07:56:40,258 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-10 07:56:40,258 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-10 07:56:40,258 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-10 07:56:40,258 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-10 07:56:40,258 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-10 07:56:40,258 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-10 07:56:40,259 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-10 07:56:40,259 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-10 07:56:40,259 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-10 07:56:40,259 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-10 07:56:40,259 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-10 07:56:40,259 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-10 07:56:40,259 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-10 07:56:40,259 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-10 07:56:40,259 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-10 07:56:40,260 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-10 07:56:40,260 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-10 07:56:40,260 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-10 07:56:40,260 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-10 07:56:40,260 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-10 07:56:40,260 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-10 07:56:40,260 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-10 07:56:40,260 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-10 07:56:40,260 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-10 07:56:40,260 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-10 07:56:40,261 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-10 07:56:40,261 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 07:56:40,261 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-10 07:56:40,261 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-10 07:56:40,261 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-10 07:56:40,261 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-10 07:56:40,261 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-10 07:56:40,261 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-10 07:56:40,261 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-10 07:56:40,261 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-10 07:56:40,262 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-10 07:56:40,262 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-10 07:56:40,262 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-10 07:56:40,262 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-10 07:56:40,262 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-10 07:56:40,262 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-10 07:56:40,262 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-10 07:56:40,262 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-10 07:56:40,262 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-10 07:56:40,263 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-10 07:56:40,263 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-10 07:56:40,263 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-10 07:56:40,263 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-10 07:56:40,263 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-10 07:56:40,263 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-10 07:56:40,263 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-10 07:56:40,263 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-10 07:56:40,263 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-10 07:56:40,263 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-10 07:56:40,264 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-10 07:56:40,264 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-10 07:56:40,264 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-10 07:56:40,264 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-10 07:56:40,264 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-10 07:56:40,264 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-10 07:56:40,264 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-10 07:56:40,264 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-10 07:56:40,264 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-10 07:56:40,265 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-10 07:56:40,265 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-10 07:56:40,265 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-10 07:56:40,265 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 07:56:40,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-10 07:56:40,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-10 07:56:40,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-10 07:56:40,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-10 07:56:40,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 07:56:40,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 07:56:40,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 07:56:40,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:56:40,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-10 07:56:40,674 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:56:40,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:56:40 BoogieIcfgContainer [2018-11-10 07:56:40,675 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:56:40,676 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 07:56:40,676 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 07:56:40,678 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 07:56:40,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:56:39" (1/3) ... [2018-11-10 07:56:40,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ca82d39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:56:40, skipping insertion in model container [2018-11-10 07:56:40,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:56:40" (2/3) ... [2018-11-10 07:56:40,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ca82d39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:56:40, skipping insertion in model container [2018-11-10 07:56:40,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:56:40" (3/3) ... [2018-11-10 07:56:40,681 INFO L112 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr_false-unreach-call_false-termination.i [2018-11-10 07:56:40,689 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 07:56:40,695 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 07:56:40,704 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 07:56:40,730 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 07:56:40,730 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 07:56:40,730 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 07:56:40,730 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 07:56:40,730 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:56:40,730 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:56:40,731 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 07:56:40,731 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:56:40,731 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 07:56:40,744 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states. [2018-11-10 07:56:40,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 07:56:40,748 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:56:40,749 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:56:40,750 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:56:40,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:56:40,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1570606554, now seen corresponding path program 1 times [2018-11-10 07:56:40,754 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:56:40,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:56:40,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:40,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:56:40,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:56:40,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:56:40,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:56:40,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 07:56:40,847 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 07:56:40,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 07:56:40,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 07:56:40,860 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 2 states. [2018-11-10 07:56:40,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:56:40,883 INFO L93 Difference]: Finished difference Result 231 states and 287 transitions. [2018-11-10 07:56:40,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 07:56:40,884 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-11-10 07:56:40,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:56:40,891 INFO L225 Difference]: With dead ends: 231 [2018-11-10 07:56:40,892 INFO L226 Difference]: Without dead ends: 110 [2018-11-10 07:56:40,894 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 07:56:40,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-10 07:56:40,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-11-10 07:56:40,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-10 07:56:40,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 127 transitions. [2018-11-10 07:56:40,919 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 127 transitions. Word has length 25 [2018-11-10 07:56:40,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:56:40,919 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 127 transitions. [2018-11-10 07:56:40,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 07:56:40,919 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 127 transitions. [2018-11-10 07:56:40,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 07:56:40,920 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:56:40,921 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:56:40,921 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:56:40,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:56:40,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1511077986, now seen corresponding path program 1 times [2018-11-10 07:56:40,921 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:56:40,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:56:40,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:40,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:56:40,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:40,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:56:40,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:56:40,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:56:40,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 07:56:40,983 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 07:56:40,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 07:56:40,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 07:56:40,984 INFO L87 Difference]: Start difference. First operand 110 states and 127 transitions. Second operand 4 states. [2018-11-10 07:56:41,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:56:41,034 INFO L93 Difference]: Finished difference Result 171 states and 197 transitions. [2018-11-10 07:56:41,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 07:56:41,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-10 07:56:41,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:56:41,038 INFO L225 Difference]: With dead ends: 171 [2018-11-10 07:56:41,038 INFO L226 Difference]: Without dead ends: 131 [2018-11-10 07:56:41,039 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:56:41,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-10 07:56:41,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-11-10 07:56:41,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-10 07:56:41,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 153 transitions. [2018-11-10 07:56:41,049 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 153 transitions. Word has length 36 [2018-11-10 07:56:41,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:56:41,049 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 153 transitions. [2018-11-10 07:56:41,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 07:56:41,049 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 153 transitions. [2018-11-10 07:56:41,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-10 07:56:41,050 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:56:41,051 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:56:41,051 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:56:41,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:56:41,051 INFO L82 PathProgramCache]: Analyzing trace with hash 435898900, now seen corresponding path program 1 times [2018-11-10 07:56:41,051 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:56:41,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:56:41,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:41,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:56:41,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:41,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:56:41,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:56:41,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:56:41,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:56:41,103 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:56:41,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:56:41,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:56:41,103 INFO L87 Difference]: Start difference. First operand 131 states and 153 transitions. Second operand 3 states. [2018-11-10 07:56:41,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:56:41,114 INFO L93 Difference]: Finished difference Result 215 states and 253 transitions. [2018-11-10 07:56:41,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:56:41,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-11-10 07:56:41,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:56:41,115 INFO L225 Difference]: With dead ends: 215 [2018-11-10 07:56:41,115 INFO L226 Difference]: Without dead ends: 133 [2018-11-10 07:56:41,115 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:56:41,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-10 07:56:41,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-11-10 07:56:41,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-10 07:56:41,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 155 transitions. [2018-11-10 07:56:41,122 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 155 transitions. Word has length 45 [2018-11-10 07:56:41,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:56:41,122 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 155 transitions. [2018-11-10 07:56:41,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:56:41,122 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 155 transitions. [2018-11-10 07:56:41,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-10 07:56:41,123 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:56:41,123 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:56:41,124 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:56:41,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:56:41,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1732984663, now seen corresponding path program 1 times [2018-11-10 07:56:41,124 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:56:41,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:56:41,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:41,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:56:41,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:41,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:56:41,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 07:56:41,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:56:41,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 07:56:41,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 07:56:41,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 07:56:41,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 07:56:41,197 INFO L87 Difference]: Start difference. First operand 133 states and 155 transitions. Second operand 6 states. [2018-11-10 07:56:41,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:56:41,330 INFO L93 Difference]: Finished difference Result 197 states and 224 transitions. [2018-11-10 07:56:41,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 07:56:41,332 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-11-10 07:56:41,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:56:41,334 INFO L225 Difference]: With dead ends: 197 [2018-11-10 07:56:41,334 INFO L226 Difference]: Without dead ends: 193 [2018-11-10 07:56:41,334 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-10 07:56:41,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-11-10 07:56:41,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 147. [2018-11-10 07:56:41,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-10 07:56:41,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 172 transitions. [2018-11-10 07:56:41,344 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 172 transitions. Word has length 47 [2018-11-10 07:56:41,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:56:41,344 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 172 transitions. [2018-11-10 07:56:41,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 07:56:41,345 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 172 transitions. [2018-11-10 07:56:41,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-10 07:56:41,346 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:56:41,346 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:56:41,346 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:56:41,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:56:41,347 INFO L82 PathProgramCache]: Analyzing trace with hash 600894689, now seen corresponding path program 1 times [2018-11-10 07:56:41,347 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:56:41,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:56:41,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:41,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:56:41,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:41,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:56:41,413 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 07:56:41,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:56:41,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 07:56:41,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 07:56:41,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 07:56:41,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 07:56:41,414 INFO L87 Difference]: Start difference. First operand 147 states and 172 transitions. Second operand 6 states. [2018-11-10 07:56:41,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:56:41,525 INFO L93 Difference]: Finished difference Result 200 states and 227 transitions. [2018-11-10 07:56:41,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 07:56:41,526 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2018-11-10 07:56:41,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:56:41,527 INFO L225 Difference]: With dead ends: 200 [2018-11-10 07:56:41,527 INFO L226 Difference]: Without dead ends: 188 [2018-11-10 07:56:41,527 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-10 07:56:41,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-11-10 07:56:41,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 144. [2018-11-10 07:56:41,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-10 07:56:41,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 168 transitions. [2018-11-10 07:56:41,545 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 168 transitions. Word has length 52 [2018-11-10 07:56:41,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:56:41,545 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 168 transitions. [2018-11-10 07:56:41,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 07:56:41,545 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 168 transitions. [2018-11-10 07:56:41,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-10 07:56:41,546 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:56:41,547 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:56:41,547 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:56:41,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:56:41,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1312238892, now seen corresponding path program 1 times [2018-11-10 07:56:41,547 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:56:41,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:56:41,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:41,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:56:41,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:41,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:56:41,616 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 07:56:41,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:56:41,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 07:56:41,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 07:56:41,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 07:56:41,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 07:56:41,617 INFO L87 Difference]: Start difference. First operand 144 states and 168 transitions. Second operand 6 states. [2018-11-10 07:56:41,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:56:41,696 INFO L93 Difference]: Finished difference Result 186 states and 212 transitions. [2018-11-10 07:56:41,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 07:56:41,697 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2018-11-10 07:56:41,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:56:41,698 INFO L225 Difference]: With dead ends: 186 [2018-11-10 07:56:41,698 INFO L226 Difference]: Without dead ends: 167 [2018-11-10 07:56:41,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-10 07:56:41,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-10 07:56:41,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 139. [2018-11-10 07:56:41,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-10 07:56:41,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 162 transitions. [2018-11-10 07:56:41,707 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 162 transitions. Word has length 52 [2018-11-10 07:56:41,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:56:41,707 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 162 transitions. [2018-11-10 07:56:41,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 07:56:41,707 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 162 transitions. [2018-11-10 07:56:41,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-10 07:56:41,708 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:56:41,709 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:56:41,709 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:56:41,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:56:41,709 INFO L82 PathProgramCache]: Analyzing trace with hash -2132166722, now seen corresponding path program 1 times [2018-11-10 07:56:41,709 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:56:41,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:56:41,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:41,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:56:41,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:41,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:56:41,857 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 07:56:41,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:56:41,858 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_102cc9ea-1c7b-42da-9fe5-a74866f1bf5d/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:56:41,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:56:41,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:56:41,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:56:41,921 INFO L477 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 6 treesize of output 5 [2018-11-10 07:56:41,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:41,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:41,925 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 07:56:41,955 INFO L477 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 11 treesize of output 8 [2018-11-10 07:56:41,960 INFO L477 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 8 treesize of output 7 [2018-11-10 07:56:41,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:41,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:41,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:41,971 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-11-10 07:56:41,992 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:56:41,993 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:56:41,993 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 07:56:41,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:41,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:41,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-11-10 07:56:42,030 INFO L477 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 13 treesize of output 10 [2018-11-10 07:56:42,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-11-10 07:56:42,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:42,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:42,040 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-10 07:56:42,041 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-11-10 07:56:42,057 INFO L477 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 20 treesize of output 16 [2018-11-10 07:56:42,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 4 [2018-11-10 07:56:42,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:42,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:42,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:42,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:12 [2018-11-10 07:56:42,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 20 [2018-11-10 07:56:42,077 INFO L477 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 8 treesize of output 7 [2018-11-10 07:56:42,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:42,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:42,084 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-10 07:56:42,084 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-11-10 07:56:42,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 22 treesize of output 20 [2018-11-10 07:56:42,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-10 07:56:42,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:42,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-10 07:56:42,143 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:42,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:42,149 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-10 07:56:42,149 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-11-10 07:56:42,169 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 07:56:42,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:56:42,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 21 [2018-11-10 07:56:42,186 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-10 07:56:42,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-10 07:56:42,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2018-11-10 07:56:42,186 INFO L87 Difference]: Start difference. First operand 139 states and 162 transitions. Second operand 21 states. [2018-11-10 07:56:42,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:56:42,725 INFO L93 Difference]: Finished difference Result 218 states and 246 transitions. [2018-11-10 07:56:42,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 07:56:42,726 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 57 [2018-11-10 07:56:42,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:56:42,726 INFO L225 Difference]: With dead ends: 218 [2018-11-10 07:56:42,727 INFO L226 Difference]: Without dead ends: 209 [2018-11-10 07:56:42,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=273, Invalid=1059, Unknown=0, NotChecked=0, Total=1332 [2018-11-10 07:56:42,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-11-10 07:56:42,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 154. [2018-11-10 07:56:42,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-10 07:56:42,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 178 transitions. [2018-11-10 07:56:42,734 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 178 transitions. Word has length 57 [2018-11-10 07:56:42,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:56:42,734 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 178 transitions. [2018-11-10 07:56:42,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-10 07:56:42,734 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 178 transitions. [2018-11-10 07:56:42,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-10 07:56:42,735 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:56:42,735 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:56:42,735 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:56:42,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:56:42,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1129006352, now seen corresponding path program 1 times [2018-11-10 07:56:42,735 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:56:42,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:56:42,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:42,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:56:42,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:42,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:56:42,893 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 07:56:42,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:56:42,894 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_102cc9ea-1c7b-42da-9fe5-a74866f1bf5d/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:56:42,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:56:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:56:42,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:56:42,928 INFO L477 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 6 treesize of output 5 [2018-11-10 07:56:42,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:42,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:42,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 07:56:42,941 INFO L477 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 11 treesize of output 8 [2018-11-10 07:56:42,943 INFO L477 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 8 treesize of output 7 [2018-11-10 07:56:42,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:42,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:42,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:42,951 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-11-10 07:56:42,972 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:56:42,972 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:56:42,973 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 07:56:42,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:42,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:42,979 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-11-10 07:56:43,029 INFO L477 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 13 treesize of output 10 [2018-11-10 07:56:43,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-11-10 07:56:43,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:43,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:43,065 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-10 07:56:43,065 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-11-10 07:56:43,095 INFO L477 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 20 treesize of output 16 [2018-11-10 07:56:43,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 4 [2018-11-10 07:56:43,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:43,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:43,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:43,102 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:12 [2018-11-10 07:56:43,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 20 [2018-11-10 07:56:43,122 INFO L477 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 8 treesize of output 7 [2018-11-10 07:56:43,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:43,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:43,129 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-10 07:56:43,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-11-10 07:56:43,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 22 treesize of output 20 [2018-11-10 07:56:43,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-10 07:56:43,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:43,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-10 07:56:43,195 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:43,196 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:43,199 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-10 07:56:43,199 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-11-10 07:56:43,213 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 07:56:43,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:56:43,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 21 [2018-11-10 07:56:43,229 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-10 07:56:43,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-10 07:56:43,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2018-11-10 07:56:43,230 INFO L87 Difference]: Start difference. First operand 154 states and 178 transitions. Second operand 21 states. [2018-11-10 07:56:43,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:56:43,685 INFO L93 Difference]: Finished difference Result 230 states and 260 transitions. [2018-11-10 07:56:43,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-10 07:56:43,685 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 57 [2018-11-10 07:56:43,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:56:43,686 INFO L225 Difference]: With dead ends: 230 [2018-11-10 07:56:43,686 INFO L226 Difference]: Without dead ends: 226 [2018-11-10 07:56:43,687 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=258, Invalid=1002, Unknown=0, NotChecked=0, Total=1260 [2018-11-10 07:56:43,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-11-10 07:56:43,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 175. [2018-11-10 07:56:43,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-11-10 07:56:43,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 202 transitions. [2018-11-10 07:56:43,693 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 202 transitions. Word has length 57 [2018-11-10 07:56:43,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:56:43,694 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 202 transitions. [2018-11-10 07:56:43,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-10 07:56:43,694 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 202 transitions. [2018-11-10 07:56:43,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-10 07:56:43,694 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:56:43,694 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:56:43,694 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:56:43,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:56:43,695 INFO L82 PathProgramCache]: Analyzing trace with hash -56173275, now seen corresponding path program 1 times [2018-11-10 07:56:43,695 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:56:43,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:56:43,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:43,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:56:43,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:43,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:56:43,898 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-10 07:56:43,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:56:43,898 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_102cc9ea-1c7b-42da-9fe5-a74866f1bf5d/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:56:43,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:56:43,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:56:43,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:56:43,941 INFO L477 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 13 treesize of output 10 [2018-11-10 07:56:43,942 INFO L477 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 10 treesize of output 9 [2018-11-10 07:56:43,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:43,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:43,950 INFO L477 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 13 treesize of output 10 [2018-11-10 07:56:43,951 INFO L477 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 10 treesize of output 9 [2018-11-10 07:56:43,952 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:43,953 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:43,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:43,973 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:7 [2018-11-10 07:56:43,999 INFO L477 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 20 [2018-11-10 07:56:44,000 INFO L477 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 20 treesize of output 19 [2018-11-10 07:56:44,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:44,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:44,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:44,003 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:19 [2018-11-10 07:56:44,030 INFO L477 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 29 treesize of output 25 [2018-11-10 07:56:44,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 25 treesize of output 13 [2018-11-10 07:56:44,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:44,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:44,036 INFO L477 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 23 treesize of output 19 [2018-11-10 07:56:44,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 19 treesize of output 7 [2018-11-10 07:56:44,038 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:44,039 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:44,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:44,040 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:7 [2018-11-10 07:56:44,051 INFO L477 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 15 treesize of output 11 [2018-11-10 07:56:44,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-10 07:56:44,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:44,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:44,056 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-10 07:56:44,056 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-10 07:56:44,065 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 07:56:44,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:56:44,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 19 [2018-11-10 07:56:44,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-10 07:56:44,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 07:56:44,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2018-11-10 07:56:44,082 INFO L87 Difference]: Start difference. First operand 175 states and 202 transitions. Second operand 19 states. [2018-11-10 07:56:44,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:56:44,465 INFO L93 Difference]: Finished difference Result 224 states and 254 transitions. [2018-11-10 07:56:44,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 07:56:44,466 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 62 [2018-11-10 07:56:44,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:56:44,466 INFO L225 Difference]: With dead ends: 224 [2018-11-10 07:56:44,466 INFO L226 Difference]: Without dead ends: 220 [2018-11-10 07:56:44,467 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=789, Unknown=0, NotChecked=0, Total=992 [2018-11-10 07:56:44,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-11-10 07:56:44,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 177. [2018-11-10 07:56:44,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-11-10 07:56:44,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 204 transitions. [2018-11-10 07:56:44,474 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 204 transitions. Word has length 62 [2018-11-10 07:56:44,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:56:44,474 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 204 transitions. [2018-11-10 07:56:44,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-10 07:56:44,475 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 204 transitions. [2018-11-10 07:56:44,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-10 07:56:44,475 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:56:44,475 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:56:44,476 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:56:44,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:56:44,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1950575928, now seen corresponding path program 1 times [2018-11-10 07:56:44,476 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:56:44,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:56:44,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:44,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:56:44,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:44,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:56:44,645 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-10 07:56:44,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:56:44,645 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_102cc9ea-1c7b-42da-9fe5-a74866f1bf5d/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:56:44,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:56:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:56:44,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:56:44,725 INFO L477 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 13 treesize of output 10 [2018-11-10 07:56:44,738 INFO L477 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 10 treesize of output 9 [2018-11-10 07:56:44,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:44,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:44,751 INFO L477 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 13 treesize of output 10 [2018-11-10 07:56:44,753 INFO L477 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 10 treesize of output 9 [2018-11-10 07:56:44,754 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:44,757 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:44,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:44,763 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:7 [2018-11-10 07:56:44,813 INFO L477 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 20 [2018-11-10 07:56:44,815 INFO L477 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 20 treesize of output 19 [2018-11-10 07:56:44,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:44,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:44,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:44,818 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:19 [2018-11-10 07:56:44,865 INFO L477 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 29 treesize of output 25 [2018-11-10 07:56:44,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 25 treesize of output 13 [2018-11-10 07:56:44,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:44,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:44,871 INFO L477 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 23 treesize of output 19 [2018-11-10 07:56:44,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 19 treesize of output 7 [2018-11-10 07:56:44,873 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:44,874 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:44,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:44,875 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:7 [2018-11-10 07:56:44,884 INFO L477 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 15 treesize of output 11 [2018-11-10 07:56:44,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-10 07:56:44,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:44,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:44,890 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-10 07:56:44,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-10 07:56:44,904 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 07:56:44,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:56:44,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 19 [2018-11-10 07:56:44,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-10 07:56:44,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 07:56:44,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2018-11-10 07:56:44,921 INFO L87 Difference]: Start difference. First operand 177 states and 204 transitions. Second operand 19 states. [2018-11-10 07:56:45,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:56:45,360 INFO L93 Difference]: Finished difference Result 234 states and 264 transitions. [2018-11-10 07:56:45,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 07:56:45,360 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 62 [2018-11-10 07:56:45,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:56:45,361 INFO L225 Difference]: With dead ends: 234 [2018-11-10 07:56:45,361 INFO L226 Difference]: Without dead ends: 230 [2018-11-10 07:56:45,362 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=789, Unknown=0, NotChecked=0, Total=992 [2018-11-10 07:56:45,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-11-10 07:56:45,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 185. [2018-11-10 07:56:45,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-11-10 07:56:45,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 213 transitions. [2018-11-10 07:56:45,367 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 213 transitions. Word has length 62 [2018-11-10 07:56:45,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:56:45,367 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 213 transitions. [2018-11-10 07:56:45,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-10 07:56:45,367 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 213 transitions. [2018-11-10 07:56:45,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-10 07:56:45,368 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:56:45,368 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:56:45,368 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:56:45,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:56:45,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1239231725, now seen corresponding path program 1 times [2018-11-10 07:56:45,368 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:56:45,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:56:45,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:45,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:56:45,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:45,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:56:45,464 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 07:56:45,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:56:45,464 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_102cc9ea-1c7b-42da-9fe5-a74866f1bf5d/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:56:45,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:56:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:56:45,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:56:45,502 INFO L477 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 13 treesize of output 10 [2018-11-10 07:56:45,505 INFO L477 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 10 treesize of output 9 [2018-11-10 07:56:45,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:45,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:45,513 INFO L477 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 13 treesize of output 10 [2018-11-10 07:56:45,514 INFO L477 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 10 treesize of output 9 [2018-11-10 07:56:45,514 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:45,516 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:45,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:45,520 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:7 [2018-11-10 07:56:45,546 INFO L477 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 20 [2018-11-10 07:56:45,547 INFO L477 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 20 treesize of output 19 [2018-11-10 07:56:45,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:45,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:45,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:45,549 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:19 [2018-11-10 07:56:45,581 INFO L477 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 29 treesize of output 25 [2018-11-10 07:56:45,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 25 treesize of output 13 [2018-11-10 07:56:45,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:45,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:45,603 INFO L477 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 23 treesize of output 19 [2018-11-10 07:56:45,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 19 treesize of output 7 [2018-11-10 07:56:45,605 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:45,606 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:45,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:45,607 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:7 [2018-11-10 07:56:45,640 INFO L477 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 15 treesize of output 11 [2018-11-10 07:56:45,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-10 07:56:45,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:45,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:45,643 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-10 07:56:45,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-10 07:56:45,661 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 07:56:45,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:56:45,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 22 [2018-11-10 07:56:45,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-10 07:56:45,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-10 07:56:45,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2018-11-10 07:56:45,678 INFO L87 Difference]: Start difference. First operand 185 states and 213 transitions. Second operand 22 states. [2018-11-10 07:56:46,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:56:46,298 INFO L93 Difference]: Finished difference Result 244 states and 275 transitions. [2018-11-10 07:56:46,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 07:56:46,298 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 62 [2018-11-10 07:56:46,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:56:46,299 INFO L225 Difference]: With dead ends: 244 [2018-11-10 07:56:46,299 INFO L226 Difference]: Without dead ends: 230 [2018-11-10 07:56:46,299 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=248, Invalid=1158, Unknown=0, NotChecked=0, Total=1406 [2018-11-10 07:56:46,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-11-10 07:56:46,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 185. [2018-11-10 07:56:46,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-11-10 07:56:46,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 212 transitions. [2018-11-10 07:56:46,304 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 212 transitions. Word has length 62 [2018-11-10 07:56:46,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:56:46,305 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 212 transitions. [2018-11-10 07:56:46,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-10 07:56:46,305 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 212 transitions. [2018-11-10 07:56:46,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-10 07:56:46,305 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:56:46,306 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:56:46,306 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:56:46,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:56:46,306 INFO L82 PathProgramCache]: Analyzing trace with hash -139083821, now seen corresponding path program 1 times [2018-11-10 07:56:46,306 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:56:46,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:56:46,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:46,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:56:46,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:46,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:56:46,444 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:56:46,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:56:46,445 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_102cc9ea-1c7b-42da-9fe5-a74866f1bf5d/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:56:46,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:56:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:56:46,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:56:46,489 INFO L477 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 13 treesize of output 10 [2018-11-10 07:56:46,490 INFO L477 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 10 treesize of output 9 [2018-11-10 07:56:46,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:46,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:46,499 INFO L477 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 13 treesize of output 10 [2018-11-10 07:56:46,501 INFO L477 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 10 treesize of output 9 [2018-11-10 07:56:46,501 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:46,503 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:46,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:46,507 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:7 [2018-11-10 07:56:46,532 INFO L477 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 20 [2018-11-10 07:56:46,533 INFO L477 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 20 treesize of output 19 [2018-11-10 07:56:46,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:46,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:46,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:46,536 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:19 [2018-11-10 07:56:46,557 INFO L477 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 29 treesize of output 25 [2018-11-10 07:56:46,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 25 treesize of output 13 [2018-11-10 07:56:46,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:46,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:46,568 INFO L477 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 23 treesize of output 19 [2018-11-10 07:56:46,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 19 treesize of output 7 [2018-11-10 07:56:46,569 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:46,572 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:46,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:46,573 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:7 [2018-11-10 07:56:46,589 INFO L477 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 15 treesize of output 11 [2018-11-10 07:56:46,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-10 07:56:46,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:46,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:46,596 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-10 07:56:46,596 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-10 07:56:46,608 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 07:56:46,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:56:46,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 20 [2018-11-10 07:56:46,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-10 07:56:46,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-10 07:56:46,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2018-11-10 07:56:46,624 INFO L87 Difference]: Start difference. First operand 185 states and 212 transitions. Second operand 20 states. [2018-11-10 07:56:46,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:56:46,998 INFO L93 Difference]: Finished difference Result 232 states and 261 transitions. [2018-11-10 07:56:46,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 07:56:46,998 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 67 [2018-11-10 07:56:46,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:56:46,999 INFO L225 Difference]: With dead ends: 232 [2018-11-10 07:56:46,999 INFO L226 Difference]: Without dead ends: 220 [2018-11-10 07:56:46,999 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=208, Invalid=848, Unknown=0, NotChecked=0, Total=1056 [2018-11-10 07:56:46,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-11-10 07:56:47,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 185. [2018-11-10 07:56:47,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-11-10 07:56:47,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 211 transitions. [2018-11-10 07:56:47,005 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 211 transitions. Word has length 67 [2018-11-10 07:56:47,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:56:47,006 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 211 transitions. [2018-11-10 07:56:47,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-10 07:56:47,006 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 211 transitions. [2018-11-10 07:56:47,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-10 07:56:47,007 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:56:47,007 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:56:47,007 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:56:47,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:56:47,007 INFO L82 PathProgramCache]: Analyzing trace with hash 572260382, now seen corresponding path program 2 times [2018-11-10 07:56:47,007 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:56:47,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:56:47,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:47,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:56:47,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:56:47,148 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:56:47,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:56:47,148 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_102cc9ea-1c7b-42da-9fe5-a74866f1bf5d/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:56:47,154 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 07:56:47,171 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 07:56:47,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:56:47,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:56:47,192 INFO L477 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 13 treesize of output 10 [2018-11-10 07:56:47,194 INFO L477 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 10 treesize of output 9 [2018-11-10 07:56:47,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:47,196 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:47,204 INFO L477 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 13 treesize of output 10 [2018-11-10 07:56:47,206 INFO L477 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 10 treesize of output 9 [2018-11-10 07:56:47,206 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:47,208 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:47,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:47,213 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:36, output treesize:10 [2018-11-10 07:56:47,227 INFO L477 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 20 [2018-11-10 07:56:47,228 INFO L477 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 20 treesize of output 19 [2018-11-10 07:56:47,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:47,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:47,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:47,232 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:23 [2018-11-10 07:56:47,245 INFO L477 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 23 treesize of output 19 [2018-11-10 07:56:47,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 19 treesize of output 11 [2018-11-10 07:56:47,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:47,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:47,251 INFO L477 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 19 treesize of output 15 [2018-11-10 07:56:47,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 7 [2018-11-10 07:56:47,252 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:47,253 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:47,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:47,254 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:30, output treesize:7 [2018-11-10 07:56:47,267 INFO L477 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 15 treesize of output 11 [2018-11-10 07:56:47,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-10 07:56:47,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:47,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:47,270 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-10 07:56:47,270 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-10 07:56:47,280 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 07:56:47,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:56:47,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 15 [2018-11-10 07:56:47,295 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 07:56:47,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 07:56:47,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-11-10 07:56:47,296 INFO L87 Difference]: Start difference. First operand 185 states and 211 transitions. Second operand 15 states. [2018-11-10 07:56:47,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:56:47,557 INFO L93 Difference]: Finished difference Result 218 states and 246 transitions. [2018-11-10 07:56:47,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 07:56:47,557 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2018-11-10 07:56:47,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:56:47,558 INFO L225 Difference]: With dead ends: 218 [2018-11-10 07:56:47,558 INFO L226 Difference]: Without dead ends: 194 [2018-11-10 07:56:47,558 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 62 SyntacticMatches, 9 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2018-11-10 07:56:47,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-11-10 07:56:47,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 175. [2018-11-10 07:56:47,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-11-10 07:56:47,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 200 transitions. [2018-11-10 07:56:47,563 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 200 transitions. Word has length 67 [2018-11-10 07:56:47,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:56:47,563 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 200 transitions. [2018-11-10 07:56:47,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 07:56:47,563 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 200 transitions. [2018-11-10 07:56:47,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-10 07:56:47,564 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:56:47,564 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:56:47,564 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:56:47,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:56:47,565 INFO L82 PathProgramCache]: Analyzing trace with hash -925492379, now seen corresponding path program 2 times [2018-11-10 07:56:47,565 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:56:47,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:56:47,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:47,565 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:56:47,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:56:47,796 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 07:56:47,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:56:47,796 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_102cc9ea-1c7b-42da-9fe5-a74866f1bf5d/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:56:47,802 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 07:56:47,818 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 07:56:47,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:56:47,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:56:47,825 INFO L477 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 6 treesize of output 5 [2018-11-10 07:56:47,825 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:47,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:47,828 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 07:56:47,838 INFO L477 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 11 treesize of output 8 [2018-11-10 07:56:47,840 INFO L477 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 8 treesize of output 7 [2018-11-10 07:56:47,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:47,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:47,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:47,848 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-10 07:56:47,871 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:56:47,872 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:56:47,872 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 07:56:47,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:47,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:47,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2018-11-10 07:56:47,912 INFO L477 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 13 treesize of output 10 [2018-11-10 07:56:47,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-11-10 07:56:47,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:47,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:47,920 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-10 07:56:47,920 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-11-10 07:56:47,940 INFO L477 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 20 treesize of output 16 [2018-11-10 07:56:47,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 4 [2018-11-10 07:56:47,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:47,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:47,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:47,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2018-11-10 07:56:47,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 20 [2018-11-10 07:56:47,957 INFO L477 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 8 treesize of output 7 [2018-11-10 07:56:47,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:47,960 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:47,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:47,964 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-10 07:56:48,018 INFO L477 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 13 treesize of output 10 [2018-11-10 07:56:48,020 INFO L477 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 10 treesize of output 9 [2018-11-10 07:56:48,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:48,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:48,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:48,026 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-11-10 07:56:48,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 19 treesize of output 15 [2018-11-10 07:56:48,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 3 [2018-11-10 07:56:48,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:48,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:48,081 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-10 07:56:48,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:25 [2018-11-10 07:56:48,136 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:56:48,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 26 treesize of output 64 [2018-11-10 07:56:48,152 INFO L477 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 44 treesize of output 42 [2018-11-10 07:56:48,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:48,199 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:56:48,199 INFO L477 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 24 treesize of output 21 [2018-11-10 07:56:48,199 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:48,220 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:56:48,225 INFO L477 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 2 case distinctions, treesize of input 24 treesize of output 29 [2018-11-10 07:56:48,225 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-10 07:56:48,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 07:56:48,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-11-10 07:56:48,265 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:74 [2018-11-10 07:56:48,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 22 treesize of output 20 [2018-11-10 07:56:48,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-10 07:56:48,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:48,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-10 07:56:48,424 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:48,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:48,427 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-10 07:56:48,428 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2018-11-10 07:56:48,451 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 07:56:48,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:56:48,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 36 [2018-11-10 07:56:48,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-10 07:56:48,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-10 07:56:48,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1104, Unknown=0, NotChecked=0, Total=1260 [2018-11-10 07:56:48,469 INFO L87 Difference]: Start difference. First operand 175 states and 200 transitions. Second operand 36 states. [2018-11-10 07:56:49,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:56:49,576 INFO L93 Difference]: Finished difference Result 245 states and 274 transitions. [2018-11-10 07:56:49,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-10 07:56:49,577 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 67 [2018-11-10 07:56:49,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:56:49,577 INFO L225 Difference]: With dead ends: 245 [2018-11-10 07:56:49,577 INFO L226 Difference]: Without dead ends: 241 [2018-11-10 07:56:49,578 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 801 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=547, Invalid=3113, Unknown=0, NotChecked=0, Total=3660 [2018-11-10 07:56:49,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-11-10 07:56:49,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 190. [2018-11-10 07:56:49,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-11-10 07:56:49,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 217 transitions. [2018-11-10 07:56:49,584 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 217 transitions. Word has length 67 [2018-11-10 07:56:49,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:56:49,585 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 217 transitions. [2018-11-10 07:56:49,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-10 07:56:49,585 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 217 transitions. [2018-11-10 07:56:49,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-10 07:56:49,585 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:56:49,585 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:56:49,585 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:56:49,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:56:49,586 INFO L82 PathProgramCache]: Analyzing trace with hash -2129717232, now seen corresponding path program 2 times [2018-11-10 07:56:49,586 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:56:49,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:56:49,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:49,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:56:49,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:56:49,714 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:56:49,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:56:49,714 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_102cc9ea-1c7b-42da-9fe5-a74866f1bf5d/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:56:49,720 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 07:56:49,741 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 07:56:49,741 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:56:49,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:56:49,765 INFO L477 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 13 treesize of output 10 [2018-11-10 07:56:49,767 INFO L477 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 10 treesize of output 9 [2018-11-10 07:56:49,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:49,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:49,775 INFO L477 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 13 treesize of output 10 [2018-11-10 07:56:49,777 INFO L477 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 10 treesize of output 9 [2018-11-10 07:56:49,777 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:49,778 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:49,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:49,783 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:36, output treesize:10 [2018-11-10 07:56:49,795 INFO L477 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 20 [2018-11-10 07:56:49,796 INFO L477 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 20 treesize of output 19 [2018-11-10 07:56:49,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:49,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:49,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:49,800 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:23 [2018-11-10 07:56:49,813 INFO L477 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 23 treesize of output 19 [2018-11-10 07:56:49,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 19 treesize of output 11 [2018-11-10 07:56:49,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:49,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:49,820 INFO L477 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 19 treesize of output 15 [2018-11-10 07:56:49,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 7 [2018-11-10 07:56:49,821 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:49,822 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:49,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:49,823 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:30, output treesize:7 [2018-11-10 07:56:49,830 INFO L477 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 15 treesize of output 11 [2018-11-10 07:56:49,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-10 07:56:49,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:49,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:49,834 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-10 07:56:49,834 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-10 07:56:49,847 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 07:56:49,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:56:49,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 15 [2018-11-10 07:56:49,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-10 07:56:49,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 07:56:49,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-11-10 07:56:49,864 INFO L87 Difference]: Start difference. First operand 190 states and 217 transitions. Second operand 15 states. [2018-11-10 07:56:50,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:56:50,156 INFO L93 Difference]: Finished difference Result 226 states and 254 transitions. [2018-11-10 07:56:50,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 07:56:50,156 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2018-11-10 07:56:50,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:56:50,157 INFO L225 Difference]: With dead ends: 226 [2018-11-10 07:56:50,157 INFO L226 Difference]: Without dead ends: 204 [2018-11-10 07:56:50,158 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 63 SyntacticMatches, 8 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2018-11-10 07:56:50,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-11-10 07:56:50,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 180. [2018-11-10 07:56:50,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-11-10 07:56:50,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 206 transitions. [2018-11-10 07:56:50,163 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 206 transitions. Word has length 67 [2018-11-10 07:56:50,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:56:50,163 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 206 transitions. [2018-11-10 07:56:50,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-10 07:56:50,163 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 206 transitions. [2018-11-10 07:56:50,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-10 07:56:50,164 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:56:50,164 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:56:50,164 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:56:50,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:56:50,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1840032311, now seen corresponding path program 1 times [2018-11-10 07:56:50,165 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:56:50,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:56:50,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:50,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:56:50,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:50,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:56:50,477 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 07:56:50,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:56:50,477 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_102cc9ea-1c7b-42da-9fe5-a74866f1bf5d/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:56:50,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:56:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:56:50,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:56:50,518 INFO L477 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 6 treesize of output 5 [2018-11-10 07:56:50,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:50,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:50,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 07:56:50,533 INFO L477 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 11 treesize of output 8 [2018-11-10 07:56:50,535 INFO L477 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 8 treesize of output 7 [2018-11-10 07:56:50,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:50,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:50,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:50,544 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-10 07:56:50,570 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:56:50,571 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:56:50,572 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 07:56:50,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:50,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:50,600 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2018-11-10 07:56:50,654 INFO L477 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 13 treesize of output 10 [2018-11-10 07:56:50,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-11-10 07:56:50,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:50,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:50,668 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-10 07:56:50,668 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-11-10 07:56:50,695 INFO L477 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 20 treesize of output 16 [2018-11-10 07:56:50,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 4 [2018-11-10 07:56:50,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:50,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:50,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:50,702 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2018-11-10 07:56:50,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 20 [2018-11-10 07:56:50,715 INFO L477 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 8 treesize of output 7 [2018-11-10 07:56:50,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:50,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:50,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:50,724 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-10 07:56:50,787 INFO L477 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 13 treesize of output 10 [2018-11-10 07:56:50,789 INFO L477 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 10 treesize of output 9 [2018-11-10 07:56:50,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:50,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:50,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:50,797 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-11-10 07:56:50,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 19 treesize of output 15 [2018-11-10 07:56:50,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 3 [2018-11-10 07:56:50,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:50,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:50,830 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-10 07:56:50,831 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:25 [2018-11-10 07:56:50,894 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:56:50,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 26 treesize of output 64 [2018-11-10 07:56:50,910 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-10 07:56:50,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:50,966 INFO L477 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 23 treesize of output 22 [2018-11-10 07:56:50,967 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:50,991 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:56:50,996 INFO L477 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 2 case distinctions, treesize of input 24 treesize of output 29 [2018-11-10 07:56:50,996 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-10 07:56:51,020 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:56:51,021 INFO L477 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 24 treesize of output 21 [2018-11-10 07:56:51,021 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:51,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 07:56:51,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-11-10 07:56:51,053 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:33, output treesize:74 [2018-11-10 07:56:51,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 22 treesize of output 20 [2018-11-10 07:56:51,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-10 07:56:51,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:51,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-10 07:56:51,230 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:51,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:51,233 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-10 07:56:51,233 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2018-11-10 07:56:51,251 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 07:56:51,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:56:51,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 36 [2018-11-10 07:56:51,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-10 07:56:51,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-10 07:56:51,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1108, Unknown=0, NotChecked=0, Total=1260 [2018-11-10 07:56:51,268 INFO L87 Difference]: Start difference. First operand 180 states and 206 transitions. Second operand 36 states. [2018-11-10 07:56:52,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:56:52,522 INFO L93 Difference]: Finished difference Result 289 states and 323 transitions. [2018-11-10 07:56:52,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-10 07:56:52,522 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 67 [2018-11-10 07:56:52,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:56:52,523 INFO L225 Difference]: With dead ends: 289 [2018-11-10 07:56:52,523 INFO L226 Difference]: Without dead ends: 283 [2018-11-10 07:56:52,524 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1154 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=685, Invalid=4007, Unknown=0, NotChecked=0, Total=4692 [2018-11-10 07:56:52,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-11-10 07:56:52,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 190. [2018-11-10 07:56:52,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-11-10 07:56:52,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 217 transitions. [2018-11-10 07:56:52,534 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 217 transitions. Word has length 67 [2018-11-10 07:56:52,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:56:52,534 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 217 transitions. [2018-11-10 07:56:52,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-10 07:56:52,534 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 217 transitions. [2018-11-10 07:56:52,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 07:56:52,535 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:56:52,535 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:56:52,535 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:56:52,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:56:52,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1433179757, now seen corresponding path program 1 times [2018-11-10 07:56:52,535 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:56:52,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:56:52,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:52,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:56:52,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:52,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:56:52,808 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 07:56:52,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:56:52,809 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_102cc9ea-1c7b-42da-9fe5-a74866f1bf5d/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:56:52,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:56:52,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:56:52,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:56:52,836 INFO L477 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 6 treesize of output 5 [2018-11-10 07:56:52,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:52,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:52,839 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 07:56:52,849 INFO L477 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 11 treesize of output 8 [2018-11-10 07:56:52,850 INFO L477 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 8 treesize of output 7 [2018-11-10 07:56:52,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:52,854 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:52,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:52,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-10 07:56:52,881 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:56:52,882 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:56:52,882 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 07:56:52,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:52,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:52,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2018-11-10 07:56:52,929 INFO L477 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 13 treesize of output 10 [2018-11-10 07:56:52,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-11-10 07:56:52,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:52,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:52,939 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-10 07:56:52,939 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-11-10 07:56:52,965 INFO L477 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 20 treesize of output 16 [2018-11-10 07:56:52,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 4 [2018-11-10 07:56:52,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:52,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:52,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:52,971 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2018-11-10 07:56:52,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 20 [2018-11-10 07:56:52,984 INFO L477 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 8 treesize of output 7 [2018-11-10 07:56:52,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:52,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:52,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:52,993 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-10 07:56:53,060 INFO L477 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 13 treesize of output 10 [2018-11-10 07:56:53,062 INFO L477 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 10 treesize of output 9 [2018-11-10 07:56:53,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:53,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:53,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:53,070 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-11-10 07:56:53,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 19 treesize of output 15 [2018-11-10 07:56:53,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 3 [2018-11-10 07:56:53,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:53,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:53,111 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-10 07:56:53,112 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:25 [2018-11-10 07:56:53,179 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:56:53,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 26 treesize of output 64 [2018-11-10 07:56:53,198 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-10 07:56:53,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:53,270 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:56:53,275 INFO L477 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 2 case distinctions, treesize of input 24 treesize of output 29 [2018-11-10 07:56:53,275 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-10 07:56:53,315 INFO L477 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 23 treesize of output 22 [2018-11-10 07:56:53,316 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:53,344 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:56:53,344 INFO L477 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 24 treesize of output 21 [2018-11-10 07:56:53,345 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:53,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 07:56:53,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-11-10 07:56:53,381 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:33, output treesize:74 [2018-11-10 07:56:53,468 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:56:53,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 26 treesize of output 28 [2018-11-10 07:56:53,474 INFO L477 Elim1Store]: Elim1 applied some 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 1 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 07:56:53,474 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 07:56:53,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-10 07:56:53,481 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:53,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:53,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 26 treesize of output 20 [2018-11-10 07:56:53,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-10 07:56:53,494 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:53,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-10 07:56:53,498 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:53,500 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:53,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 07:56:53,505 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:53, output treesize:7 [2018-11-10 07:56:53,541 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 07:56:53,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:56:53,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 35 [2018-11-10 07:56:53,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-10 07:56:53,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-10 07:56:53,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1039, Unknown=0, NotChecked=0, Total=1190 [2018-11-10 07:56:53,558 INFO L87 Difference]: Start difference. First operand 190 states and 217 transitions. Second operand 35 states. [2018-11-10 07:56:54,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:56:54,764 INFO L93 Difference]: Finished difference Result 244 states and 274 transitions. [2018-11-10 07:56:54,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-10 07:56:54,765 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 72 [2018-11-10 07:56:54,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:56:54,765 INFO L225 Difference]: With dead ends: 244 [2018-11-10 07:56:54,765 INFO L226 Difference]: Without dead ends: 232 [2018-11-10 07:56:54,766 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=512, Invalid=2794, Unknown=0, NotChecked=0, Total=3306 [2018-11-10 07:56:54,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-11-10 07:56:54,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 195. [2018-11-10 07:56:54,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-11-10 07:56:54,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 222 transitions. [2018-11-10 07:56:54,771 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 222 transitions. Word has length 72 [2018-11-10 07:56:54,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:56:54,771 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 222 transitions. [2018-11-10 07:56:54,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-10 07:56:54,771 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 222 transitions. [2018-11-10 07:56:54,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 07:56:54,772 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:56:54,772 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:56:54,772 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:56:54,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:56:54,773 INFO L82 PathProgramCache]: Analyzing trace with hash -721835554, now seen corresponding path program 3 times [2018-11-10 07:56:54,773 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:56:54,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:56:54,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:54,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:56:54,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:54,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:56:55,142 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:56:55,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:56:55,143 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_102cc9ea-1c7b-42da-9fe5-a74866f1bf5d/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:56:55,149 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 07:56:55,171 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-10 07:56:55,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:56:55,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:56:55,175 INFO L477 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 6 treesize of output 5 [2018-11-10 07:56:55,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:55,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:55,178 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-10 07:56:55,188 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:56:55,188 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:56:55,189 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-10 07:56:55,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:55,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:55,194 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-11-10 07:56:55,237 INFO L477 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 13 treesize of output 10 [2018-11-10 07:56:55,239 INFO L477 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 10 treesize of output 9 [2018-11-10 07:56:55,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:55,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:55,250 INFO L477 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 13 treesize of output 10 [2018-11-10 07:56:55,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-11-10 07:56:55,251 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:55,252 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:55,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:55,259 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2018-11-10 07:56:55,331 INFO L477 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 11 treesize of output 12 [2018-11-10 07:56:55,333 INFO L477 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 15 [2018-11-10 07:56:55,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:55,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:55,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:55,340 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:55 [2018-11-10 07:56:55,368 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:56:55,369 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:56:55,369 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:56:55,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 20 treesize of output 21 [2018-11-10 07:56:55,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:55,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:55,376 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:53 [2018-11-10 07:56:55,431 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:56:55,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 36 treesize of output 41 [2018-11-10 07:56:55,436 INFO L477 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 14 treesize of output 13 [2018-11-10 07:56:55,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:55,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:55,456 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 07:56:55,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 65 treesize of output 66 [2018-11-10 07:56:55,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 07:56:55,465 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:55,482 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:55,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:55,493 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:79, output treesize:65 [2018-11-10 07:56:55,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 60 [2018-11-10 07:56:55,610 INFO L477 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 22 treesize of output 21 [2018-11-10 07:56:55,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:55,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:55,627 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-10 07:56:55,627 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:106, output treesize:88 [2018-11-10 07:56:55,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 92 treesize of output 66 [2018-11-10 07:56:55,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2018-11-10 07:56:55,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:55,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2018-11-10 07:56:55,755 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 07:56:55,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 07:56:55,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 07:56:55,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 15 treesize of output 7 [2018-11-10 07:56:55,771 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 07:56:55,773 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 07:56:55,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 07:56:55,778 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:99, output treesize:19 [2018-11-10 07:56:55,872 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 07:56:55,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 07:56:55,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 39 [2018-11-10 07:56:55,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-10 07:56:55,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-10 07:56:55,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1360, Unknown=0, NotChecked=0, Total=1482 [2018-11-10 07:56:55,896 INFO L87 Difference]: Start difference. First operand 195 states and 222 transitions. Second operand 39 states. [2018-11-10 07:56:57,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:56:57,253 INFO L93 Difference]: Finished difference Result 270 states and 302 transitions. [2018-11-10 07:56:57,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-10 07:56:57,253 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 72 [2018-11-10 07:56:57,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:56:57,253 INFO L225 Difference]: With dead ends: 270 [2018-11-10 07:56:57,254 INFO L226 Difference]: Without dead ends: 261 [2018-11-10 07:56:57,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 769 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=548, Invalid=3612, Unknown=0, NotChecked=0, Total=4160 [2018-11-10 07:56:57,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-11-10 07:56:57,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 212. [2018-11-10 07:56:57,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-11-10 07:56:57,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 240 transitions. [2018-11-10 07:56:57,260 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 240 transitions. Word has length 72 [2018-11-10 07:56:57,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:56:57,260 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 240 transitions. [2018-11-10 07:56:57,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-10 07:56:57,261 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 240 transitions. [2018-11-10 07:56:57,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-10 07:56:57,261 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:56:57,261 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:56:57,261 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:56:57,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:56:57,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1375686145, now seen corresponding path program 1 times [2018-11-10 07:56:57,261 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:56:57,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:56:57,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:57,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 07:56:57,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:56:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:56:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 07:56:57,295 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 07:56:57,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:56:57 BoogieIcfgContainer [2018-11-10 07:56:57,339 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 07:56:57,339 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:56:57,339 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:56:57,340 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:56:57,340 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:56:40" (3/4) ... [2018-11-10 07:56:57,342 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 07:56:57,384 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_102cc9ea-1c7b-42da-9fe5-a74866f1bf5d/bin-2019/uautomizer/witness.graphml [2018-11-10 07:56:57,384 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:56:57,385 INFO L168 Benchmark]: Toolchain (without parser) took 17542.54 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 479.2 MB). Free memory was 955.4 MB in the beginning and 1.0 GB in the end (delta: -93.1 MB). Peak memory consumption was 386.1 MB. Max. memory is 11.5 GB. [2018-11-10 07:56:57,386 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:56:57,386 INFO L168 Benchmark]: CACSL2BoogieTranslator took 290.51 ms. Allocated memory is still 1.0 GB. Free memory was 955.4 MB in the beginning and 925.8 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-11-10 07:56:57,386 INFO L168 Benchmark]: Boogie Preprocessor took 86.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 925.8 MB in the beginning and 1.1 GB in the end (delta: -199.7 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 07:56:57,386 INFO L168 Benchmark]: RCFGBuilder took 454.72 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: 62.9 MB). Peak memory consumption was 62.9 MB. Max. memory is 11.5 GB. [2018-11-10 07:56:57,387 INFO L168 Benchmark]: TraceAbstraction took 16663.30 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 347.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 14.2 MB). Peak memory consumption was 361.8 MB. Max. memory is 11.5 GB. [2018-11-10 07:56:57,387 INFO L168 Benchmark]: Witness Printer took 44.94 ms. Allocated memory is still 1.5 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:56:57,388 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 290.51 ms. Allocated memory is still 1.0 GB. Free memory was 955.4 MB in the beginning and 925.8 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 86.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 925.8 MB in the beginning and 1.1 GB in the end (delta: -199.7 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 454.72 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: 62.9 MB). Peak memory consumption was 62.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16663.30 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 347.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 14.2 MB). Peak memory consumption was 361.8 MB. Max. memory is 11.5 GB. * Witness Printer took 44.94 ms. Allocated memory is still 1.5 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 609]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L541] EXPR, FCALL malloc(sizeof(*root)) VAL [malloc(sizeof(*root))={12:0}] [L541] struct TreeNode* root = malloc(sizeof(*root)), *n; VAL [malloc(sizeof(*root))={12:0}, root={12:0}] [L542] FCALL root->left = ((void *)0) VAL [malloc(sizeof(*root))={12:0}, root={12:0}] [L543] FCALL root->right = ((void *)0) VAL [malloc(sizeof(*root))={12:0}, root={12:0}] [L544] COND FALSE !(__VERIFIER_nondet_int()) [L563] n = ((void *)0) [L564] struct TreeNode* pred; VAL [malloc(sizeof(*root))={12:0}, n={0:0}, root={12:0}] [L565] COND TRUE \read(*root) [L566] pred = ((void *)0) [L567] n = root VAL [malloc(sizeof(*root))={12:0}, n={12:0}, pred={0:0}, root={12:0}] [L568] EXPR, FCALL n->left VAL [malloc(sizeof(*root))={12:0}, n={12:0}, n->left={0:0}, pred={0:0}, root={12:0}] [L568] n->left || n->right VAL [malloc(sizeof(*root))={12:0}, n={12:0}, n->left={0:0}, n->left || n->right=0, pred={0:0}, root={12:0}] [L568] EXPR, FCALL n->right VAL [malloc(sizeof(*root))={12:0}, n={12:0}, n->left={0:0}, n->left || n->right=0, n->right={0:0}, pred={0:0}, root={12:0}] [L568] n->left || n->right VAL [malloc(sizeof(*root))={12:0}, n={12:0}, n->left={0:0}, n->left || n->right=0, n->right={0:0}, pred={0:0}, root={12:0}] [L568] COND FALSE !(n->left || n->right) [L575] COND FALSE !(\read(*pred)) [L581] root = ((void *)0) VAL [malloc(sizeof(*root))={12:0}, n={12:0}, pred={0:0}, root={0:0}] [L582] FCALL free(n) VAL [malloc(sizeof(*root))={12:0}, n={12:0}, pred={0:0}, root={0:0}] [L565] COND FALSE !(\read(*root)) VAL [malloc(sizeof(*root))={12:0}, n={12:0}, pred={0:0}, root={0:0}] [L584] EXPR, FCALL malloc(sizeof(struct node)) VAL [malloc(sizeof(*root))={12:0}, malloc(sizeof(struct node))={13:0}, n={12:0}, pred={0:0}, root={0:0}] [L584] List a = (List) malloc(sizeof(struct node)); VAL [a={13:0}, malloc(sizeof(*root))={12:0}, malloc(sizeof(struct node))={13:0}, n={12:0}, pred={0:0}, root={0:0}] [L585] COND FALSE !(a == 0) VAL [a={13:0}, malloc(sizeof(*root))={12:0}, malloc(sizeof(struct node))={13:0}, n={12:0}, pred={0:0}, root={0:0}] [L586] List t; [L587] List p = a; VAL [a={13:0}, malloc(sizeof(*root))={12:0}, malloc(sizeof(struct node))={13:0}, n={12:0}, p={13:0}, pred={0:0}, root={0:0}] [L588] COND TRUE __VERIFIER_nondet_int() [L589] FCALL p->h = 1 VAL [a={13:0}, malloc(sizeof(*root))={12:0}, malloc(sizeof(struct node))={13:0}, n={12:0}, p={13:0}, pred={0:0}, root={0:0}] [L590] EXPR, FCALL malloc(sizeof(struct node)) VAL [a={13:0}, malloc(sizeof(*root))={12:0}, malloc(sizeof(struct node))={9:0}, malloc(sizeof(struct node))={13:0}, n={12:0}, p={13:0}, pred={0:0}, root={0:0}] [L590] t = (List) malloc(sizeof(struct node)) VAL [a={13:0}, malloc(sizeof(*root))={12:0}, malloc(sizeof(struct node))={9:0}, malloc(sizeof(struct node))={13:0}, n={12:0}, p={13:0}, pred={0:0}, root={0:0}, t={9:0}] [L591] COND FALSE !(t == 0) VAL [a={13:0}, malloc(sizeof(*root))={12:0}, malloc(sizeof(struct node))={9:0}, malloc(sizeof(struct node))={13:0}, n={12:0}, p={13:0}, pred={0:0}, root={0:0}, t={9:0}] [L592] FCALL p->n = t VAL [a={13:0}, malloc(sizeof(*root))={12:0}, malloc(sizeof(struct node))={9:0}, malloc(sizeof(struct node))={13:0}, n={12:0}, p={13:0}, pred={0:0}, root={0:0}, t={9:0}] [L593] EXPR, FCALL p->n VAL [a={13:0}, malloc(sizeof(*root))={12:0}, malloc(sizeof(struct node))={9:0}, malloc(sizeof(struct node))={13:0}, n={12:0}, p={13:0}, p->n={9:0}, pred={0:0}, root={0:0}, t={9:0}] [L593] p = p->n [L588] COND FALSE !(__VERIFIER_nondet_int()) [L595] COND TRUE __VERIFIER_nondet_int() [L596] FCALL p->h = 2 VAL [a={13:0}, malloc(sizeof(*root))={12:0}, malloc(sizeof(struct node))={9:0}, malloc(sizeof(struct node))={13:0}, n={12:0}, p={9:0}, pred={0:0}, root={0:0}, t={9:0}] [L597] EXPR, FCALL malloc(sizeof(struct node)) VAL [a={13:0}, malloc(sizeof(*root))={12:0}, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={9:0}, malloc(sizeof(struct node))={13:0}, n={12:0}, p={9:0}, pred={0:0}, root={0:0}, t={9:0}] [L597] t = (List) malloc(sizeof(struct node)) VAL [a={13:0}, malloc(sizeof(*root))={12:0}, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={9:0}, malloc(sizeof(struct node))={13:0}, n={12:0}, p={9:0}, pred={0:0}, root={0:0}, t={11:0}] [L598] COND FALSE !(t == 0) VAL [a={13:0}, malloc(sizeof(*root))={12:0}, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={9:0}, malloc(sizeof(struct node))={13:0}, n={12:0}, p={9:0}, pred={0:0}, root={0:0}, t={11:0}] [L599] FCALL p->n = t VAL [a={13:0}, malloc(sizeof(*root))={12:0}, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={9:0}, malloc(sizeof(struct node))={13:0}, n={12:0}, p={9:0}, pred={0:0}, root={0:0}, t={11:0}] [L600] EXPR, FCALL p->n VAL [a={13:0}, malloc(sizeof(*root))={12:0}, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={9:0}, malloc(sizeof(struct node))={13:0}, n={12:0}, p={9:0}, p->n={11:0}, pred={0:0}, root={0:0}, t={11:0}] [L600] p = p->n [L595] COND FALSE !(__VERIFIER_nondet_int()) [L602] FCALL p->h = 3 VAL [a={13:0}, malloc(sizeof(*root))={12:0}, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={9:0}, malloc(sizeof(struct node))={13:0}, n={12:0}, p={11:0}, pred={0:0}, root={0:0}, t={11:0}] [L603] p = a VAL [a={13:0}, malloc(sizeof(*root))={12:0}, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={9:0}, malloc(sizeof(struct node))={13:0}, n={12:0}, p={13:0}, pred={0:0}, root={0:0}, t={11:0}] [L604] EXPR, FCALL p->h VAL [a={13:0}, malloc(sizeof(*root))={12:0}, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={9:0}, malloc(sizeof(struct node))={13:0}, n={12:0}, p={13:0}, p->h=1, pred={0:0}, root={0:0}, t={11:0}] [L604] COND FALSE !(p->h == 2) [L606] EXPR, FCALL p->h VAL [a={13:0}, malloc(sizeof(*root))={12:0}, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={9:0}, malloc(sizeof(struct node))={13:0}, n={12:0}, p={13:0}, p->h=1, pred={0:0}, root={0:0}, t={11:0}] [L606] COND TRUE p->h == 1 [L607] EXPR, FCALL p->n VAL [a={13:0}, malloc(sizeof(*root))={12:0}, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={9:0}, malloc(sizeof(struct node))={13:0}, n={12:0}, p={13:0}, p->n={9:0}, pred={0:0}, root={0:0}, t={11:0}] [L607] p = p->n [L606] EXPR, FCALL p->h VAL [a={13:0}, malloc(sizeof(*root))={12:0}, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={9:0}, malloc(sizeof(struct node))={13:0}, n={12:0}, p={9:0}, p->h=2, pred={0:0}, root={0:0}, t={11:0}] [L606] COND FALSE !(p->h == 1) [L608] EXPR, FCALL p->h VAL [a={13:0}, malloc(sizeof(*root))={12:0}, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={9:0}, malloc(sizeof(struct node))={13:0}, n={12:0}, p={9:0}, p->h=2, pred={0:0}, root={0:0}, t={11:0}] [L608] COND TRUE p->h != 3 [L609] __VERIFIER_error() VAL [a={13:0}, malloc(sizeof(*root))={12:0}, malloc(sizeof(struct node))={11:0}, malloc(sizeof(struct node))={9:0}, malloc(sizeof(struct node))={13:0}, n={12:0}, p={9:0}, pred={0:0}, root={0:0}, t={11:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 128 locations, 1 error locations. UNSAFE Result, 16.6s OverallTime, 19 OverallIterations, 3 TraceHistogramMax, 8.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2210 SDtfs, 5893 SDslu, 20445 SDs, 0 SdLazy, 8230 SolverSat, 606 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1249 GetRequests, 686 SyntacticMatches, 50 SemanticMatches, 513 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4509 ImplicationChecksByTransitivity, 8.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=212occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 665 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 1887 NumberOfCodeBlocks, 1887 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1785 ConstructedInterpolants, 55 QuantifiedInterpolants, 936338 SizeOfPredicates, 195 NumberOfNonLiveVariables, 2195 ConjunctsInSsa, 420 ConjunctsInUnsatCore, 30 InterpolantComputations, 6 PerfectInterpolantSequences, 97/304 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...