./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-queue_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8a31d1e7-738a-4d6a-8fec-406164d069d6/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8a31d1e7-738a-4d6a-8fec-406164d069d6/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8a31d1e7-738a-4d6a-8fec-406164d069d6/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8a31d1e7-738a-4d6a-8fec-406164d069d6/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-queue_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8a31d1e7-738a-4d6a-8fec-406164d069d6/bin-2019/uautomizer/config/svcomp-Reach-32bit-PetriAutomizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8a31d1e7-738a-4d6a-8fec-406164d069d6/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 e5083763cd1026dac92f37bc5a05779baf01a71b ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-5842f4b [2018-11-18 13:56:24,411 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 13:56:24,413 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 13:56:24,419 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 13:56:24,419 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 13:56:24,420 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 13:56:24,421 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 13:56:24,422 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 13:56:24,423 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 13:56:24,423 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 13:56:24,424 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 13:56:24,424 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 13:56:24,425 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 13:56:24,426 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 13:56:24,426 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 13:56:24,427 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 13:56:24,427 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 13:56:24,428 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 13:56:24,430 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 13:56:24,431 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 13:56:24,431 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 13:56:24,432 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 13:56:24,433 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 13:56:24,433 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 13:56:24,434 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 13:56:24,434 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 13:56:24,435 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 13:56:24,435 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 13:56:24,436 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 13:56:24,437 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 13:56:24,437 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 13:56:24,437 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 13:56:24,437 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 13:56:24,437 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 13:56:24,438 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 13:56:24,438 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 13:56:24,438 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8a31d1e7-738a-4d6a-8fec-406164d069d6/bin-2019/uautomizer/config/svcomp-Reach-32bit-PetriAutomizer_Default.epf [2018-11-18 13:56:24,445 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 13:56:24,445 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 13:56:24,446 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 13:56:24,446 INFO L133 SettingsManager]: * Process only entry and re-entry procedures=false [2018-11-18 13:56:24,446 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 13:56:24,447 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 13:56:24,447 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 13:56:24,447 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 13:56:24,447 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 13:56:24,447 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 13:56:24,447 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 13:56:24,447 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 13:56:24,447 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 13:56:24,448 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 13:56:24,448 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 13:56:24,448 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 13:56:24,448 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 13:56:24,448 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 13:56:24,448 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 13:56:24,448 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 13:56:24,449 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 13:56:24,449 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 13:56:24,449 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 13:56:24,449 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 13:56:24,449 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 13:56:24,449 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 13:56:24,449 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 13:56:24,449 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 13:56:24,450 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 13:56:24,450 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 13:56:24,450 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_8a31d1e7-738a-4d6a-8fec-406164d069d6/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 -> e5083763cd1026dac92f37bc5a05779baf01a71b [2018-11-18 13:56:24,472 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 13:56:24,480 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 13:56:24,483 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 13:56:24,484 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 13:56:24,484 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 13:56:24,484 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8a31d1e7-738a-4d6a-8fec-406164d069d6/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/sll-queue_false-unreach-call_false-valid-memcleanup.i [2018-11-18 13:56:24,524 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8a31d1e7-738a-4d6a-8fec-406164d069d6/bin-2019/uautomizer/data/2f4daba05/89d329217307466daa225c7a91ead46c/FLAG3edf306c3 [2018-11-18 13:56:24,959 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 13:56:24,960 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8a31d1e7-738a-4d6a-8fec-406164d069d6/sv-benchmarks/c/forester-heap/sll-queue_false-unreach-call_false-valid-memcleanup.i [2018-11-18 13:56:24,966 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8a31d1e7-738a-4d6a-8fec-406164d069d6/bin-2019/uautomizer/data/2f4daba05/89d329217307466daa225c7a91ead46c/FLAG3edf306c3 [2018-11-18 13:56:24,977 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8a31d1e7-738a-4d6a-8fec-406164d069d6/bin-2019/uautomizer/data/2f4daba05/89d329217307466daa225c7a91ead46c [2018-11-18 13:56:24,979 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 13:56:24,980 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 13:56:24,980 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 13:56:24,980 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 13:56:24,982 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 13:56:24,983 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:56:24" (1/1) ... [2018-11-18 13:56:24,984 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e459b1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:56:24, skipping insertion in model container [2018-11-18 13:56:24,985 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:56:24" (1/1) ... [2018-11-18 13:56:24,991 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 13:56:25,020 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 13:56:25,202 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:56:25,209 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 13:56:25,237 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:56:25,310 INFO L195 MainTranslator]: Completed translation [2018-11-18 13:56:25,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:56:25 WrapperNode [2018-11-18 13:56:25,310 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 13:56:25,311 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 13:56:25,311 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 13:56:25,311 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 13:56:25,318 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:56:25" (1/1) ... [2018-11-18 13:56:25,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:56:25" (1/1) ... [2018-11-18 13:56:25,329 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:56:25" (1/1) ... [2018-11-18 13:56:25,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:56:25" (1/1) ... [2018-11-18 13:56:25,342 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:56:25" (1/1) ... [2018-11-18 13:56:25,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:56:25" (1/1) ... [2018-11-18 13:56:25,352 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:56:25" (1/1) ... [2018-11-18 13:56:25,357 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 13:56:25,357 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 13:56:25,357 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 13:56:25,357 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 13:56:25,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:56:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8a31d1e7-738a-4d6a-8fec-406164d069d6/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-18 13:56:25,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 13:56:25,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 13:56:25,401 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 13:56:25,401 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-18 13:56:25,401 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-18 13:56:25,401 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-18 13:56:25,401 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-18 13:56:25,401 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-18 13:56:25,402 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-18 13:56:25,402 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-18 13:56:25,402 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-18 13:56:25,402 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-18 13:56:25,402 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-18 13:56:25,402 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-18 13:56:25,402 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-18 13:56:25,402 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-18 13:56:25,403 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-18 13:56:25,403 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-18 13:56:25,403 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-18 13:56:25,403 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-18 13:56:25,403 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-18 13:56:25,403 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-18 13:56:25,403 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-18 13:56:25,403 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-18 13:56:25,403 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-18 13:56:25,404 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-18 13:56:25,404 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-18 13:56:25,404 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-18 13:56:25,404 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-18 13:56:25,404 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-18 13:56:25,404 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-18 13:56:25,404 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-18 13:56:25,404 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-18 13:56:25,404 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-18 13:56:25,404 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-18 13:56:25,404 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-18 13:56:25,404 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-18 13:56:25,404 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-18 13:56:25,404 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-18 13:56:25,404 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-18 13:56:25,405 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-18 13:56:25,405 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-18 13:56:25,405 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-18 13:56:25,405 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-18 13:56:25,405 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-18 13:56:25,405 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-18 13:56:25,405 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-18 13:56:25,405 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-18 13:56:25,405 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-18 13:56:25,405 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-18 13:56:25,405 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-18 13:56:25,406 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-18 13:56:25,406 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-18 13:56:25,406 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-18 13:56:25,406 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-18 13:56:25,406 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-18 13:56:25,406 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-18 13:56:25,406 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-18 13:56:25,406 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-18 13:56:25,406 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-18 13:56:25,406 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-18 13:56:25,407 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-18 13:56:25,407 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-18 13:56:25,407 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-18 13:56:25,407 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-18 13:56:25,407 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-18 13:56:25,407 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-18 13:56:25,407 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-18 13:56:25,407 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-18 13:56:25,407 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-18 13:56:25,407 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-18 13:56:25,408 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-18 13:56:25,408 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-18 13:56:25,408 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-18 13:56:25,408 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-18 13:56:25,408 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-18 13:56:25,408 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-18 13:56:25,408 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-18 13:56:25,408 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-18 13:56:25,408 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-18 13:56:25,408 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-18 13:56:25,408 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-18 13:56:25,409 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-18 13:56:25,409 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-18 13:56:25,409 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-18 13:56:25,409 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-18 13:56:25,409 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-18 13:56:25,409 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-18 13:56:25,409 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-18 13:56:25,409 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-18 13:56:25,409 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-18 13:56:25,409 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-18 13:56:25,409 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-18 13:56:25,410 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-18 13:56:25,410 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-18 13:56:25,410 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-18 13:56:25,410 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-18 13:56:25,410 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-18 13:56:25,410 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-18 13:56:25,410 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-18 13:56:25,410 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-18 13:56:25,410 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-18 13:56:25,410 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-18 13:56:25,410 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-18 13:56:25,411 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-18 13:56:25,411 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-18 13:56:25,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 13:56:25,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 13:56:25,411 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 13:56:25,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 13:56:25,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 13:56:25,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 13:56:25,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 13:56:25,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 13:56:25,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 13:56:25,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 13:56:25,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 13:56:25,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 13:56:25,844 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 13:56:25,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:56:25 BoogieIcfgContainer [2018-11-18 13:56:25,845 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 13:56:25,845 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 13:56:25,845 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 13:56:25,847 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 13:56:25,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 01:56:24" (1/3) ... [2018-11-18 13:56:25,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65d8bd54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:56:25, skipping insertion in model container [2018-11-18 13:56:25,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:56:25" (2/3) ... [2018-11-18 13:56:25,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65d8bd54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:56:25, skipping insertion in model container [2018-11-18 13:56:25,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:56:25" (3/3) ... [2018-11-18 13:56:25,849 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-queue_false-unreach-call_false-valid-memcleanup.i [2018-11-18 13:56:25,855 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 13:56:25,862 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-11-18 13:56:25,871 INFO L257 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2018-11-18 13:56:25,891 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 13:56:25,892 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 13:56:25,892 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 13:56:25,892 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 13:56:25,892 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 13:56:25,892 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 13:56:25,892 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 13:56:25,892 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 13:56:25,893 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 13:56:25,906 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states. [2018-11-18 13:56:25,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-18 13:56:25,910 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:56:25,911 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:56:25,913 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:56:25,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:56:25,917 INFO L82 PathProgramCache]: Analyzing trace with hash -2012702504, now seen corresponding path program 1 times [2018-11-18 13:56:25,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:56:25,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:56:25,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:56:25,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:56:25,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:56:25,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:56:26,003 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-18 13:56:26,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:56:26,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 13:56:26,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 13:56:26,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 13:56:26,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 13:56:26,016 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 2 states. [2018-11-18 13:56:26,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:56:26,036 INFO L93 Difference]: Finished difference Result 192 states and 302 transitions. [2018-11-18 13:56:26,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 13:56:26,037 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-18 13:56:26,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:56:26,044 INFO L225 Difference]: With dead ends: 192 [2018-11-18 13:56:26,044 INFO L226 Difference]: Without dead ends: 92 [2018-11-18 13:56:26,046 INFO L604 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-18 13:56:26,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-18 13:56:26,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-11-18 13:56:26,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-18 13:56:26,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2018-11-18 13:56:26,074 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 10 [2018-11-18 13:56:26,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:56:26,074 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2018-11-18 13:56:26,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 13:56:26,074 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2018-11-18 13:56:26,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-18 13:56:26,074 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:56:26,074 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:56:26,075 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:56:26,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:56:26,075 INFO L82 PathProgramCache]: Analyzing trace with hash 957540948, now seen corresponding path program 1 times [2018-11-18 13:56:26,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:56:26,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:56:26,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:56:26,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:56:26,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:56:26,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:56:26,113 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-18 13:56:26,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:56:26,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:56:26,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:56:26,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:56:26,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:56:26,114 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand 3 states. [2018-11-18 13:56:26,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:56:26,148 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2018-11-18 13:56:26,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:56:26,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-18 13:56:26,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:56:26,149 INFO L225 Difference]: With dead ends: 92 [2018-11-18 13:56:26,149 INFO L226 Difference]: Without dead ends: 82 [2018-11-18 13:56:26,150 INFO L604 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-18 13:56:26,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-18 13:56:26,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-11-18 13:56:26,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-18 13:56:26,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2018-11-18 13:56:26,157 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 12 [2018-11-18 13:56:26,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:56:26,158 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2018-11-18 13:56:26,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:56:26,158 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2018-11-18 13:56:26,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 13:56:26,158 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:56:26,158 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:56:26,159 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:56:26,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:56:26,159 INFO L82 PathProgramCache]: Analyzing trace with hash 26501704, now seen corresponding path program 1 times [2018-11-18 13:56:26,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:56:26,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:56:26,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:56:26,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:56:26,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:56:26,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:56:26,203 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-18 13:56:26,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:56:26,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:56:26,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:56:26,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:56:26,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:56:26,204 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 3 states. [2018-11-18 13:56:26,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:56:26,230 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2018-11-18 13:56:26,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:56:26,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-18 13:56:26,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:56:26,231 INFO L225 Difference]: With dead ends: 82 [2018-11-18 13:56:26,231 INFO L226 Difference]: Without dead ends: 80 [2018-11-18 13:56:26,232 INFO L604 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-18 13:56:26,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-18 13:56:26,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-11-18 13:56:26,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-18 13:56:26,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2018-11-18 13:56:26,237 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 16 [2018-11-18 13:56:26,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:56:26,237 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2018-11-18 13:56:26,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:56:26,237 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2018-11-18 13:56:26,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 13:56:26,238 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:56:26,238 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:56:26,238 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:56:26,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:56:26,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1942297771, now seen corresponding path program 1 times [2018-11-18 13:56:26,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:56:26,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:56:26,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:56:26,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:56:26,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:56:26,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:56:26,270 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-18 13:56:26,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:56:26,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:56:26,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:56:26,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:56:26,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:56:26,272 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand 3 states. [2018-11-18 13:56:26,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:56:26,304 INFO L93 Difference]: Finished difference Result 176 states and 201 transitions. [2018-11-18 13:56:26,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:56:26,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-18 13:56:26,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:56:26,305 INFO L225 Difference]: With dead ends: 176 [2018-11-18 13:56:26,305 INFO L226 Difference]: Without dead ends: 102 [2018-11-18 13:56:26,305 INFO L604 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-18 13:56:26,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-18 13:56:26,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 90. [2018-11-18 13:56:26,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-18 13:56:26,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2018-11-18 13:56:26,309 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 19 [2018-11-18 13:56:26,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:56:26,310 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2018-11-18 13:56:26,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:56:26,310 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2018-11-18 13:56:26,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 13:56:26,310 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:56:26,311 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] [2018-11-18 13:56:26,311 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:56:26,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:56:26,311 INFO L82 PathProgramCache]: Analyzing trace with hash -771043097, now seen corresponding path program 1 times [2018-11-18 13:56:26,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:56:26,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:56:26,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:56:26,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:56:26,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:56:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:56:26,346 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-18 13:56:26,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:56:26,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:56:26,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:56:26,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:56:26,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:56:26,347 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand 3 states. [2018-11-18 13:56:26,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:56:26,352 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2018-11-18 13:56:26,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:56:26,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 13:56:26,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:56:26,353 INFO L225 Difference]: With dead ends: 93 [2018-11-18 13:56:26,353 INFO L226 Difference]: Without dead ends: 91 [2018-11-18 13:56:26,354 INFO L604 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-18 13:56:26,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-18 13:56:26,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-11-18 13:56:26,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-18 13:56:26,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2018-11-18 13:56:26,358 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 24 [2018-11-18 13:56:26,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:56:26,359 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2018-11-18 13:56:26,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:56:26,359 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2018-11-18 13:56:26,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 13:56:26,359 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:56:26,359 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] [2018-11-18 13:56:26,360 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:56:26,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:56:26,360 INFO L82 PathProgramCache]: Analyzing trace with hash -771041175, now seen corresponding path program 1 times [2018-11-18 13:56:26,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:56:26,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:56:26,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:56:26,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:56:26,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:56:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:56:26,386 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-18 13:56:26,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:56:26,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 13:56:26,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 13:56:26,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 13:56:26,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 13:56:26,388 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand 4 states. [2018-11-18 13:56:26,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:56:26,442 INFO L93 Difference]: Finished difference Result 113 states and 127 transitions. [2018-11-18 13:56:26,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:56:26,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-11-18 13:56:26,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:56:26,444 INFO L225 Difference]: With dead ends: 113 [2018-11-18 13:56:26,444 INFO L226 Difference]: Without dead ends: 85 [2018-11-18 13:56:26,444 INFO L604 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-18 13:56:26,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-18 13:56:26,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-11-18 13:56:26,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-18 13:56:26,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2018-11-18 13:56:26,450 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 24 [2018-11-18 13:56:26,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:56:26,450 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2018-11-18 13:56:26,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 13:56:26,451 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2018-11-18 13:56:26,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 13:56:26,451 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:56:26,451 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 13:56:26,452 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:56:26,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:56:26,452 INFO L82 PathProgramCache]: Analyzing trace with hash 739231933, now seen corresponding path program 1 times [2018-11-18 13:56:26,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:56:26,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:56:26,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:56:26,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:56:26,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:56:26,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:56:26,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:56:26,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:56:26,523 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8a31d1e7-738a-4d6a-8fec-406164d069d6/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-18 13:56:26,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:56:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:56:26,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:56:26,601 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-18 13:56:26,602 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:26,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:26,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-18 13:56:26,628 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:26,629 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:26,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 13:56:26,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:26,648 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 13:56:26,651 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 8 treesize of output 7 [2018-11-18 13:56:26,651 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:26,683 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 19 treesize of output 20 [2018-11-18 13:56:26,685 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-18 13:56:26,685 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:26,689 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:26,692 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:26,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 13:56:26,698 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:42, output treesize:28 [2018-11-18 13:56:26,739 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 35 treesize of output 23 [2018-11-18 13:56:26,741 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 18 treesize of output 9 [2018-11-18 13:56:26,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:26,747 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-18 13:56:26,747 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:26,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:26,760 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-18 13:56:26,761 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:4 [2018-11-18 13:56:26,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:56:26,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:56:26,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-18 13:56:26,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 13:56:26,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 13:56:26,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-18 13:56:26,787 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 6 states. [2018-11-18 13:56:26,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:56:26,865 INFO L93 Difference]: Finished difference Result 157 states and 172 transitions. [2018-11-18 13:56:26,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:56:26,866 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-11-18 13:56:26,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:56:26,866 INFO L225 Difference]: With dead ends: 157 [2018-11-18 13:56:26,867 INFO L226 Difference]: Without dead ends: 155 [2018-11-18 13:56:26,867 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 13:56:26,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-11-18 13:56:26,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 103. [2018-11-18 13:56:26,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-18 13:56:26,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2018-11-18 13:56:26,874 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 29 [2018-11-18 13:56:26,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:56:26,874 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2018-11-18 13:56:26,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 13:56:26,874 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2018-11-18 13:56:26,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 13:56:26,875 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:56:26,875 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 13:56:26,875 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:56:26,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:56:26,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1258005341, now seen corresponding path program 1 times [2018-11-18 13:56:26,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:56:26,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:56:26,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:56:26,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:56:26,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:56:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:56:26,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:56:26,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:56:26,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:56:26,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:56:26,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:56:26,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:56:26,903 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. Second operand 3 states. [2018-11-18 13:56:26,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:56:26,930 INFO L93 Difference]: Finished difference Result 208 states and 236 transitions. [2018-11-18 13:56:26,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:56:26,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 13:56:26,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:56:26,931 INFO L225 Difference]: With dead ends: 208 [2018-11-18 13:56:26,931 INFO L226 Difference]: Without dead ends: 133 [2018-11-18 13:56:26,932 INFO L604 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-18 13:56:26,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-18 13:56:26,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 120. [2018-11-18 13:56:26,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-11-18 13:56:26,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 131 transitions. [2018-11-18 13:56:26,936 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 131 transitions. Word has length 30 [2018-11-18 13:56:26,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:56:26,937 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 131 transitions. [2018-11-18 13:56:26,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:56:26,937 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 131 transitions. [2018-11-18 13:56:26,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 13:56:26,938 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:56:26,938 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:56:26,938 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:56:26,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:56:26,939 INFO L82 PathProgramCache]: Analyzing trace with hash -58491785, now seen corresponding path program 1 times [2018-11-18 13:56:26,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:56:26,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:56:26,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:56:26,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:56:26,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:56:26,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:56:27,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:56:27,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:56:27,173 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8a31d1e7-738a-4d6a-8fec-406164d069d6/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-18 13:56:27,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:56:27,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:56:27,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:56:27,220 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-18 13:56:27,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:27,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:27,223 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-18 13:56:27,237 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:27,238 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:27,238 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-18 13:56:27,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:27,252 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 13:56:27,254 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-18 13:56:27,254 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:27,263 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-18 13:56:27,265 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 11 [2018-11-18 13:56:27,266 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:27,271 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:27,275 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:27,285 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 13:56:27,287 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 8 treesize of output 7 [2018-11-18 13:56:27,287 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:27,294 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-18 13:56:27,296 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 11 [2018-11-18 13:56:27,296 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:27,299 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:27,302 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:27,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:27,308 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:68, output treesize:44 [2018-11-18 13:56:27,328 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 25 treesize of output 18 [2018-11-18 13:56:27,330 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 18 treesize of output 17 [2018-11-18 13:56:27,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:27,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:27,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:27,337 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:71, output treesize:63 [2018-11-18 13:56:27,361 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 63 treesize of output 49 [2018-11-18 13:56:27,363 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 9 treesize of output 7 [2018-11-18 13:56:27,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:27,370 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 40 treesize of output 29 [2018-11-18 13:56:27,370 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:27,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:27,381 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 39 treesize of output 33 [2018-11-18 13:56:27,383 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 29 treesize of output 18 [2018-11-18 13:56:27,383 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:27,388 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 3 [2018-11-18 13:56:27,388 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:27,390 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:27,393 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-18 13:56:27,393 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:77, output treesize:13 [2018-11-18 13:56:27,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:56:27,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:56:27,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2018-11-18 13:56:27,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 13:56:27,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 13:56:27,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-11-18 13:56:27,431 INFO L87 Difference]: Start difference. First operand 120 states and 131 transitions. Second operand 13 states. [2018-11-18 13:56:27,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:56:27,817 INFO L93 Difference]: Finished difference Result 159 states and 174 transitions. [2018-11-18 13:56:27,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 13:56:27,817 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-11-18 13:56:27,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:56:27,818 INFO L225 Difference]: With dead ends: 159 [2018-11-18 13:56:27,818 INFO L226 Difference]: Without dead ends: 157 [2018-11-18 13:56:27,819 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2018-11-18 13:56:27,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-18 13:56:27,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 130. [2018-11-18 13:56:27,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-18 13:56:27,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2018-11-18 13:56:27,826 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 40 [2018-11-18 13:56:27,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:56:27,826 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2018-11-18 13:56:27,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 13:56:27,827 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2018-11-18 13:56:27,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 13:56:27,827 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:56:27,828 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:56:27,828 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:56:27,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:56:27,828 INFO L82 PathProgramCache]: Analyzing trace with hash -177995438, now seen corresponding path program 1 times [2018-11-18 13:56:27,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:56:27,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:56:27,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:56:27,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:56:27,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:56:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:56:27,864 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 13:56:27,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:56:27,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:56:27,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:56:27,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:56:27,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:56:27,865 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand 3 states. [2018-11-18 13:56:27,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:56:27,897 INFO L93 Difference]: Finished difference Result 253 states and 285 transitions. [2018-11-18 13:56:27,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:56:27,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-18 13:56:27,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:56:27,899 INFO L225 Difference]: With dead ends: 253 [2018-11-18 13:56:27,899 INFO L226 Difference]: Without dead ends: 161 [2018-11-18 13:56:27,900 INFO L604 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-18 13:56:27,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-11-18 13:56:27,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 147. [2018-11-18 13:56:27,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-18 13:56:27,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 161 transitions. [2018-11-18 13:56:27,908 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 161 transitions. Word has length 40 [2018-11-18 13:56:27,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:56:27,908 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 161 transitions. [2018-11-18 13:56:27,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:56:27,908 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 161 transitions. [2018-11-18 13:56:27,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-18 13:56:27,909 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:56:27,911 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:56:27,912 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:56:27,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:56:27,912 INFO L82 PathProgramCache]: Analyzing trace with hash 372717230, now seen corresponding path program 1 times [2018-11-18 13:56:27,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:56:27,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:56:27,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:56:27,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:56:27,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:56:27,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:56:28,025 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:56:28,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:56:28,025 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8a31d1e7-738a-4d6a-8fec-406164d069d6/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-18 13:56:28,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:56:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:56:28,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:56:28,060 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-18 13:56:28,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:28,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:28,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-18 13:56:28,072 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:28,073 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:28,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-18 13:56:28,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:28,088 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 13:56:28,090 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 8 treesize of output 7 [2018-11-18 13:56:28,090 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:28,102 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 19 treesize of output 20 [2018-11-18 13:56:28,104 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-18 13:56:28,104 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:28,109 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:28,113 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:28,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:28,121 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:48, output treesize:33 [2018-11-18 13:56:28,144 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:28,145 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:28,146 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:28,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 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-18 13:56:28,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:28,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 56 [2018-11-18 13:56:28,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 18 treesize of output 11 [2018-11-18 13:56:28,187 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:28,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 51 [2018-11-18 13:56:28,222 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-18 13:56:28,222 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:28,237 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:28,243 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:28,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 13:56:28,250 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:90, output treesize:60 [2018-11-18 13:56:28,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 42 [2018-11-18 13:56:28,302 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-18 13:56:28,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:28,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2018-11-18 13:56:28,309 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:28,314 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 13 treesize of output 9 [2018-11-18 13:56:28,315 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:28,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:28,334 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-18 13:56:28,334 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:67, output treesize:4 [2018-11-18 13:56:28,343 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:56:28,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:56:28,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10 [2018-11-18 13:56:28,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 13:56:28,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 13:56:28,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-18 13:56:28,369 INFO L87 Difference]: Start difference. First operand 147 states and 161 transitions. Second operand 10 states. [2018-11-18 13:56:28,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:56:28,720 INFO L93 Difference]: Finished difference Result 205 states and 225 transitions. [2018-11-18 13:56:28,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 13:56:28,721 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-11-18 13:56:28,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:56:28,722 INFO L225 Difference]: With dead ends: 205 [2018-11-18 13:56:28,722 INFO L226 Difference]: Without dead ends: 203 [2018-11-18 13:56:28,722 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2018-11-18 13:56:28,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-11-18 13:56:28,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 145. [2018-11-18 13:56:28,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-18 13:56:28,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 159 transitions. [2018-11-18 13:56:28,731 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 159 transitions. Word has length 41 [2018-11-18 13:56:28,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:56:28,732 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 159 transitions. [2018-11-18 13:56:28,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 13:56:28,732 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 159 transitions. [2018-11-18 13:56:28,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-18 13:56:28,735 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:56:28,735 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:56:28,735 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:56:28,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:56:28,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1132619235, now seen corresponding path program 1 times [2018-11-18 13:56:28,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:56:28,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:56:28,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:56:28,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:56:28,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:56:28,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:56:28,937 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:56:28,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:56:28,938 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8a31d1e7-738a-4d6a-8fec-406164d069d6/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-18 13:56:28,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:56:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:56:28,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:56:28,967 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-18 13:56:28,967 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:28,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:28,978 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-18 13:56:29,030 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:29,038 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:29,039 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-18 13:56:29,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:29,062 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 13:56:29,064 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 8 treesize of output 7 [2018-11-18 13:56:29,065 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:29,073 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-18 13:56:29,075 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-18 13:56:29,075 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:29,079 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:29,083 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:29,092 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 13:56:29,094 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-18 13:56:29,094 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:29,102 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 24 [2018-11-18 13:56:29,104 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-18 13:56:29,104 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:29,109 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:29,112 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:29,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:29,121 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:74, output treesize:54 [2018-11-18 13:56:29,148 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:29,149 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:29,151 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:29,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 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-18 13:56:29,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:29,176 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:29,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 112 [2018-11-18 13:56:29,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-11-18 13:56:29,180 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:29,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 101 [2018-11-18 13:56:29,200 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-18 13:56:29,200 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:29,209 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:29,216 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:29,232 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 48 [2018-11-18 13:56:29,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 22 treesize of output 23 [2018-11-18 13:56:29,236 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:29,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 59 [2018-11-18 13:56:29,260 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 16 treesize of output 15 [2018-11-18 13:56:29,260 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:29,267 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:29,271 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:29,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 13:56:29,282 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:151, output treesize:86 [2018-11-18 13:56:29,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 60 [2018-11-18 13:56:29,328 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-18 13:56:29,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:29,336 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 15 treesize of output 11 [2018-11-18 13:56:29,336 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:29,347 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 31 treesize of output 23 [2018-11-18 13:56:29,347 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:29,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:29,355 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 15 treesize of output 15 [2018-11-18 13:56:29,357 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-18 13:56:29,357 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:29,359 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-18 13:56:29,359 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:29,360 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:29,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:29,362 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:101, output treesize:4 [2018-11-18 13:56:29,375 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:56:29,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:56:29,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 14 [2018-11-18 13:56:29,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 13:56:29,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 13:56:29,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-11-18 13:56:29,391 INFO L87 Difference]: Start difference. First operand 145 states and 159 transitions. Second operand 14 states. [2018-11-18 13:56:29,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:56:29,681 INFO L93 Difference]: Finished difference Result 189 states and 206 transitions. [2018-11-18 13:56:29,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 13:56:29,681 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-11-18 13:56:29,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:56:29,682 INFO L225 Difference]: With dead ends: 189 [2018-11-18 13:56:29,682 INFO L226 Difference]: Without dead ends: 187 [2018-11-18 13:56:29,682 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2018-11-18 13:56:29,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-11-18 13:56:29,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 169. [2018-11-18 13:56:29,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-11-18 13:56:29,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 184 transitions. [2018-11-18 13:56:29,692 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 184 transitions. Word has length 44 [2018-11-18 13:56:29,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:56:29,692 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 184 transitions. [2018-11-18 13:56:29,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 13:56:29,692 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 184 transitions. [2018-11-18 13:56:29,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-18 13:56:29,693 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:56:29,693 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] [2018-11-18 13:56:29,694 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:56:29,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:56:29,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1599265359, now seen corresponding path program 1 times [2018-11-18 13:56:29,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:56:29,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:56:29,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:56:29,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:56:29,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:56:29,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:56:29,716 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 13:56:29,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:56:29,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 13:56:29,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 13:56:29,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 13:56:29,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 13:56:29,717 INFO L87 Difference]: Start difference. First operand 169 states and 184 transitions. Second operand 4 states. [2018-11-18 13:56:29,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:56:29,749 INFO L93 Difference]: Finished difference Result 195 states and 214 transitions. [2018-11-18 13:56:29,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 13:56:29,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-11-18 13:56:29,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:56:29,750 INFO L225 Difference]: With dead ends: 195 [2018-11-18 13:56:29,750 INFO L226 Difference]: Without dead ends: 183 [2018-11-18 13:56:29,750 INFO L604 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-18 13:56:29,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-11-18 13:56:29,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2018-11-18 13:56:29,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-11-18 13:56:29,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 197 transitions. [2018-11-18 13:56:29,757 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 197 transitions. Word has length 49 [2018-11-18 13:56:29,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:56:29,758 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 197 transitions. [2018-11-18 13:56:29,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 13:56:29,758 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 197 transitions. [2018-11-18 13:56:29,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-18 13:56:29,758 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:56:29,758 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 13:56:29,759 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:56:29,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:56:29,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1341099921, now seen corresponding path program 1 times [2018-11-18 13:56:29,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:56:29,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:56:29,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:56:29,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:56:29,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:56:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:56:29,889 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:56:29,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:56:29,889 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8a31d1e7-738a-4d6a-8fec-406164d069d6/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-18 13:56:29,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:56:29,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:56:29,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:56:29,910 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-18 13:56:29,910 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:29,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:29,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-18 13:56:29,924 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:29,926 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:29,926 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-18 13:56:29,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:29,939 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 13:56:29,941 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 8 treesize of output 7 [2018-11-18 13:56:29,941 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:29,949 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-18 13:56:29,952 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-18 13:56:29,952 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:29,956 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:29,959 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:29,967 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 13:56:29,968 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-18 13:56:29,968 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:29,973 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 24 [2018-11-18 13:56:29,975 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 11 [2018-11-18 13:56:29,975 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:29,978 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:29,980 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:29,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:29,985 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:65, output treesize:38 [2018-11-18 13:56:30,026 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 48 [2018-11-18 13:56:30,028 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-11-18 13:56:30,029 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 13:56:30,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2018-11-18 13:56:30,037 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:30,042 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-18 13:56:30,047 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 33 treesize of output 27 [2018-11-18 13:56:30,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-11-18 13:56:30,049 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:30,053 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 16 treesize of output 7 [2018-11-18 13:56:30,053 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:30,055 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:30,058 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-18 13:56:30,058 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:68, output treesize:7 [2018-11-18 13:56:30,072 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:56:30,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:56:30,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 13 [2018-11-18 13:56:30,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 13:56:30,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 13:56:30,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-11-18 13:56:30,089 INFO L87 Difference]: Start difference. First operand 181 states and 197 transitions. Second operand 13 states. [2018-11-18 13:56:30,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:56:30,284 INFO L93 Difference]: Finished difference Result 214 states and 235 transitions. [2018-11-18 13:56:30,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 13:56:30,290 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 49 [2018-11-18 13:56:30,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:56:30,291 INFO L225 Difference]: With dead ends: 214 [2018-11-18 13:56:30,291 INFO L226 Difference]: Without dead ends: 161 [2018-11-18 13:56:30,291 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2018-11-18 13:56:30,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-11-18 13:56:30,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-11-18 13:56:30,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-11-18 13:56:30,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 173 transitions. [2018-11-18 13:56:30,301 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 173 transitions. Word has length 49 [2018-11-18 13:56:30,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:56:30,301 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 173 transitions. [2018-11-18 13:56:30,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 13:56:30,301 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 173 transitions. [2018-11-18 13:56:30,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 13:56:30,302 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:56:30,302 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:56:30,302 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:56:30,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:56:30,302 INFO L82 PathProgramCache]: Analyzing trace with hash -956439883, now seen corresponding path program 1 times [2018-11-18 13:56:30,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:56:30,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:56:30,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:56:30,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:56:30,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:56:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:56:30,336 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 13:56:30,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:56:30,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:56:30,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:56:30,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:56:30,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:56:30,337 INFO L87 Difference]: Start difference. First operand 161 states and 173 transitions. Second operand 3 states. [2018-11-18 13:56:30,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:56:30,377 INFO L93 Difference]: Finished difference Result 233 states and 254 transitions. [2018-11-18 13:56:30,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:56:30,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-11-18 13:56:30,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:56:30,377 INFO L225 Difference]: With dead ends: 233 [2018-11-18 13:56:30,378 INFO L226 Difference]: Without dead ends: 115 [2018-11-18 13:56:30,378 INFO L604 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-18 13:56:30,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-18 13:56:30,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2018-11-18 13:56:30,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-18 13:56:30,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 102 transitions. [2018-11-18 13:56:30,383 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 102 transitions. Word has length 52 [2018-11-18 13:56:30,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:56:30,384 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 102 transitions. [2018-11-18 13:56:30,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:56:30,384 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2018-11-18 13:56:30,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-18 13:56:30,384 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:56:30,384 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:56:30,385 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:56:30,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:56:30,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1207034344, now seen corresponding path program 1 times [2018-11-18 13:56:30,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:56:30,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:56:30,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:56:30,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:56:30,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:56:30,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:56:30,730 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:56:30,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:56:30,731 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8a31d1e7-738a-4d6a-8fec-406164d069d6/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-18 13:56:30,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:56:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:56:30,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:56:30,760 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-18 13:56:30,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:30,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:30,763 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-18 13:56:30,794 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:30,796 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:30,797 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-18 13:56:30,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:30,815 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 13:56:30,817 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 8 treesize of output 7 [2018-11-18 13:56:30,817 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:30,827 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-18 13:56:30,830 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-18 13:56:30,830 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:30,835 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:30,839 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:30,851 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 13:56:30,853 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-18 13:56:30,853 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:30,860 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 24 [2018-11-18 13:56:30,862 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-18 13:56:30,862 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:30,866 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:30,870 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:30,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:30,879 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:74, output treesize:54 [2018-11-18 13:56:30,903 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 14 [2018-11-18 13:56:30,906 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-18 13:56:30,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:30,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:30,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:30,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:67 [2018-11-18 13:56:30,961 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:30,962 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:30,964 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:30,964 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-18 13:56:30,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:30,992 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 135 [2018-11-18 13:56:30,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2018-11-18 13:56:30,996 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:31,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 134 [2018-11-18 13:56:31,018 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-18 13:56:31,018 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:31,030 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:31,039 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:31,056 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 88 [2018-11-18 13:56:31,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 26 treesize of output 23 [2018-11-18 13:56:31,059 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:31,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 79 [2018-11-18 13:56:31,073 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-18 13:56:31,073 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:31,086 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:31,093 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:31,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:31,104 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:184, output treesize:74 [2018-11-18 13:56:31,147 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-18 13:56:31,150 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-18 13:56:31,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:31,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:31,165 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-18 13:56:31,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:144, output treesize:128 [2018-11-18 13:56:31,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 91 [2018-11-18 13:56:31,286 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-18 13:56:31,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:31,297 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-18 13:56:31,297 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:31,304 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 49 treesize of output 25 [2018-11-18 13:56:31,305 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 13:56:31,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 13:56:31,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-11-18 13:56:31,322 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-18 13:56:31,322 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:31,327 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 22 treesize of output 13 [2018-11-18 13:56:31,327 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:31,329 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:31,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 13:56:31,335 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:142, output treesize:26 [2018-11-18 13:56:31,377 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:56:31,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:56:31,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 21 [2018-11-18 13:56:31,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-18 13:56:31,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-18 13:56:31,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=363, Unknown=1, NotChecked=0, Total=420 [2018-11-18 13:56:31,403 INFO L87 Difference]: Start difference. First operand 99 states and 102 transitions. Second operand 21 states. [2018-11-18 13:56:31,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:56:31,924 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2018-11-18 13:56:31,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 13:56:31,924 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 54 [2018-11-18 13:56:31,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:56:31,925 INFO L225 Difference]: With dead ends: 127 [2018-11-18 13:56:31,925 INFO L226 Difference]: Without dead ends: 125 [2018-11-18 13:56:31,925 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=155, Invalid=774, Unknown=1, NotChecked=0, Total=930 [2018-11-18 13:56:31,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-18 13:56:31,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 106. [2018-11-18 13:56:31,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-18 13:56:31,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 110 transitions. [2018-11-18 13:56:31,931 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 110 transitions. Word has length 54 [2018-11-18 13:56:31,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:56:31,932 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 110 transitions. [2018-11-18 13:56:31,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-18 13:56:31,932 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2018-11-18 13:56:31,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-18 13:56:31,932 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:56:31,933 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:56:31,933 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:56:31,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:56:31,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1497416926, now seen corresponding path program 1 times [2018-11-18 13:56:31,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:56:31,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:56:31,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:56:31,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:56:31,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:56:31,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:56:32,012 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:56:32,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:56:32,013 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8a31d1e7-738a-4d6a-8fec-406164d069d6/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-18 13:56:32,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:56:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:56:32,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:56:32,050 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-18 13:56:32,050 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:32,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:32,071 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-18 13:56:32,080 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:32,081 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:32,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-18 13:56:32,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:32,096 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 13:56:32,097 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 8 treesize of output 7 [2018-11-18 13:56:32,098 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:32,105 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 19 treesize of output 20 [2018-11-18 13:56:32,107 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-18 13:56:32,107 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:32,111 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:32,114 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:32,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:32,121 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:48, output treesize:33 [2018-11-18 13:56:32,151 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:32,152 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:32,158 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:32,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-11-18 13:56:32,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:32,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 65 [2018-11-18 13:56:32,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 18 treesize of output 11 [2018-11-18 13:56:32,184 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:32,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 60 [2018-11-18 13:56:32,203 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-18 13:56:32,203 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:32,211 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:32,219 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:32,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 13:56:32,231 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:99, output treesize:69 [2018-11-18 13:56:32,286 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:32,293 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:32,295 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:32,296 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:32,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 61 [2018-11-18 13:56:32,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:32,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 91 [2018-11-18 13:56:32,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-11-18 13:56:32,346 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:32,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 86 [2018-11-18 13:56:32,371 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-18 13:56:32,371 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:32,384 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:32,393 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:32,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-18 13:56:32,404 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:151, output treesize:124 [2018-11-18 13:56:32,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 69 [2018-11-18 13:56:32,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2018-11-18 13:56:32,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:32,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2018-11-18 13:56:32,464 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:32,482 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 13 treesize of output 9 [2018-11-18 13:56:32,482 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:32,493 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-18 13:56:32,494 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:32,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:32,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:32,516 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:131, output treesize:4 [2018-11-18 13:56:32,549 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:56:32,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:56:32,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2018-11-18 13:56:32,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 13:56:32,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 13:56:32,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-11-18 13:56:32,565 INFO L87 Difference]: Start difference. First operand 106 states and 110 transitions. Second operand 13 states. [2018-11-18 13:56:32,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:56:32,834 INFO L93 Difference]: Finished difference Result 173 states and 181 transitions. [2018-11-18 13:56:32,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 13:56:32,834 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2018-11-18 13:56:32,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:56:32,834 INFO L225 Difference]: With dead ends: 173 [2018-11-18 13:56:32,834 INFO L226 Difference]: Without dead ends: 171 [2018-11-18 13:56:32,835 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2018-11-18 13:56:32,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-11-18 13:56:32,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 104. [2018-11-18 13:56:32,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-18 13:56:32,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2018-11-18 13:56:32,840 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 54 [2018-11-18 13:56:32,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:56:32,840 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2018-11-18 13:56:32,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 13:56:32,840 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2018-11-18 13:56:32,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-18 13:56:32,841 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:56:32,841 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:56:32,841 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:56:32,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:56:32,842 INFO L82 PathProgramCache]: Analyzing trace with hash -2013162193, now seen corresponding path program 1 times [2018-11-18 13:56:32,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:56:32,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:56:32,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:56:32,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:56:32,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:56:32,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:56:33,040 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:56:33,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:56:33,040 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8a31d1e7-738a-4d6a-8fec-406164d069d6/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-18 13:56:33,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:56:33,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:56:33,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:56:33,078 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-18 13:56:33,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:33,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:33,092 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-11-18 13:56:33,098 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:33,099 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:33,100 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-18 13:56:33,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:33,119 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 13:56:33,121 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-18 13:56:33,122 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:33,130 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-18 13:56:33,133 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-18 13:56:33,134 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:33,138 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:33,142 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:33,155 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 13:56:33,157 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 8 treesize of output 7 [2018-11-18 13:56:33,157 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:33,164 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-18 13:56:33,166 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-18 13:56:33,166 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:33,169 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:33,172 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:33,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:33,182 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:77, output treesize:49 [2018-11-18 13:56:33,206 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:33,207 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:33,208 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:33,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-11-18 13:56:33,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:33,244 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:33,245 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:33,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 126 [2018-11-18 13:56:33,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-11-18 13:56:33,250 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:33,268 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:33,269 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:33,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 114 [2018-11-18 13:56:33,277 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-18 13:56:33,277 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:33,290 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:33,303 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:33,329 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:33,334 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 44 [2018-11-18 13:56:33,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 18 treesize of output 11 [2018-11-18 13:56:33,338 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:33,349 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:33,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 55 [2018-11-18 13:56:33,358 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 16 treesize of output 15 [2018-11-18 13:56:33,358 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:33,367 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:33,372 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:33,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:33,387 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:156, output treesize:79 [2018-11-18 13:56:33,417 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:33,419 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:33,421 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:33,424 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:33,426 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:33,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 61 [2018-11-18 13:56:33,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:33,462 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:33,471 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:33,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 209 treesize of output 153 [2018-11-18 13:56:33,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-11-18 13:56:33,480 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:33,507 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:33,514 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:33,519 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:33,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 157 [2018-11-18 13:56:33,525 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 20 [2018-11-18 13:56:33,525 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:33,552 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:33,564 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:33,582 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 13:56:33,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 52 [2018-11-18 13:56:33,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 22 treesize of output 15 [2018-11-18 13:56:33,586 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:33,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 71 [2018-11-18 13:56:33,599 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-18 13:56:33,599 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:33,605 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:33,609 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:33,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 13:56:33,621 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:231, output treesize:144 [2018-11-18 13:56:33,801 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:33,802 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:33,804 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:33,806 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:33,808 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:33,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 114 [2018-11-18 13:56:33,859 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 57 [2018-11-18 13:56:33,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:33,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 29 [2018-11-18 13:56:33,876 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:33,890 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-18 13:56:33,890 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:33,897 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 22 treesize of output 16 [2018-11-18 13:56:33,897 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 13:56:33,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 13:56:33,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 28 [2018-11-18 13:56:33,918 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-18 13:56:33,919 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:33,920 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:33,925 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-18 13:56:33,925 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:164, output treesize:4 [2018-11-18 13:56:33,958 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:56:33,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:56:33,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 17 [2018-11-18 13:56:33,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 13:56:33,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 13:56:33,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=211, Unknown=2, NotChecked=0, Total=272 [2018-11-18 13:56:33,975 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand 17 states. [2018-11-18 13:56:34,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:56:34,684 INFO L93 Difference]: Finished difference Result 209 states and 218 transitions. [2018-11-18 13:56:34,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 13:56:34,687 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 57 [2018-11-18 13:56:34,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:56:34,688 INFO L225 Difference]: With dead ends: 209 [2018-11-18 13:56:34,688 INFO L226 Difference]: Without dead ends: 207 [2018-11-18 13:56:34,688 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=157, Invalid=595, Unknown=4, NotChecked=0, Total=756 [2018-11-18 13:56:34,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-11-18 13:56:34,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 142. [2018-11-18 13:56:34,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-18 13:56:34,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 148 transitions. [2018-11-18 13:56:34,701 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 148 transitions. Word has length 57 [2018-11-18 13:56:34,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:56:34,703 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 148 transitions. [2018-11-18 13:56:34,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 13:56:34,703 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 148 transitions. [2018-11-18 13:56:34,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-18 13:56:34,704 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:56:34,704 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:56:34,704 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:56:34,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:56:34,705 INFO L82 PathProgramCache]: Analyzing trace with hash 812592565, now seen corresponding path program 1 times [2018-11-18 13:56:34,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:56:34,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:56:34,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:56:34,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:56:34,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:56:34,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:56:35,084 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:56:35,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:56:35,084 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8a31d1e7-738a-4d6a-8fec-406164d069d6/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-18 13:56:35,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:56:35,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:56:35,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:56:35,118 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-18 13:56:35,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:35,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:35,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-18 13:56:35,140 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:35,141 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:35,142 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-18 13:56:35,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:35,159 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 13:56:35,161 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 8 treesize of output 7 [2018-11-18 13:56:35,161 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:35,170 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-18 13:56:35,172 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-18 13:56:35,172 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:35,177 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:35,181 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:35,191 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 13:56:35,193 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-18 13:56:35,193 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:35,199 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 24 [2018-11-18 13:56:35,200 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-18 13:56:35,200 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:35,204 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:35,207 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:35,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:35,216 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:74, output treesize:54 [2018-11-18 13:56:35,269 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:35,270 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:35,271 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:35,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 50 [2018-11-18 13:56:35,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:35,324 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 115 [2018-11-18 13:56:35,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 18 treesize of output 11 [2018-11-18 13:56:35,329 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:35,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 110 [2018-11-18 13:56:35,359 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-18 13:56:35,359 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:35,372 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:35,383 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:35,403 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 13:56:35,404 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 53 [2018-11-18 13:56:35,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2018-11-18 13:56:35,406 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:35,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 59 [2018-11-18 13:56:35,419 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 16 treesize of output 27 [2018-11-18 13:56:35,419 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:35,425 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:35,429 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:35,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:35,444 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:159, output treesize:113 [2018-11-18 13:56:35,513 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:35,514 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:35,515 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:35,516 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:35,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 61 [2018-11-18 13:56:35,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:35,549 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:35,552 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:35,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 232 treesize of output 179 [2018-11-18 13:56:35,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 40 [2018-11-18 13:56:35,557 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:35,579 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:35,584 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:35,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 167 [2018-11-18 13:56:35,600 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-18 13:56:35,600 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:35,615 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:35,626 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:35,643 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:35,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 103 [2018-11-18 13:56:35,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 34 treesize of output 43 [2018-11-18 13:56:35,652 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:35,662 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:35,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 130 [2018-11-18 13:56:35,671 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-18 13:56:35,671 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:35,680 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:35,685 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:35,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 13:56:35,698 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:255, output treesize:157 [2018-11-18 13:56:35,749 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 13:56:35,753 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:35,760 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:35,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 125 [2018-11-18 13:56:35,770 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-18 13:56:35,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:35,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2018-11-18 13:56:35,786 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:35,794 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 43 treesize of output 35 [2018-11-18 13:56:35,794 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 13:56:35,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2018-11-18 13:56:35,802 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:35,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 13:56:35,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 30 [2018-11-18 13:56:35,825 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 7 treesize of output 5 [2018-11-18 13:56:35,826 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:35,833 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-18 13:56:35,833 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:35,837 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-18 13:56:35,837 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:35,838 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:35,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:35,842 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:188, output treesize:4 [2018-11-18 13:56:35,863 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:56:35,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:56:35,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 20 [2018-11-18 13:56:35,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-18 13:56:35,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 13:56:35,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2018-11-18 13:56:35,879 INFO L87 Difference]: Start difference. First operand 142 states and 148 transitions. Second operand 20 states. [2018-11-18 13:56:36,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:56:36,355 INFO L93 Difference]: Finished difference Result 183 states and 190 transitions. [2018-11-18 13:56:36,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 13:56:36,355 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2018-11-18 13:56:36,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:56:36,356 INFO L225 Difference]: With dead ends: 183 [2018-11-18 13:56:36,356 INFO L226 Difference]: Without dead ends: 181 [2018-11-18 13:56:36,356 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2018-11-18 13:56:36,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-11-18 13:56:36,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 159. [2018-11-18 13:56:36,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-18 13:56:36,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 165 transitions. [2018-11-18 13:56:36,364 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 165 transitions. Word has length 60 [2018-11-18 13:56:36,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:56:36,364 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 165 transitions. [2018-11-18 13:56:36,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-18 13:56:36,364 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 165 transitions. [2018-11-18 13:56:36,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 13:56:36,365 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:56:36,365 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:56:36,365 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:56:36,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:56:36,366 INFO L82 PathProgramCache]: Analyzing trace with hash 314034480, now seen corresponding path program 1 times [2018-11-18 13:56:36,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:56:36,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:56:36,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:56:36,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:56:36,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:56:36,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:56:36,394 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 13:56:36,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:56:36,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 13:56:36,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 13:56:36,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 13:56:36,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 13:56:36,395 INFO L87 Difference]: Start difference. First operand 159 states and 165 transitions. Second operand 4 states. [2018-11-18 13:56:36,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:56:36,433 INFO L93 Difference]: Finished difference Result 183 states and 191 transitions. [2018-11-18 13:56:36,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 13:56:36,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-11-18 13:56:36,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:56:36,438 INFO L225 Difference]: With dead ends: 183 [2018-11-18 13:56:36,438 INFO L226 Difference]: Without dead ends: 171 [2018-11-18 13:56:36,439 INFO L604 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-18 13:56:36,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-11-18 13:56:36,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2018-11-18 13:56:36,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-11-18 13:56:36,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 175 transitions. [2018-11-18 13:56:36,452 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 175 transitions. Word has length 63 [2018-11-18 13:56:36,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:56:36,452 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 175 transitions. [2018-11-18 13:56:36,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 13:56:36,452 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 175 transitions. [2018-11-18 13:56:36,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 13:56:36,453 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:56:36,453 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:56:36,453 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:56:36,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:56:36,454 INFO L82 PathProgramCache]: Analyzing trace with hash 572199918, now seen corresponding path program 1 times [2018-11-18 13:56:36,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:56:36,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:56:36,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:56:36,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:56:36,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:56:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:56:36,889 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:56:36,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:56:36,889 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8a31d1e7-738a-4d6a-8fec-406164d069d6/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-18 13:56:36,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:56:36,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:56:36,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:56:36,914 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-18 13:56:36,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:36,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:36,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-18 13:56:36,945 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:36,946 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:36,947 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-18 13:56:36,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:36,961 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 13:56:36,963 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 8 treesize of output 7 [2018-11-18 13:56:36,963 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:36,971 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-18 13:56:36,973 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-18 13:56:36,973 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:36,977 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:36,980 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:36,990 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 13:56:36,992 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-18 13:56:36,992 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:36,998 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 24 [2018-11-18 13:56:37,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 12 treesize of output 15 [2018-11-18 13:56:37,000 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:37,003 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:37,006 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:37,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:37,013 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:74, output treesize:54 [2018-11-18 13:56:37,037 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:37,039 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:37,040 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:56:37,041 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-18 13:56:37,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:37,069 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 122 [2018-11-18 13:56:37,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 26 treesize of output 23 [2018-11-18 13:56:37,073 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:37,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 113 [2018-11-18 13:56:37,099 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-18 13:56:37,099 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:37,118 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:37,128 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:37,145 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 13:56:37,145 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 76 [2018-11-18 13:56:37,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 35 treesize of output 30 [2018-11-18 13:56:37,147 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:37,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 66 [2018-11-18 13:56:37,159 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 19 [2018-11-18 13:56:37,160 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:37,166 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:37,170 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:37,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:37,179 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:170, output treesize:87 [2018-11-18 13:56:37,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 41 treesize of output 26 [2018-11-18 13:56:37,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 26 treesize of output 25 [2018-11-18 13:56:37,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:37,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:37,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:37,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:166, output treesize:150 [2018-11-18 13:56:37,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 124 [2018-11-18 13:56:37,302 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 72 treesize of output 62 [2018-11-18 13:56:37,303 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 13:56:37,315 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 70 treesize of output 37 [2018-11-18 13:56:37,316 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:37,325 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 9 treesize of output 7 [2018-11-18 13:56:37,325 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:37,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 13:56:37,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2018-11-18 13:56:37,344 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 26 treesize of output 13 [2018-11-18 13:56:37,344 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:37,351 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 29 treesize of output 18 [2018-11-18 13:56:37,351 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:37,355 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 3 [2018-11-18 13:56:37,355 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 13:56:37,357 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:56:37,362 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-18 13:56:37,362 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:180, output treesize:13 [2018-11-18 13:56:37,396 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:56:37,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 13:56:37,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 21 [2018-11-18 13:56:37,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-18 13:56:37,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-18 13:56:37,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=366, Unknown=3, NotChecked=0, Total=420 [2018-11-18 13:56:37,412 INFO L87 Difference]: Start difference. First operand 169 states and 175 transitions. Second operand 21 states. [2018-11-18 13:56:37,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:56:37,978 INFO L93 Difference]: Finished difference Result 184 states and 189 transitions. [2018-11-18 13:56:37,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 13:56:37,978 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 63 [2018-11-18 13:56:37,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:56:37,979 INFO L225 Difference]: With dead ends: 184 [2018-11-18 13:56:37,979 INFO L226 Difference]: Without dead ends: 182 [2018-11-18 13:56:37,980 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=734, Unknown=3, NotChecked=0, Total=870 [2018-11-18 13:56:37,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-18 13:56:37,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 178. [2018-11-18 13:56:37,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-11-18 13:56:37,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 184 transitions. [2018-11-18 13:56:37,991 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 184 transitions. Word has length 63 [2018-11-18 13:56:37,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:56:37,991 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 184 transitions. [2018-11-18 13:56:37,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-18 13:56:37,991 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 184 transitions. [2018-11-18 13:56:37,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 13:56:37,992 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:56:37,992 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:56:37,992 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:56:37,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:56:37,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1513605410, now seen corresponding path program 1 times [2018-11-18 13:56:37,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 13:56:37,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 13:56:37,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:56:37,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:56:37,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:56:38,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:56:38,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 13:56:38,028 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 13:56:38,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 01:56:38 BoogieIcfgContainer [2018-11-18 13:56:38,062 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 13:56:38,062 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 13:56:38,062 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 13:56:38,062 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 13:56:38,063 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:56:25" (3/4) ... [2018-11-18 13:56:38,068 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-18 13:56:38,105 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8a31d1e7-738a-4d6a-8fec-406164d069d6/bin-2019/uautomizer/witness.graphml [2018-11-18 13:56:38,105 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 13:56:38,106 INFO L168 Benchmark]: Toolchain (without parser) took 13126.85 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 342.9 MB). Free memory was 951.1 MB in the beginning and 1.0 GB in the end (delta: -88.9 MB). Peak memory consumption was 254.0 MB. Max. memory is 11.5 GB. [2018-11-18 13:56:38,107 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:56:38,107 INFO L168 Benchmark]: CACSL2BoogieTranslator took 330.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 951.1 MB in the beginning and 1.1 GB in the end (delta: -178.0 MB). Peak memory consumption was 33.5 MB. Max. memory is 11.5 GB. [2018-11-18 13:56:38,107 INFO L168 Benchmark]: Boogie Preprocessor took 46.14 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: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-11-18 13:56:38,107 INFO L168 Benchmark]: RCFGBuilder took 487.80 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: 54.7 MB). Peak memory consumption was 54.7 MB. Max. memory is 11.5 GB. [2018-11-18 13:56:38,108 INFO L168 Benchmark]: TraceAbstraction took 12216.75 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 207.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 26.4 MB). Peak memory consumption was 233.5 MB. Max. memory is 11.5 GB. [2018-11-18 13:56:38,108 INFO L168 Benchmark]: Witness Printer took 43.15 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:56:38,109 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 330.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 951.1 MB in the beginning and 1.1 GB in the end (delta: -178.0 MB). Peak memory consumption was 33.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.14 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: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 487.80 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: 54.7 MB). Peak memory consumption was 54.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12216.75 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 207.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 26.4 MB). Peak memory consumption was 233.5 MB. Max. memory is 11.5 GB. * Witness Printer took 43.15 ms. Allocated memory is still 1.4 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: 1035]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L985] EXPR, FCALL malloc(sizeof(SLL)) [L985] SLL* head = malloc(sizeof(SLL)); [L986] FCALL head->next = ((void*)0) [L987] FCALL head->data = 0 [L988] SLL* item = head; [L989] int status = 0; VAL [head={10:0}, item={10:0}, malloc(sizeof(SLL))={10:0}, status=0] [L991] COND TRUE __VERIFIER_nondet_int() [L993] EXPR, FCALL malloc(sizeof(SLL)) [L993] FCALL item->next = malloc(sizeof(SLL)) [L994] EXPR, FCALL item->next [L994] item = item->next [L995] FCALL item->next = ((void*)0) VAL [head={10:0}, item={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}, status=0] [L997] COND TRUE !status [L999] FCALL item->data = 1 [L1000] status = 1 VAL [head={10:0}, item={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}, status=1] [L1013] COND FALSE !(!(head != ((void*)0))) VAL [head={10:0}, item={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}, status=1] [L1013] COND FALSE !(0) VAL [head={10:0}, item={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}, status=1] [L1014] COND FALSE !(!(item != ((void*)0))) VAL [head={10:0}, item={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}, status=1] [L1014] COND FALSE !(0) VAL [head={10:0}, item={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}, status=1] [L991] COND TRUE __VERIFIER_nondet_int() [L993] EXPR, FCALL malloc(sizeof(SLL)) [L993] FCALL item->next = malloc(sizeof(SLL)) [L994] EXPR, FCALL item->next [L994] item = item->next [L995] FCALL item->next = ((void*)0) VAL [head={10:0}, item={13:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={13:0}, status=1] [L997] COND FALSE !(!status) VAL [head={10:0}, item={13:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={13:0}, status=1] [L1002] COND TRUE status == 1 [L1004] FCALL item->data = 2 [L1005] status = 2 VAL [head={10:0}, item={13:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={13:0}, status=2] [L1013] COND FALSE !(!(head != ((void*)0))) VAL [head={10:0}, item={13:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={13:0}, status=2] [L1013] COND FALSE !(0) VAL [head={10:0}, item={13:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={13:0}, status=2] [L1014] COND FALSE !(!(item != ((void*)0))) VAL [head={10:0}, item={13:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={13:0}, status=2] [L1014] COND FALSE !(0) VAL [head={10:0}, item={13:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={13:0}, status=2] [L991] COND TRUE __VERIFIER_nondet_int() [L993] EXPR, FCALL malloc(sizeof(SLL)) [L993] FCALL item->next = malloc(sizeof(SLL)) [L994] EXPR, FCALL item->next [L994] item = item->next [L995] FCALL item->next = ((void*)0) VAL [head={10:0}, item={14:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={14:0}, status=2] [L997] COND FALSE !(!status) VAL [head={10:0}, item={14:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={14:0}, status=2] [L1002] COND FALSE !(status == 1) VAL [head={10:0}, item={14:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={14:0}, status=2] [L1007] COND TRUE status >= 2 [L1009] FCALL item->data = 3 [L1010] status = 3 VAL [head={10:0}, item={14:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={14:0}, status=3] [L1013] COND FALSE !(!(head != ((void*)0))) VAL [head={10:0}, item={14:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={14:0}, status=3] [L1013] COND FALSE !(0) VAL [head={10:0}, item={14:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={14:0}, status=3] [L1014] COND FALSE !(!(item != ((void*)0))) VAL [head={10:0}, item={14:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={14:0}, status=3] [L1014] COND FALSE !(0) VAL [head={10:0}, item={14:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={14:0}, status=3] [L991] COND FALSE !(__VERIFIER_nondet_int()) [L1017] COND FALSE !(!(head != ((void*)0))) VAL [head={10:0}, item={14:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={14:0}, status=3] [L1017] COND FALSE !(0) VAL [head={10:0}, item={14:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={14:0}, status=3] [L1018] COND FALSE !(status == 1) VAL [head={10:0}, item={14:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={14:0}, status=3] [L1023] COND FALSE !(status == 2) VAL [head={10:0}, item={14:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={14:0}, status=3] [L1029] COND TRUE status == 3 VAL [head={10:0}, item={14:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={14:0}, status=3] [L1031] COND FALSE !(!(head != ((void*)0))) VAL [head={10:0}, item={14:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={14:0}, status=3] [L1031] COND FALSE !(0) VAL [head={10:0}, item={14:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={14:0}, status=3] [L1032] EXPR, FCALL head->next VAL [head={10:0}, head->next={11:0}, item={14:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={14:0}, status=3] [L1032] COND FALSE !(!(head->next != ((void*)0))) [L1032] COND FALSE !(0) VAL [head={10:0}, item={14:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={14:0}, status=3] [L1033] EXPR, FCALL head->next [L1033] EXPR, FCALL head->next->next VAL [head={10:0}, head->next={11:0}, head->next->next={13:0}, item={14:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={14:0}, status=3] [L1033] COND FALSE !(!(head->next->next != ((void*)0))) [L1033] COND FALSE !(0) VAL [head={10:0}, item={14:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={14:0}, status=3] [L1034] EXPR, FCALL head->next [L1034] EXPR, FCALL head->next->next [L1034] EXPR, FCALL head->next->next->next VAL [head={10:0}, head->next={11:0}, head->next->next={13:0}, head->next->next->next={14:0}, item={14:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={14:0}, status=3] [L1034] COND FALSE !(!(head->next->next->next != ((void*)0))) [L1034] COND FALSE !(0) VAL [head={10:0}, item={14:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={14:0}, status=3] [L1035] EXPR, FCALL head->next [L1035] EXPR, FCALL head->next->next [L1035] EXPR, FCALL head->next->next->next [L1035] EXPR, FCALL head->next->next->next->data VAL [head={10:0}, head->next={11:0}, head->next->next={13:0}, head->next->next->next={14:0}, head->next->next->next->data=3, item={14:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={14:0}, status=3] [L1035] COND TRUE !(head->next->next->next->data != 3) [L1035] __VERIFIER_error() VAL [head={10:0}, item={14:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={14:0}, status=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 99 locations, 14 error locations. UNSAFE Result, 12.1s OverallTime, 22 OverallIterations, 4 TraceHistogramMax, 4.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1760 SDtfs, 2790 SDslu, 6422 SDs, 0 SdLazy, 2882 SolverSat, 260 SolverUnsat, 49 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 701 GetRequests, 478 SyntacticMatches, 14 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=181occurred in iteration=13, 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, 21 MinimizatonAttempts, 391 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 1384 NumberOfCodeBlocks, 1384 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1290 ConstructedInterpolants, 196 QuantifiedInterpolants, 2494274 SizeOfPredicates, 135 NumberOfNonLiveVariables, 1476 ConjunctsInSsa, 352 ConjunctsInUnsatCore, 31 InterpolantComputations, 11 PerfectInterpolantSequences, 100/506 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...