./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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_50446dd0-2e04-492b-9caf-f701faa1838c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_50446dd0-2e04-492b-9caf-f701faa1838c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_50446dd0-2e04-492b-9caf-f701faa1838c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_50446dd0-2e04-492b-9caf-f701faa1838c/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_50446dd0-2e04-492b-9caf-f701faa1838c/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_50446dd0-2e04-492b-9caf-f701faa1838c/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-1dbac8b [2018-10-26 20:05:24,315 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 20:05:24,316 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 20:05:24,326 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 20:05:24,326 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 20:05:24,327 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 20:05:24,328 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 20:05:24,329 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 20:05:24,331 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 20:05:24,331 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 20:05:24,332 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 20:05:24,332 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 20:05:24,333 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 20:05:24,334 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 20:05:24,335 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 20:05:24,336 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 20:05:24,337 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 20:05:24,338 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 20:05:24,340 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 20:05:24,341 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 20:05:24,342 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 20:05:24,343 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 20:05:24,345 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 20:05:24,346 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 20:05:24,346 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 20:05:24,347 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 20:05:24,347 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 20:05:24,348 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 20:05:24,349 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 20:05:24,350 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 20:05:24,351 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 20:05:24,351 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 20:05:24,351 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 20:05:24,351 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 20:05:24,352 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 20:05:24,354 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 20:05:24,354 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_50446dd0-2e04-492b-9caf-f701faa1838c/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-26 20:05:24,365 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 20:05:24,365 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 20:05:24,366 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 20:05:24,366 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 20:05:24,366 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 20:05:24,367 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 20:05:24,367 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 20:05:24,367 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 20:05:24,367 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 20:05:24,367 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 20:05:24,367 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 20:05:24,368 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 20:05:24,368 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 20:05:24,368 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 20:05:24,368 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 20:05:24,368 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 20:05:24,368 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 20:05:24,368 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 20:05:24,369 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 20:05:24,369 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 20:05:24,369 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 20:05:24,369 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 20:05:24,369 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 20:05:24,369 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 20:05:24,371 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 20:05:24,371 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 20:05:24,372 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 20:05:24,372 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 20:05:24,372 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 20:05:24,372 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_50446dd0-2e04-492b-9caf-f701faa1838c/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-10-26 20:05:24,398 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 20:05:24,408 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 20:05:24,411 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 20:05:24,412 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 20:05:24,412 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 20:05:24,413 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_50446dd0-2e04-492b-9caf-f701faa1838c/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/sll-queue_false-unreach-call_false-valid-memcleanup.i [2018-10-26 20:05:24,457 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_50446dd0-2e04-492b-9caf-f701faa1838c/bin-2019/uautomizer/data/2238ddd64/ac5bd3befcdf4d46ab16c8989447a4a4/FLAG43762b671 [2018-10-26 20:05:24,901 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 20:05:24,901 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_50446dd0-2e04-492b-9caf-f701faa1838c/sv-benchmarks/c/forester-heap/sll-queue_false-unreach-call_false-valid-memcleanup.i [2018-10-26 20:05:24,913 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_50446dd0-2e04-492b-9caf-f701faa1838c/bin-2019/uautomizer/data/2238ddd64/ac5bd3befcdf4d46ab16c8989447a4a4/FLAG43762b671 [2018-10-26 20:05:24,928 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_50446dd0-2e04-492b-9caf-f701faa1838c/bin-2019/uautomizer/data/2238ddd64/ac5bd3befcdf4d46ab16c8989447a4a4 [2018-10-26 20:05:24,931 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 20:05:24,933 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 20:05:24,934 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 20:05:24,934 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 20:05:24,938 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 20:05:24,939 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:05:24" (1/1) ... [2018-10-26 20:05:24,941 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42c71606 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:05:24, skipping insertion in model container [2018-10-26 20:05:24,942 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:05:24" (1/1) ... [2018-10-26 20:05:24,949 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 20:05:24,999 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 20:05:25,236 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:05:25,248 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 20:05:25,304 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:05:25,340 INFO L193 MainTranslator]: Completed translation [2018-10-26 20:05:25,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:05:25 WrapperNode [2018-10-26 20:05:25,341 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 20:05:25,342 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 20:05:25,342 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 20:05:25,342 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 20:05:25,411 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:05:25" (1/1) ... [2018-10-26 20:05:25,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:05:25" (1/1) ... [2018-10-26 20:05:25,430 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:05:25" (1/1) ... [2018-10-26 20:05:25,430 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:05:25" (1/1) ... [2018-10-26 20:05:25,451 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:05:25" (1/1) ... [2018-10-26 20:05:25,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:05:25" (1/1) ... [2018-10-26 20:05:25,463 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:05:25" (1/1) ... [2018-10-26 20:05:25,468 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 20:05:25,468 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 20:05:25,468 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 20:05:25,468 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 20:05:25,469 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:05:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_50446dd0-2e04-492b-9caf-f701faa1838c/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-10-26 20:05:25,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 20:05:25,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 20:05:25,515 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 20:05:25,515 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-10-26 20:05:25,515 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-10-26 20:05:25,516 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-10-26 20:05:25,516 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-10-26 20:05:25,516 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-10-26 20:05:25,516 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-10-26 20:05:25,516 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-10-26 20:05:25,516 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-10-26 20:05:25,516 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-10-26 20:05:25,516 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-10-26 20:05:25,516 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-10-26 20:05:25,517 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-10-26 20:05:25,517 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-10-26 20:05:25,517 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-10-26 20:05:25,517 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-10-26 20:05:25,517 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-10-26 20:05:25,517 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-10-26 20:05:25,517 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-10-26 20:05:25,517 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-10-26 20:05:25,517 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-10-26 20:05:25,518 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-10-26 20:05:25,518 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-10-26 20:05:25,518 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-10-26 20:05:25,518 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-10-26 20:05:25,518 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-10-26 20:05:25,518 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-10-26 20:05:25,518 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-10-26 20:05:25,518 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-10-26 20:05:25,518 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-10-26 20:05:25,518 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-10-26 20:05:25,519 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-10-26 20:05:25,519 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-10-26 20:05:25,519 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-10-26 20:05:25,519 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-10-26 20:05:25,519 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-10-26 20:05:25,519 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-10-26 20:05:25,519 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-10-26 20:05:25,519 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-10-26 20:05:25,519 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-10-26 20:05:25,519 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-10-26 20:05:25,519 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-10-26 20:05:25,520 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-10-26 20:05:25,520 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-10-26 20:05:25,520 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-10-26 20:05:25,520 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-10-26 20:05:25,520 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-10-26 20:05:25,520 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-10-26 20:05:25,520 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-10-26 20:05:25,520 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-10-26 20:05:25,520 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-10-26 20:05:25,520 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-10-26 20:05:25,521 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-10-26 20:05:25,521 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-10-26 20:05:25,521 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-10-26 20:05:25,521 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-10-26 20:05:25,521 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-10-26 20:05:25,521 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-10-26 20:05:25,521 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-10-26 20:05:25,521 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-10-26 20:05:25,521 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-10-26 20:05:25,521 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-10-26 20:05:25,521 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-10-26 20:05:25,522 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-10-26 20:05:25,522 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 20:05:25,522 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-10-26 20:05:25,522 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-10-26 20:05:25,522 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-10-26 20:05:25,522 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-10-26 20:05:25,522 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-10-26 20:05:25,522 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-10-26 20:05:25,522 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-10-26 20:05:25,522 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-10-26 20:05:25,523 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-10-26 20:05:25,523 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-10-26 20:05:25,523 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-10-26 20:05:25,523 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-10-26 20:05:25,523 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-10-26 20:05:25,523 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-10-26 20:05:25,523 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-10-26 20:05:25,523 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-10-26 20:05:25,523 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-10-26 20:05:25,523 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-10-26 20:05:25,524 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-10-26 20:05:25,524 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-10-26 20:05:25,524 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-10-26 20:05:25,524 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-10-26 20:05:25,524 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-10-26 20:05:25,524 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-10-26 20:05:25,524 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-10-26 20:05:25,524 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-10-26 20:05:25,524 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-10-26 20:05:25,524 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-10-26 20:05:25,524 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-10-26 20:05:25,525 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-10-26 20:05:25,525 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-10-26 20:05:25,525 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-10-26 20:05:25,525 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-10-26 20:05:25,525 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-10-26 20:05:25,525 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-10-26 20:05:25,525 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-10-26 20:05:25,525 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-10-26 20:05:25,525 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-10-26 20:05:25,526 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-10-26 20:05:25,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-10-26 20:05:25,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-10-26 20:05:25,526 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 20:05:25,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-10-26 20:05:25,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-10-26 20:05:25,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-26 20:05:25,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-10-26 20:05:25,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-26 20:05:25,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-10-26 20:05:25,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 20:05:25,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 20:05:25,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-10-26 20:05:26,470 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 20:05:26,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:05:26 BoogieIcfgContainer [2018-10-26 20:05:26,471 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 20:05:26,471 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 20:05:26,472 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 20:05:26,475 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 20:05:26,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 08:05:24" (1/3) ... [2018-10-26 20:05:26,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37334228 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:05:26, skipping insertion in model container [2018-10-26 20:05:26,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:05:25" (2/3) ... [2018-10-26 20:05:26,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37334228 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:05:26, skipping insertion in model container [2018-10-26 20:05:26,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:05:26" (3/3) ... [2018-10-26 20:05:26,479 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-queue_false-unreach-call_false-valid-memcleanup.i [2018-10-26 20:05:26,488 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 20:05:26,496 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2018-10-26 20:05:26,509 INFO L257 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2018-10-26 20:05:26,536 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 20:05:26,537 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 20:05:26,537 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 20:05:26,537 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 20:05:26,537 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 20:05:26,538 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 20:05:26,538 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 20:05:26,538 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 20:05:26,538 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 20:05:26,556 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states. [2018-10-26 20:05:26,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-26 20:05:26,561 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:26,562 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:05:26,565 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:26,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:26,571 INFO L82 PathProgramCache]: Analyzing trace with hash 881407158, now seen corresponding path program 1 times [2018-10-26 20:05:26,572 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:26,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:26,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:26,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:26,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:26,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:26,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:26,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:05:26,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-26 20:05:26,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-26 20:05:26,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 20:05:26,711 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 2 states. [2018-10-26 20:05:26,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:26,739 INFO L93 Difference]: Finished difference Result 260 states and 370 transitions. [2018-10-26 20:05:26,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-26 20:05:26,740 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-10-26 20:05:26,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:26,750 INFO L225 Difference]: With dead ends: 260 [2018-10-26 20:05:26,750 INFO L226 Difference]: Without dead ends: 125 [2018-10-26 20:05:26,754 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 20:05:26,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-10-26 20:05:26,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-10-26 20:05:26,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-26 20:05:26,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 134 transitions. [2018-10-26 20:05:26,794 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 134 transitions. Word has length 14 [2018-10-26 20:05:26,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:26,795 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 134 transitions. [2018-10-26 20:05:26,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-26 20:05:26,795 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 134 transitions. [2018-10-26 20:05:26,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-26 20:05:26,795 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:26,796 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:05:26,796 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:26,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:26,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1267288291, now seen corresponding path program 1 times [2018-10-26 20:05:26,797 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:26,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:26,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:26,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:26,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:26,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:26,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:26,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:26,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:05:26,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:05:26,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:05:26,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:05:26,877 INFO L87 Difference]: Start difference. First operand 125 states and 134 transitions. Second operand 4 states. [2018-10-26 20:05:27,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:27,140 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2018-10-26 20:05:27,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:05:27,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-10-26 20:05:27,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:27,143 INFO L225 Difference]: With dead ends: 125 [2018-10-26 20:05:27,143 INFO L226 Difference]: Without dead ends: 115 [2018-10-26 20:05:27,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:05:27,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-26 20:05:27,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-10-26 20:05:27,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-26 20:05:27,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2018-10-26 20:05:27,154 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 16 [2018-10-26 20:05:27,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:27,154 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2018-10-26 20:05:27,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:05:27,155 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2018-10-26 20:05:27,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 20:05:27,155 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:27,155 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-10-26 20:05:27,156 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:27,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:27,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1613321334, now seen corresponding path program 1 times [2018-10-26 20:05:27,156 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:27,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:27,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:27,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:27,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:27,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:27,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:27,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:05:27,203 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:05:27,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:05:27,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:05:27,204 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand 3 states. [2018-10-26 20:05:27,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:27,263 INFO L93 Difference]: Finished difference Result 251 states and 276 transitions. [2018-10-26 20:05:27,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:05:27,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-26 20:05:27,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:27,266 INFO L225 Difference]: With dead ends: 251 [2018-10-26 20:05:27,266 INFO L226 Difference]: Without dead ends: 146 [2018-10-26 20:05:27,267 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:05:27,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-10-26 20:05:27,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 130. [2018-10-26 20:05:27,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-10-26 20:05:27,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 140 transitions. [2018-10-26 20:05:27,282 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 140 transitions. Word has length 24 [2018-10-26 20:05:27,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:27,283 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 140 transitions. [2018-10-26 20:05:27,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:05:27,283 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2018-10-26 20:05:27,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 20:05:27,284 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:27,284 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:05:27,284 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:27,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:27,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1198382796, now seen corresponding path program 1 times [2018-10-26 20:05:27,284 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:27,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:27,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:27,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:27,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:27,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:27,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:27,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 20:05:27,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 20:05:27,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 20:05:27,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 20:05:27,424 INFO L87 Difference]: Start difference. First operand 130 states and 140 transitions. Second operand 6 states. [2018-10-26 20:05:27,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:27,947 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2018-10-26 20:05:27,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 20:05:27,948 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-10-26 20:05:27,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:27,949 INFO L225 Difference]: With dead ends: 146 [2018-10-26 20:05:27,949 INFO L226 Difference]: Without dead ends: 144 [2018-10-26 20:05:27,949 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-10-26 20:05:27,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-10-26 20:05:27,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 128. [2018-10-26 20:05:27,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-10-26 20:05:27,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-10-26 20:05:27,961 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 27 [2018-10-26 20:05:27,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:27,961 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-10-26 20:05:27,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 20:05:27,961 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-10-26 20:05:27,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-26 20:05:27,970 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:27,970 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:05:27,971 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:27,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:27,971 INFO L82 PathProgramCache]: Analyzing trace with hash 202776756, now seen corresponding path program 1 times [2018-10-26 20:05:27,971 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:27,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:27,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:27,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:27,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:28,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:28,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:28,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 20:05:28,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 20:05:28,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 20:05:28,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 20:05:28,068 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 6 states. [2018-10-26 20:05:28,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:28,381 INFO L93 Difference]: Finished difference Result 149 states and 162 transitions. [2018-10-26 20:05:28,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:05:28,382 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-10-26 20:05:28,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:28,384 INFO L225 Difference]: With dead ends: 149 [2018-10-26 20:05:28,384 INFO L226 Difference]: Without dead ends: 122 [2018-10-26 20:05:28,385 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-10-26 20:05:28,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-10-26 20:05:28,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-10-26 20:05:28,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-10-26 20:05:28,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2018-10-26 20:05:28,393 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 29 [2018-10-26 20:05:28,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:28,393 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2018-10-26 20:05:28,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 20:05:28,393 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2018-10-26 20:05:28,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-26 20:05:28,396 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:28,396 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, 1] [2018-10-26 20:05:28,396 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:28,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:28,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1586814352, now seen corresponding path program 1 times [2018-10-26 20:05:28,397 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:28,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:28,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:28,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:28,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:28,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:28,622 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:28,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:05:28,622 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_50446dd0-2e04-492b-9caf-f701faa1838c/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-10-26 20:05:28,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:28,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:05:28,716 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-10-26 20:05:28,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:28,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:28,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-26 20:05:28,749 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:28,750 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:28,751 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-10-26 20:05:28,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:28,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:28,760 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2018-10-26 20:05:28,776 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 11 treesize of output 8 [2018-10-26 20:05:28,778 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-10-26 20:05:28,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:28,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:28,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:28,790 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-10-26 20:05:28,914 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-10-26 20:05:28,917 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-10-26 20:05:28,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:28,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:28,926 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-10-26 20:05:28,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-10-26 20:05:28,999 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-10-26 20:05:29,002 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-10-26 20:05:29,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:29,061 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-10-26 20:05:29,061 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:29,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:29,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:29,088 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:4 [2018-10-26 20:05:29,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:29,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 20:05:29,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2018-10-26 20:05:29,128 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-26 20:05:29,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-26 20:05:29,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-10-26 20:05:29,128 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand 15 states. [2018-10-26 20:05:29,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:29,947 INFO L93 Difference]: Finished difference Result 218 states and 231 transitions. [2018-10-26 20:05:29,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-26 20:05:29,950 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2018-10-26 20:05:29,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:29,951 INFO L225 Difference]: With dead ends: 218 [2018-10-26 20:05:29,951 INFO L226 Difference]: Without dead ends: 216 [2018-10-26 20:05:29,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2018-10-26 20:05:29,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-10-26 20:05:29,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 143. [2018-10-26 20:05:29,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-26 20:05:29,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 153 transitions. [2018-10-26 20:05:29,962 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 153 transitions. Word has length 41 [2018-10-26 20:05:29,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:29,963 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 153 transitions. [2018-10-26 20:05:29,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-26 20:05:29,963 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 153 transitions. [2018-10-26 20:05:29,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-26 20:05:29,964 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:29,964 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, 1, 1] [2018-10-26 20:05:29,964 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:29,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:29,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1125116089, now seen corresponding path program 1 times [2018-10-26 20:05:29,965 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:29,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:29,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:29,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:29,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:29,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:30,019 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:30,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:30,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:05:30,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:05:30,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:05:30,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:05:30,020 INFO L87 Difference]: Start difference. First operand 143 states and 153 transitions. Second operand 3 states. [2018-10-26 20:05:30,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:30,090 INFO L93 Difference]: Finished difference Result 284 states and 309 transitions. [2018-10-26 20:05:30,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:05:30,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-10-26 20:05:30,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:30,092 INFO L225 Difference]: With dead ends: 284 [2018-10-26 20:05:30,092 INFO L226 Difference]: Without dead ends: 181 [2018-10-26 20:05:30,092 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:05:30,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-10-26 20:05:30,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 165. [2018-10-26 20:05:30,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-26 20:05:30,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 175 transitions. [2018-10-26 20:05:30,100 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 175 transitions. Word has length 42 [2018-10-26 20:05:30,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:30,100 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 175 transitions. [2018-10-26 20:05:30,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:05:30,100 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 175 transitions. [2018-10-26 20:05:30,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-26 20:05:30,101 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:30,103 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:05:30,104 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:30,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:30,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1861351858, now seen corresponding path program 1 times [2018-10-26 20:05:30,104 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:30,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:30,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:30,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:30,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:30,191 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-26 20:05:30,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:30,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:05:30,192 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:05:30,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:05:30,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:05:30,192 INFO L87 Difference]: Start difference. First operand 165 states and 175 transitions. Second operand 3 states. [2018-10-26 20:05:30,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:30,281 INFO L93 Difference]: Finished difference Result 168 states and 178 transitions. [2018-10-26 20:05:30,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:05:30,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-10-26 20:05:30,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:30,283 INFO L225 Difference]: With dead ends: 168 [2018-10-26 20:05:30,283 INFO L226 Difference]: Without dead ends: 166 [2018-10-26 20:05:30,284 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:05:30,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-26 20:05:30,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-10-26 20:05:30,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-10-26 20:05:30,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 176 transitions. [2018-10-26 20:05:30,292 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 176 transitions. Word has length 53 [2018-10-26 20:05:30,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:30,293 INFO L481 AbstractCegarLoop]: Abstraction has 166 states and 176 transitions. [2018-10-26 20:05:30,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:05:30,293 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 176 transitions. [2018-10-26 20:05:30,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-26 20:05:30,294 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:30,294 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:05:30,295 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:30,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:30,295 INFO L82 PathProgramCache]: Analyzing trace with hash 2054445301, now seen corresponding path program 1 times [2018-10-26 20:05:30,295 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:30,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:30,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:30,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:30,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:30,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:30,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:30,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:05:30,922 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_50446dd0-2e04-492b-9caf-f701faa1838c/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-10-26 20:05:30,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:30,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:30,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:05:30,976 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-10-26 20:05:30,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:30,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:30,980 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-26 20:05:31,026 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:31,027 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:31,028 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-10-26 20:05:31,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:31,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:31,034 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-10-26 20:05:31,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 20:05:31,061 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-10-26 20:05:31,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:31,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:31,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 20:05: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-10-26 20:05:31,073 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:31,075 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:31,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:31,081 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2018-10-26 20:05:31,145 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:31,149 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 27 treesize of output 28 [2018-10-26 20:05:31,151 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-10-26 20:05:31,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:31,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:31,179 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 37 treesize of output 42 [2018-10-26 20:05:31,182 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-10-26 20:05:31,182 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:31,188 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:31,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:31,195 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:52 [2018-10-26 20:05:31,232 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-10-26 20:05:31,238 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-10-26 20:05:31,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:31,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:31,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:31,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:71, output treesize:63 [2018-10-26 20:05:31,289 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-10-26 20:05:31,293 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-10-26 20:05:31,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:31,306 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-10-26 20:05:31,306 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:31,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:31,321 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-10-26 20:05:31,323 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-10-26 20:05:31,323 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:31,329 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-10-26 20:05:31,329 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:31,334 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:31,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:31,339 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:77, output treesize:13 [2018-10-26 20:05:31,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 20:05:31,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 20:05:31,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:31,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:31,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:31,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-10-26 20:05:31,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:31,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 20:05:31,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 31 [2018-10-26 20:05:31,757 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-26 20:05:31,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-26 20:05:31,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=848, Unknown=0, NotChecked=0, Total=930 [2018-10-26 20:05:31,758 INFO L87 Difference]: Start difference. First operand 166 states and 176 transitions. Second operand 31 states. [2018-10-26 20:05:31,936 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2018-10-26 20:05:33,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:33,833 INFO L93 Difference]: Finished difference Result 219 states and 231 transitions. [2018-10-26 20:05:33,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-26 20:05:33,834 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 55 [2018-10-26 20:05:33,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:33,835 INFO L225 Difference]: With dead ends: 219 [2018-10-26 20:05:33,835 INFO L226 Difference]: Without dead ends: 217 [2018-10-26 20:05:33,836 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=470, Invalid=2392, Unknown=0, NotChecked=0, Total=2862 [2018-10-26 20:05:33,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-10-26 20:05:33,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 179. [2018-10-26 20:05:33,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-10-26 20:05:33,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 190 transitions. [2018-10-26 20:05:33,843 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 190 transitions. Word has length 55 [2018-10-26 20:05:33,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:33,843 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 190 transitions. [2018-10-26 20:05:33,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-26 20:05:33,843 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 190 transitions. [2018-10-26 20:05:33,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-26 20:05:33,844 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:33,845 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] [2018-10-26 20:05:33,845 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:33,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:33,845 INFO L82 PathProgramCache]: Analyzing trace with hash 176988780, now seen corresponding path program 1 times [2018-10-26 20:05:33,849 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:33,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:33,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:33,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:33,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:33,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:33,905 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-26 20:05:33,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:33,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:05:33,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:05:33,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:05:33,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:05:33,906 INFO L87 Difference]: Start difference. First operand 179 states and 190 transitions. Second operand 3 states. [2018-10-26 20:05:33,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:33,957 INFO L93 Difference]: Finished difference Result 347 states and 375 transitions. [2018-10-26 20:05:33,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:05:33,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-10-26 20:05:33,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:33,959 INFO L225 Difference]: With dead ends: 347 [2018-10-26 20:05:33,959 INFO L226 Difference]: Without dead ends: 221 [2018-10-26 20:05:33,960 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:05:33,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-10-26 20:05:33,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 201. [2018-10-26 20:05:33,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-26 20:05:33,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 213 transitions. [2018-10-26 20:05:33,970 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 213 transitions. Word has length 59 [2018-10-26 20:05:33,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:33,970 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 213 transitions. [2018-10-26 20:05:33,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:05:33,971 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 213 transitions. [2018-10-26 20:05:33,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-26 20:05:33,974 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:33,974 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] [2018-10-26 20:05:33,974 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:33,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:33,975 INFO L82 PathProgramCache]: Analyzing trace with hash -31561667, now seen corresponding path program 1 times [2018-10-26 20:05:33,975 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:33,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:33,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:33,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:33,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:34,433 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:34,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:05:34,433 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_50446dd0-2e04-492b-9caf-f701faa1838c/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-10-26 20:05:34,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:34,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:34,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:05:34,467 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-10-26 20:05:34,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:34,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:34,468 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-26 20:05:34,478 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:34,478 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:34,479 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-10-26 20:05:34,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:34,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:34,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:25 [2018-10-26 20:05:34,520 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 11 treesize of output 8 [2018-10-26 20:05:34,523 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-10-26 20:05:34,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:34,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:34,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:34,564 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-10-26 20:05:34,634 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:34,636 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 44 treesize of output 45 [2018-10-26 20:05:34,639 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-10-26 20:05:34,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:34,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:34,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:34,652 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:41 [2018-10-26 20:05:34,677 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:34,677 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:34,678 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:34,679 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-10-26 20:05:34,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:34,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:34,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:39 [2018-10-26 20:05:34,959 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 42 treesize of output 41 [2018-10-26 20:05:34,962 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 14 treesize of output 7 [2018-10-26 20:05:34,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:34,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:34,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:34,974 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:40 [2018-10-26 20:05:35,206 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 59 [2018-10-26 20:05:35,209 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-10-26 20:05:35,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:35,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:35,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-26 20:05:35,223 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:72, output treesize:60 [2018-10-26 20:05:35,362 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-10-26 20:05:35,373 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-10-26 20:05:35,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:35,439 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-10-26 20:05:35,439 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:35,450 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-10-26 20:05:35,450 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:35,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:35,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:35,456 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:67, output treesize:4 [2018-10-26 20:05:35,466 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:35,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 20:05:35,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 27 [2018-10-26 20:05:35,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-26 20:05:35,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-26 20:05:35,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2018-10-26 20:05:35,484 INFO L87 Difference]: Start difference. First operand 201 states and 213 transitions. Second operand 27 states. [2018-10-26 20:05:37,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:37,768 INFO L93 Difference]: Finished difference Result 468 states and 497 transitions. [2018-10-26 20:05:37,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-26 20:05:37,769 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 60 [2018-10-26 20:05:37,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:37,770 INFO L225 Difference]: With dead ends: 468 [2018-10-26 20:05:37,770 INFO L226 Difference]: Without dead ends: 466 [2018-10-26 20:05:37,771 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 894 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=656, Invalid=2766, Unknown=0, NotChecked=0, Total=3422 [2018-10-26 20:05:37,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2018-10-26 20:05:37,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 262. [2018-10-26 20:05:37,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-10-26 20:05:37,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 281 transitions. [2018-10-26 20:05:37,784 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 281 transitions. Word has length 60 [2018-10-26 20:05:37,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:37,784 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 281 transitions. [2018-10-26 20:05:37,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-26 20:05:37,784 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 281 transitions. [2018-10-26 20:05:37,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-26 20:05:37,785 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:37,785 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, 1, 1] [2018-10-26 20:05:37,788 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:37,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:37,789 INFO L82 PathProgramCache]: Analyzing trace with hash -278160506, now seen corresponding path program 1 times [2018-10-26 20:05:37,789 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:37,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:37,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:37,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:37,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:37,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:38,199 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:38,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:05:38,199 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_50446dd0-2e04-492b-9caf-f701faa1838c/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-10-26 20:05:38,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:38,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:05:38,259 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-10-26 20:05:38,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:38,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:38,274 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-26 20:05:38,399 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:38,399 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:38,400 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-10-26 20:05:38,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:38,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:38,410 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-10-26 20:05:38,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 20:05:38,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-10-26 20:05:38,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:38,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:38,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 20:05:38,462 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-10-26 20:05:38,462 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:38,464 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:38,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:38,472 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-10-26 20:05:38,550 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:38,553 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 36 treesize of output 37 [2018-10-26 20:05:38,555 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-10-26 20:05:38,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:38,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:38,574 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 37 treesize of output 42 [2018-10-26 20:05:38,581 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-10-26 20:05:38,581 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:38,592 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:38,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:38,601 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:66, output treesize:66 [2018-10-26 20:05:38,648 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:38,648 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:38,649 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:38,650 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-10-26 20:05:38,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:38,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:38,661 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:68 [2018-10-26 20:05:38,698 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:38,699 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 53 treesize of output 58 [2018-10-26 20:05:38,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 34 [2018-10-26 20:05:38,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:38,719 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:38,736 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 52 treesize of output 58 [2018-10-26 20:05:38,739 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 30 [2018-10-26 20:05:38,740 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:38,747 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:38,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:38,757 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:90, output treesize:66 [2018-10-26 20:05:38,862 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 130 treesize of output 118 [2018-10-26 20:05:38,864 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-10-26 20:05:38,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:38,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:38,993 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 90 [2018-10-26 20:05:38,995 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-10-26 20:05:38,995 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:39,003 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:39,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 20:05:39,011 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:138, output treesize:106 [2018-10-26 20:05:39,079 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 92 [2018-10-26 20:05:39,084 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 74 treesize of output 59 [2018-10-26 20:05:39,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:39,092 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-10-26 20:05:39,093 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:39,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:39,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-26 20:05:39,106 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:120, output treesize:74 [2018-10-26 20:05:39,146 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 75 treesize of output 42 [2018-10-26 20:05:39,148 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-10-26 20:05:39,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:39,155 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-10-26 20:05:39,155 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:39,161 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-10-26 20:05:39,161 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:39,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:39,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:39,168 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:75, output treesize:4 [2018-10-26 20:05:39,197 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:39,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 20:05:39,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 34 [2018-10-26 20:05:39,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-26 20:05:39,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-26 20:05:39,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1013, Unknown=0, NotChecked=0, Total=1122 [2018-10-26 20:05:39,215 INFO L87 Difference]: Start difference. First operand 262 states and 281 transitions. Second operand 34 states. [2018-10-26 20:05:39,773 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 31 [2018-10-26 20:05:40,332 WARN L179 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2018-10-26 20:05:41,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:41,435 INFO L93 Difference]: Finished difference Result 315 states and 336 transitions. [2018-10-26 20:05:41,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-26 20:05:41,436 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 65 [2018-10-26 20:05:41,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:41,437 INFO L225 Difference]: With dead ends: 315 [2018-10-26 20:05:41,437 INFO L226 Difference]: Without dead ends: 313 [2018-10-26 20:05:41,438 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=423, Invalid=2333, Unknown=0, NotChecked=0, Total=2756 [2018-10-26 20:05:41,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-10-26 20:05:41,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 289. [2018-10-26 20:05:41,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-10-26 20:05:41,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 309 transitions. [2018-10-26 20:05:41,449 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 309 transitions. Word has length 65 [2018-10-26 20:05:41,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:41,449 INFO L481 AbstractCegarLoop]: Abstraction has 289 states and 309 transitions. [2018-10-26 20:05:41,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-26 20:05:41,449 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 309 transitions. [2018-10-26 20:05:41,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-26 20:05:41,450 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:41,450 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:05:41,450 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:41,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:41,450 INFO L82 PathProgramCache]: Analyzing trace with hash 946464871, now seen corresponding path program 1 times [2018-10-26 20:05:41,451 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:41,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:41,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:41,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:41,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:41,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:41,624 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-26 20:05:41,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:41,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:05:41,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:05:41,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:05:41,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:05:41,625 INFO L87 Difference]: Start difference. First operand 289 states and 309 transitions. Second operand 4 states. [2018-10-26 20:05:41,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:41,708 INFO L93 Difference]: Finished difference Result 322 states and 344 transitions. [2018-10-26 20:05:41,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 20:05:41,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-10-26 20:05:41,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:41,710 INFO L225 Difference]: With dead ends: 322 [2018-10-26 20:05:41,710 INFO L226 Difference]: Without dead ends: 307 [2018-10-26 20:05:41,711 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:05:41,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-10-26 20:05:41,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2018-10-26 20:05:41,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-10-26 20:05:41,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 325 transitions. [2018-10-26 20:05:41,723 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 325 transitions. Word has length 65 [2018-10-26 20:05:41,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:41,723 INFO L481 AbstractCegarLoop]: Abstraction has 305 states and 325 transitions. [2018-10-26 20:05:41,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:05:41,723 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 325 transitions. [2018-10-26 20:05:41,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-26 20:05:41,724 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:41,724 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:05:41,727 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:41,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:41,727 INFO L82 PathProgramCache]: Analyzing trace with hash 480279338, now seen corresponding path program 1 times [2018-10-26 20:05:41,727 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:41,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:41,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:41,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:41,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:41,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:42,214 WARN L179 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2018-10-26 20:05:42,423 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:42,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:05:42,424 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_50446dd0-2e04-492b-9caf-f701faa1838c/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-10-26 20:05:42,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:42,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:05:42,455 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-10-26 20:05:42,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:42,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:42,456 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-26 20:05:42,468 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:42,469 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:42,469 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-10-26 20:05:42,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:42,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:42,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-10-26 20:05:42,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 20:05:42,504 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-10-26 20:05:42,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:42,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:42,514 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 11 treesize of output 8 [2018-10-26 20:05:42,516 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-10-26 20:05:42,516 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:42,518 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:42,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:42,523 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2018-10-26 20:05:42,585 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 54 treesize of output 55 [2018-10-26 20:05:42,587 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-10-26 20:05:42,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:42,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:42,601 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-10-26 20:05:42,603 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-10-26 20:05:42,603 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:42,607 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:42,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:42,612 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:46 [2018-10-26 20:05:42,738 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 69 treesize of output 56 [2018-10-26 20:05:42,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-10-26 20:05:42,754 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 20:05:42,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:05:42,924 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:43,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 20:05:43,082 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 37 treesize of output 29 [2018-10-26 20:05:43,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-10-26 20:05:43,085 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:43,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 20:05:43,093 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:43,099 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:43,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:43,102 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:76, output treesize:7 [2018-10-26 20:05:43,135 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:43,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 20:05:43,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 25 [2018-10-26 20:05:43,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-26 20:05:43,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-26 20:05:43,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=531, Unknown=7, NotChecked=0, Total=600 [2018-10-26 20:05:43,153 INFO L87 Difference]: Start difference. First operand 305 states and 325 transitions. Second operand 25 states. [2018-10-26 20:05:45,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:45,696 INFO L93 Difference]: Finished difference Result 325 states and 345 transitions. [2018-10-26 20:05:45,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-26 20:05:45,697 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 67 [2018-10-26 20:05:45,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:45,698 INFO L225 Difference]: With dead ends: 325 [2018-10-26 20:05:45,698 INFO L226 Difference]: Without dead ends: 281 [2018-10-26 20:05:45,699 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 56 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=243, Invalid=1307, Unknown=10, NotChecked=0, Total=1560 [2018-10-26 20:05:45,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-10-26 20:05:45,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2018-10-26 20:05:45,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-10-26 20:05:45,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 300 transitions. [2018-10-26 20:05:45,711 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 300 transitions. Word has length 67 [2018-10-26 20:05:45,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:45,711 INFO L481 AbstractCegarLoop]: Abstraction has 281 states and 300 transitions. [2018-10-26 20:05:45,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-26 20:05:45,711 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 300 transitions. [2018-10-26 20:05:45,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-26 20:05:45,712 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:45,712 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 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-10-26 20:05:45,712 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:45,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:45,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1861891477, now seen corresponding path program 1 times [2018-10-26 20:05:45,713 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:45,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:45,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:45,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:45,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:45,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:45,797 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-10-26 20:05:45,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:45,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:05:45,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:05:45,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:05:45,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:05:45,799 INFO L87 Difference]: Start difference. First operand 281 states and 300 transitions. Second operand 3 states. [2018-10-26 20:05:45,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:45,974 INFO L93 Difference]: Finished difference Result 385 states and 413 transitions. [2018-10-26 20:05:45,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:05:45,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2018-10-26 20:05:45,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:45,976 INFO L225 Difference]: With dead ends: 385 [2018-10-26 20:05:45,976 INFO L226 Difference]: Without dead ends: 168 [2018-10-26 20:05:45,976 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:05:45,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-10-26 20:05:45,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 141. [2018-10-26 20:05:45,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-10-26 20:05:45,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 144 transitions. [2018-10-26 20:05:45,988 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 144 transitions. Word has length 78 [2018-10-26 20:05:45,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:45,988 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 144 transitions. [2018-10-26 20:05:45,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:05:45,988 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 144 transitions. [2018-10-26 20:05:45,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-26 20:05:45,989 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:45,989 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:05:45,993 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:45,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:45,993 INFO L82 PathProgramCache]: Analyzing trace with hash -69027919, now seen corresponding path program 1 times [2018-10-26 20:05:45,993 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:45,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:45,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:45,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:45,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:46,856 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:46,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:05:46,857 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_50446dd0-2e04-492b-9caf-f701faa1838c/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-10-26 20:05:46,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:46,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:46,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:05:46,902 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-10-26 20:05:46,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:46,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:46,926 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-26 20:05:46,985 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:46,986 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:46,987 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-10-26 20:05:46,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:46,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:46,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-10-26 20:05:47,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 20:05:47,030 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-10-26 20:05:47,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:47,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:47,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 20:05:47,043 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-10-26 20:05:47,044 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:47,045 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:47,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:47,053 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2018-10-26 20:05:47,180 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:47,183 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 36 treesize of output 37 [2018-10-26 20:05:47,185 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-10-26 20:05:47,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:47,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:47,205 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 37 treesize of output 42 [2018-10-26 20:05:47,208 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-10-26 20:05:47,208 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:47,214 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:47,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:47,224 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:66, output treesize:66 [2018-10-26 20:05:47,290 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-10-26 20:05:47,293 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-10-26 20:05:47,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:47,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:47,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:47,415 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:79, output treesize:79 [2018-10-26 20:05:47,471 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:47,471 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:47,472 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:47,473 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-10-26 20:05:47,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:47,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:47,484 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:84, output treesize:77 [2018-10-26 20:05:47,539 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 66 treesize of output 65 [2018-10-26 20:05:47,542 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 26 [2018-10-26 20:05:47,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:47,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:47,569 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 52 treesize of output 58 [2018-10-26 20:05:47,571 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 30 [2018-10-26 20:05:47,572 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:47,578 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:47,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:47,589 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:99, output treesize:67 [2018-10-26 20:05:47,714 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:47,715 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:47,721 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 88 treesize of output 92 [2018-10-26 20:05:47,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 20:05:47,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:47,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:47,772 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 51 treesize of output 52 [2018-10-26 20:05:47,773 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-10-26 20:05:47,774 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:47,780 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:47,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:47,790 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:106, output treesize:74 [2018-10-26 20:05:47,838 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-10-26 20:05:47,841 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-10-26 20:05:47,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:47,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:47,856 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-10-26 20:05:47,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:144, output treesize:128 [2018-10-26 20:05:47,935 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-10-26 20:05:47,958 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-10-26 20:05:47,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:47,974 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-10-26 20:05:47,974 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:47,983 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-10-26 20:05:47,983 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 20:05:47,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 20:05:48,001 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-10-26 20:05:48,003 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-10-26 20:05:48,003 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:48,009 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-10-26 20:05:48,009 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:48,012 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:48,019 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-10-26 20:05:48,019 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:142, output treesize:26 [2018-10-26 20:05:48,150 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 24 treesize of output 22 [2018-10-26 20:05:48,158 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 1 [2018-10-26 20:05:48,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:48,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 20:05:48,166 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:48,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:48,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:48,170 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2018-10-26 20:05:48,230 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:48,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 20:05:48,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21] total 43 [2018-10-26 20:05:48,247 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-26 20:05:48,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-26 20:05:48,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1682, Unknown=1, NotChecked=0, Total=1806 [2018-10-26 20:05:48,247 INFO L87 Difference]: Start difference. First operand 141 states and 144 transitions. Second operand 43 states. [2018-10-26 20:05:50,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:50,824 INFO L93 Difference]: Finished difference Result 182 states and 187 transitions. [2018-10-26 20:05:50,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-26 20:05:50,826 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 78 [2018-10-26 20:05:50,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:50,827 INFO L225 Difference]: With dead ends: 182 [2018-10-26 20:05:50,827 INFO L226 Difference]: Without dead ends: 180 [2018-10-26 20:05:50,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 945 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=622, Invalid=4204, Unknown=4, NotChecked=0, Total=4830 [2018-10-26 20:05:50,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-10-26 20:05:50,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 151. [2018-10-26 20:05:50,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-26 20:05:50,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 155 transitions. [2018-10-26 20:05:50,839 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 155 transitions. Word has length 78 [2018-10-26 20:05:50,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:50,839 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 155 transitions. [2018-10-26 20:05:50,839 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-26 20:05:50,839 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 155 transitions. [2018-10-26 20:05:50,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-26 20:05:50,840 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:50,840 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 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, 1, 1] [2018-10-26 20:05:50,840 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:50,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:50,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1491402952, now seen corresponding path program 1 times [2018-10-26 20:05:50,841 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:50,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:50,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:50,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:50,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:51,285 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:51,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:05:51,286 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_50446dd0-2e04-492b-9caf-f701faa1838c/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-10-26 20:05:51,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:51,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:05:51,319 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-10-26 20:05:51,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:51,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:51,321 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-26 20:05:51,331 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:51,332 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:51,332 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-10-26 20:05:51,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:51,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:51,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:25 [2018-10-26 20:05:51,389 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 11 treesize of output 8 [2018-10-26 20:05:51,410 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-10-26 20:05:51,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:51,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:51,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:51,522 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-10-26 20:05:51,582 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:51,585 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 44 treesize of output 45 [2018-10-26 20:05:51,587 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-10-26 20:05:51,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:51,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:51,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:51,601 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:41 [2018-10-26 20:05:51,650 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:51,651 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:51,652 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:51,653 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-10-26 20:05:51,653 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:51,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:51,666 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:61 [2018-10-26 20:05:51,701 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 51 treesize of output 50 [2018-10-26 20:05:51,720 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 14 treesize of output 7 [2018-10-26 20:05:51,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:51,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:51,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:51,738 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:66 [2018-10-26 20:05:51,829 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:51,830 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:51,835 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 89 treesize of output 89 [2018-10-26 20:05:51,837 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-10-26 20:05:51,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:51,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:51,860 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-10-26 20:05:51,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:97, output treesize:85 [2018-10-26 20:05:51,959 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:51,960 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:51,960 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:51,961 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:51,962 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-10-26 20:05:51,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:51,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 20:05:51,973 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:87, output treesize:79 [2018-10-26 20:05:52,057 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:52,218 INFO L303 Elim1Store]: Index analysis took 206 ms [2018-10-26 20:05:52,219 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 82 treesize of output 84 [2018-10-26 20:05:52,262 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 14 treesize of output 7 [2018-10-26 20:05:52,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:52,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:52,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 20:05:52,529 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:90, output treesize:84 [2018-10-26 20:05:52,626 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 98 [2018-10-26 20:05:52,628 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-10-26 20:05:52,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:52,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:52,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-26 20:05:52,647 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:140, output treesize:124 [2018-10-26 20:05:52,878 INFO L303 Elim1Store]: Index analysis took 179 ms [2018-10-26 20:05:52,879 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-10-26 20:05:52,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 34 treesize of output 21 [2018-10-26 20:05:52,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:53,138 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 21 treesize of output 15 [2018-10-26 20:05:53,138 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:53,144 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-10-26 20:05:53,144 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:53,150 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-10-26 20:05:53,150 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:53,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:53,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:53,155 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:131, output treesize:4 [2018-10-26 20:05:53,192 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:53,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 20:05:53,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 37 [2018-10-26 20:05:53,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-26 20:05:53,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-26 20:05:53,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1155, Unknown=0, NotChecked=0, Total=1332 [2018-10-26 20:05:53,210 INFO L87 Difference]: Start difference. First operand 151 states and 155 transitions. Second operand 37 states. [2018-10-26 20:05:54,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:54,752 INFO L93 Difference]: Finished difference Result 228 states and 235 transitions. [2018-10-26 20:05:54,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-26 20:05:54,753 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 80 [2018-10-26 20:05:54,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:54,754 INFO L225 Difference]: With dead ends: 228 [2018-10-26 20:05:54,754 INFO L226 Difference]: Without dead ends: 226 [2018-10-26 20:05:54,755 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1137 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=627, Invalid=3663, Unknown=0, NotChecked=0, Total=4290 [2018-10-26 20:05:54,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-10-26 20:05:54,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 149. [2018-10-26 20:05:54,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-10-26 20:05:54,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 153 transitions. [2018-10-26 20:05:54,764 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 153 transitions. Word has length 80 [2018-10-26 20:05:54,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:54,764 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 153 transitions. [2018-10-26 20:05:54,764 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-26 20:05:54,764 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 153 transitions. [2018-10-26 20:05:54,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-26 20:05:54,765 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:54,765 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:05:54,765 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:54,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:54,765 INFO L82 PathProgramCache]: Analyzing trace with hash 721209582, now seen corresponding path program 1 times [2018-10-26 20:05:54,765 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:05:54,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:05:54,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:54,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:54,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:05:54,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:55,372 WARN L179 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2018-10-26 20:05:55,667 WARN L179 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2018-10-26 20:05:56,069 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:56,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:05:56,070 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_50446dd0-2e04-492b-9caf-f701faa1838c/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-10-26 20:05:56,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:56,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:56,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:05:56,125 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-10-26 20:05:56,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:56,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:56,128 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-26 20:05:56,137 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:56,137 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:56,138 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-10-26 20:05:56,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:56,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:56,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-10-26 20:05:56,153 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 11 treesize of output 8 [2018-10-26 20:05:56,155 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-10-26 20:05:56,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:56,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:56,169 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 11 treesize of output 8 [2018-10-26 20:05:56,171 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-10-26 20:05:56,171 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:56,172 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:56,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:56,181 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-10-26 20:05:56,204 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-10-26 20:05:56,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 12 treesize of output 11 [2018-10-26 20:05:56,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:56,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:56,225 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 30 treesize of output 31 [2018-10-26 20:05:56,240 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-10-26 20:05:56,240 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:56,245 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:56,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:56,256 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:57, output treesize:53 [2018-10-26 20:05:56,326 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:56,327 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:56,328 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:56,329 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 22 treesize of output 38 [2018-10-26 20:05:56,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:56,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:56,348 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:71, output treesize:77 [2018-10-26 20:05:56,400 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:56,401 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:56,402 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 60 [2018-10-26 20:05:56,405 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 29 treesize of output 23 [2018-10-26 20:05:56,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:56,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:56,439 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:56,443 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 30 treesize of output 36 [2018-10-26 20:05:56,447 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 15 [2018-10-26 20:05:56,447 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:56,453 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:56,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:56,484 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:99, output treesize:71 [2018-10-26 20:05:56,597 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:56,598 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:56,600 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:56,601 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:56,606 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 85 treesize of output 97 [2018-10-26 20:05:56,608 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-10-26 20:05:56,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:56,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:56,641 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 28 [2018-10-26 20:05:56,643 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-10-26 20:05:56,644 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:56,648 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:56,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:56,662 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:114, output treesize:106 [2018-10-26 20:05:56,758 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:56,758 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:56,759 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:56,760 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:56,761 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:56,762 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-10-26 20:05:56,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:56,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:56,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:111, output treesize:103 [2018-10-26 20:05:56,822 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:56,823 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:56,824 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:56,829 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 93 treesize of output 103 [2018-10-26 20:05:56,831 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 14 treesize of output 7 [2018-10-26 20:05:56,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:56,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:56,861 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:05:56,863 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 52 [2018-10-26 20:05:56,865 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-10-26 20:05:56,866 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:56,870 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:56,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:56,883 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:122, output treesize:105 [2018-10-26 20:05:57,007 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:57,012 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:57,016 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:57,017 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 169 [2018-10-26 20:05:57,038 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 58 treesize of output 56 [2018-10-26 20:05:57,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:57,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:57,122 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 101 treesize of output 138 [2018-10-26 20:05:57,125 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 32 treesize of output 31 [2018-10-26 20:05:57,125 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:57,134 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:57,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 20:05:57,147 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:220, output treesize:168 [2018-10-26 20:05:57,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 96 [2018-10-26 20:05:57,366 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-10-26 20:05:57,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:57,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 20:05:57,376 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:57,381 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 27 treesize of output 19 [2018-10-26 20:05:57,382 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:57,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:57,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-26 20:05:57,398 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:187, output treesize:102 [2018-10-26 20:05:57,497 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:57,498 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:57,499 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:57,500 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:57,501 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:57,504 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:57,505 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 6 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 87 [2018-10-26 20:05:57,518 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-10-26 20:05:57,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:57,528 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-10-26 20:05:57,528 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:57,534 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-10-26 20:05:57,534 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:57,539 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-10-26 20:05:57,539 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:57,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:57,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:57,545 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:103, output treesize:4 [2018-10-26 20:05:57,584 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:57,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 20:05:57,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 40 [2018-10-26 20:05:57,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-26 20:05:57,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-26 20:05:57,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1390, Unknown=8, NotChecked=0, Total=1560 [2018-10-26 20:05:57,603 INFO L87 Difference]: Start difference. First operand 149 states and 153 transitions. Second operand 40 states. [2018-10-26 20:06:00,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:00,793 INFO L93 Difference]: Finished difference Result 312 states and 322 transitions. [2018-10-26 20:06:00,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-26 20:06:00,794 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 85 [2018-10-26 20:06:00,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:00,795 INFO L225 Difference]: With dead ends: 312 [2018-10-26 20:06:00,795 INFO L226 Difference]: Without dead ends: 310 [2018-10-26 20:06:00,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 66 SyntacticMatches, 7 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1368 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=675, Invalid=4715, Unknown=12, NotChecked=0, Total=5402 [2018-10-26 20:06:00,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-10-26 20:06:00,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 204. [2018-10-26 20:06:00,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-10-26 20:06:00,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 210 transitions. [2018-10-26 20:06:00,811 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 210 transitions. Word has length 85 [2018-10-26 20:06:00,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:00,811 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 210 transitions. [2018-10-26 20:06:00,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-26 20:06:00,811 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 210 transitions. [2018-10-26 20:06:00,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-26 20:06:00,812 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:00,812 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-26 20:06:00,813 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:00,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:00,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1712452573, now seen corresponding path program 1 times [2018-10-26 20:06:00,813 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:06:00,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:06:00,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:00,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:00,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:00,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:01,041 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-26 20:06:01,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:01,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:06:01,042 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:06:01,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:06:01,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:06:01,043 INFO L87 Difference]: Start difference. First operand 204 states and 210 transitions. Second operand 4 states. [2018-10-26 20:06:01,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:01,213 INFO L93 Difference]: Finished difference Result 234 states and 242 transitions. [2018-10-26 20:06:01,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:06:01,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-10-26 20:06:01,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:01,215 INFO L225 Difference]: With dead ends: 234 [2018-10-26 20:06:01,215 INFO L226 Difference]: Without dead ends: 219 [2018-10-26 20:06:01,215 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:06:01,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-10-26 20:06:01,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2018-10-26 20:06:01,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-26 20:06:01,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 223 transitions. [2018-10-26 20:06:01,227 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 223 transitions. Word has length 88 [2018-10-26 20:06:01,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:01,227 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 223 transitions. [2018-10-26 20:06:01,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:06:01,228 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 223 transitions. [2018-10-26 20:06:01,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-26 20:06:01,228 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:01,229 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-26 20:06:01,229 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:01,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:01,229 INFO L82 PathProgramCache]: Analyzing trace with hash 766156774, now seen corresponding path program 1 times [2018-10-26 20:06:01,235 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:06:01,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:06:01,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:01,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:01,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:02,041 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:02,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:06:02,041 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_50446dd0-2e04-492b-9caf-f701faa1838c/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-10-26 20:06:02,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:02,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:06:02,074 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-10-26 20:06:02,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:02,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:02,079 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-26 20:06:02,089 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:02,090 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:02,091 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-10-26 20:06:02,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:02,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:02,099 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-10-26 20:06:02,131 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 11 treesize of output 8 [2018-10-26 20:06:02,132 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-10-26 20:06:02,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:02,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:02,145 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 11 treesize of output 8 [2018-10-26 20:06:02,148 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-10-26 20:06:02,148 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:02,150 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:02,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:02,158 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-10-26 20:06:02,658 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-10-26 20:06:02,698 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:02,766 INFO L303 Elim1Store]: Index analysis took 107 ms [2018-10-26 20:06:02,767 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 26 treesize of output 31 [2018-10-26 20:06:02,782 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-10-26 20:06:02,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:02,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:02,919 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:02,922 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 51 treesize of output 52 [2018-10-26 20:06:02,926 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-10-26 20:06:02,927 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:02,933 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:02,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:02,944 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:69, output treesize:69 [2018-10-26 20:06:02,986 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:02,987 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:02,988 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:02,988 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-10-26 20:06:02,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:03,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:03,002 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:77, output treesize:70 [2018-10-26 20:06:03,059 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:03,061 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 53 treesize of output 61 [2018-10-26 20:06:03,065 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 27 treesize of output 34 [2018-10-26 20:06:03,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:03,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:03,086 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:03,089 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:06:03,090 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 52 treesize of output 63 [2018-10-26 20:06:03,092 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-10-26 20:06:03,093 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:03,100 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:03,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:03,109 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:89, output treesize:68 [2018-10-26 20:06:03,222 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:03,223 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:03,224 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:03,229 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 100 treesize of output 117 [2018-10-26 20:06:03,231 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-10-26 20:06:03,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:03,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:03,257 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:03,258 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:03,259 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:03,261 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:03,264 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 112 treesize of output 132 [2018-10-26 20:06:03,266 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-10-26 20:06:03,267 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:03,279 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:03,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:03,290 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:114, output treesize:118 [2018-10-26 20:06:03,337 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 49 treesize of output 34 [2018-10-26 20:06:03,340 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 34 treesize of output 33 [2018-10-26 20:06:03,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:03,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:03,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:03,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:173, output treesize:157 [2018-10-26 20:06:03,682 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:03,707 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:03,709 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:03,709 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:03,710 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:03,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 146 [2018-10-26 20:06:03,718 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 65 [2018-10-26 20:06:03,719 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-26 20:06:03,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-10-26 20:06:03,738 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:03,748 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 81 treesize of output 67 [2018-10-26 20:06:03,749 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 20:06:03,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 20:06:03,771 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 62 treesize of output 54 [2018-10-26 20:06:03,773 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-10-26 20:06:03,773 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:03,782 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 28 treesize of output 13 [2018-10-26 20:06:03,783 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:03,788 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-10-26 20:06:03,788 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:03,791 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:03,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:03,797 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:156, output treesize:13 [2018-10-26 20:06:03,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 20:06:03,870 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:06:03,871 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 9 [2018-10-26 20:06:03,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:03,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:03,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:03,875 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2018-10-26 20:06:03,941 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:03,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 20:06:03,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 24] total 45 [2018-10-26 20:06:03,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-26 20:06:03,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-26 20:06:03,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1833, Unknown=2, NotChecked=0, Total=1980 [2018-10-26 20:06:03,964 INFO L87 Difference]: Start difference. First operand 217 states and 223 transitions. Second operand 45 states. [2018-10-26 20:06:06,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:06,435 INFO L93 Difference]: Finished difference Result 236 states and 241 transitions. [2018-10-26 20:06:06,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-26 20:06:06,436 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 90 [2018-10-26 20:06:06,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:06,437 INFO L225 Difference]: With dead ends: 236 [2018-10-26 20:06:06,437 INFO L226 Difference]: Without dead ends: 234 [2018-10-26 20:06:06,440 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 72 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1102 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=600, Invalid=4800, Unknown=2, NotChecked=0, Total=5402 [2018-10-26 20:06:06,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-26 20:06:06,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 229. [2018-10-26 20:06:06,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-10-26 20:06:06,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 235 transitions. [2018-10-26 20:06:06,451 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 235 transitions. Word has length 90 [2018-10-26 20:06:06,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:06,451 INFO L481 AbstractCegarLoop]: Abstraction has 229 states and 235 transitions. [2018-10-26 20:06:06,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-26 20:06:06,451 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 235 transitions. [2018-10-26 20:06:06,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-26 20:06:06,452 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:06,452 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:06:06,453 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:06,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:06,453 INFO L82 PathProgramCache]: Analyzing trace with hash 284755828, now seen corresponding path program 1 times [2018-10-26 20:06:06,453 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:06:06,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:06:06,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:06,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:06,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:07,239 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:07,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:06:07,239 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_50446dd0-2e04-492b-9caf-f701faa1838c/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-10-26 20:06:07,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:07,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:06:07,286 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-10-26 20:06:07,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:07,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:07,290 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-26 20:06:07,299 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:07,300 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:07,301 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-10-26 20:06:07,301 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:07,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:07,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-10-26 20:06:07,317 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 11 treesize of output 8 [2018-10-26 20:06:07,326 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-10-26 20:06:07,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:07,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:07,340 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 11 treesize of output 8 [2018-10-26 20:06:07,345 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-10-26 20:06:07,345 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:07,347 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:07,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:07,356 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-10-26 20:06:07,379 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-10-26 20:06:07,381 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-10-26 20:06:07,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:07,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:07,401 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 30 treesize of output 31 [2018-10-26 20:06:07,403 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-10-26 20:06:07,403 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:07,408 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:07,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:07,419 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:57, output treesize:53 [2018-10-26 20:06:07,460 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:07,462 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:07,463 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:07,464 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 22 treesize of output 38 [2018-10-26 20:06:07,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:07,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:07,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:73 [2018-10-26 20:06:07,531 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:06:07,532 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 30 treesize of output 40 [2018-10-26 20:06:07,535 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 15 [2018-10-26 20:06:07,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:07,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:07,560 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:07,561 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2018-10-26 20:06:07,564 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 23 treesize of output 19 [2018-10-26 20:06:07,564 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:07,572 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:07,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:07,586 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:92, output treesize:71 [2018-10-26 20:06:07,716 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:07,718 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:07,719 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:07,720 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:07,725 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 95 treesize of output 111 [2018-10-26 20:06:07,727 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 15 [2018-10-26 20:06:07,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:07,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:07,760 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:07,762 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:07,767 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 56 treesize of output 81 [2018-10-26 20:06:07,769 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 23 [2018-10-26 20:06:07,769 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:07,780 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:07,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:07,796 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:129 [2018-10-26 20:06:07,851 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:07,852 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:07,853 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:07,854 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:07,855 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:07,856 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-10-26 20:06:07,857 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:07,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:07,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:141, output treesize:133 [2018-10-26 20:06:07,931 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:07,933 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:07,935 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:07,936 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:07,938 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:07,940 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:07,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 157 [2018-10-26 20:06:07,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 70 [2018-10-26 20:06:07,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:07,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:07,995 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:07,996 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:07,997 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:07,999 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:06:08,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 126 [2018-10-26 20:06:08,006 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 35 treesize of output 46 [2018-10-26 20:06:08,006 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:08,017 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:08,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:08,031 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:152, output treesize:143 [2018-10-26 20:06:08,186 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:08,188 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:08,189 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:08,191 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:08,193 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:08,198 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:08,200 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:08,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 285 treesize of output 284 [2018-10-26 20:06:08,204 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 86 treesize of output 84 [2018-10-26 20:06:08,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:08,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:08,240 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:08,241 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:08,242 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:08,244 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:08,253 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 284 [2018-10-26 20:06:08,255 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 48 treesize of output 47 [2018-10-26 20:06:08,255 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:08,272 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:08,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:08,285 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:295, output treesize:215 [2018-10-26 20:06:08,703 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:08,704 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:08,705 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:08,706 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:08,708 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:08,709 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:08,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 223 [2018-10-26 20:06:08,716 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 138 treesize of output 118 [2018-10-26 20:06:08,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:08,734 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-10-26 20:06:08,734 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:08,745 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 27 treesize of output 23 [2018-10-26 20:06:08,745 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:08,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-10-26 20:06:08,754 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:08,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:08,768 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-10-26 20:06:08,768 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:214, output treesize:70 [2018-10-26 20:06:08,815 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:08,817 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:08,817 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:08,819 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:08,820 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:08,821 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:08,822 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:08,823 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:08,824 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:08,825 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:08,826 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:08,828 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:08,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 105 [2018-10-26 20:06:08,855 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 87 [2018-10-26 20:06:08,855 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-26 20:06:08,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:08,887 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 21 treesize of output 15 [2018-10-26 20:06:08,888 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:08,893 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-10-26 20:06:08,893 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:08,898 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-10-26 20:06:08,898 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:08,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:08,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:08,904 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:71, output treesize:4 [2018-10-26 20:06:08,947 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:08,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 20:06:08,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 46 [2018-10-26 20:06:08,964 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-26 20:06:08,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-26 20:06:08,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1900, Unknown=0, NotChecked=0, Total=2070 [2018-10-26 20:06:08,965 INFO L87 Difference]: Start difference. First operand 229 states and 235 transitions. Second operand 46 states. [2018-10-26 20:06:12,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:12,063 INFO L93 Difference]: Finished difference Result 281 states and 288 transitions. [2018-10-26 20:06:12,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-26 20:06:12,065 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 91 [2018-10-26 20:06:12,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:12,066 INFO L225 Difference]: With dead ends: 281 [2018-10-26 20:06:12,066 INFO L226 Difference]: Without dead ends: 279 [2018-10-26 20:06:12,067 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 69 SyntacticMatches, 7 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1271 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=608, Invalid=5092, Unknown=0, NotChecked=0, Total=5700 [2018-10-26 20:06:12,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-10-26 20:06:12,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 252. [2018-10-26 20:06:12,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-10-26 20:06:12,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 258 transitions. [2018-10-26 20:06:12,081 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 258 transitions. Word has length 91 [2018-10-26 20:06:12,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:12,081 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 258 transitions. [2018-10-26 20:06:12,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-26 20:06:12,081 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 258 transitions. [2018-10-26 20:06:12,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-26 20:06:12,082 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:12,082 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:06:12,083 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:12,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:12,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1341878078, now seen corresponding path program 1 times [2018-10-26 20:06:12,083 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:06:12,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:06:12,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:12,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:12,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 20:06:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 20:06:12,131 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-26 20:06:12,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 08:06:12 BoogieIcfgContainer [2018-10-26 20:06:12,178 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 20:06:12,179 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 20:06:12,179 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 20:06:12,179 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 20:06:12,179 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:05:26" (3/4) ... [2018-10-26 20:06:12,186 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-26 20:06:12,239 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_50446dd0-2e04-492b-9caf-f701faa1838c/bin-2019/uautomizer/witness.graphml [2018-10-26 20:06:12,241 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 20:06:12,242 INFO L168 Benchmark]: Toolchain (without parser) took 47310.17 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 473.4 MB). Free memory was 957.0 MB in the beginning and 915.2 MB in the end (delta: 41.8 MB). Peak memory consumption was 515.2 MB. Max. memory is 11.5 GB. [2018-10-26 20:06:12,242 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 20:06:12,242 INFO L168 Benchmark]: CACSL2BoogieTranslator took 407.55 ms. Allocated memory is still 1.0 GB. Free memory was 957.0 MB in the beginning and 932.8 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-10-26 20:06:12,243 INFO L168 Benchmark]: Boogie Preprocessor took 126.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 932.8 MB in the beginning and 1.1 GB in the end (delta: -216.9 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. [2018-10-26 20:06:12,243 INFO L168 Benchmark]: RCFGBuilder took 1002.58 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: 58.4 MB). Peak memory consumption was 58.4 MB. Max. memory is 11.5 GB. [2018-10-26 20:06:12,243 INFO L168 Benchmark]: TraceAbstraction took 45707.08 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 316.7 MB). Free memory was 1.1 GB in the beginning and 915.2 MB in the end (delta: 176.1 MB). Peak memory consumption was 492.8 MB. Max. memory is 11.5 GB. [2018-10-26 20:06:12,243 INFO L168 Benchmark]: Witness Printer took 62.68 ms. Allocated memory is still 1.5 GB. Free memory is still 915.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 20:06:12,244 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 407.55 ms. Allocated memory is still 1.0 GB. Free memory was 957.0 MB in the beginning and 932.8 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 126.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 932.8 MB in the beginning and 1.1 GB in the end (delta: -216.9 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1002.58 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: 58.4 MB). Peak memory consumption was 58.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 45707.08 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 316.7 MB). Free memory was 1.1 GB in the beginning and 915.2 MB in the end (delta: 176.1 MB). Peak memory consumption was 492.8 MB. Max. memory is 11.5 GB. * Witness Printer took 62.68 ms. Allocated memory is still 1.5 GB. Free memory is still 915.2 MB. 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)) VAL [malloc(sizeof(SLL))={12:0}] [L985] SLL* head = malloc(sizeof(SLL)); VAL [head={12:0}, malloc(sizeof(SLL))={12:0}] [L986] FCALL head->next = ((void*)0) VAL [head={12:0}, malloc(sizeof(SLL))={12:0}] [L987] FCALL head->data = 0 VAL [head={12:0}, malloc(sizeof(SLL))={12:0}] [L988] SLL* item = head; [L989] int status = 0; VAL [head={12:0}, item={12:0}, malloc(sizeof(SLL))={12:0}, status=0] [L991] COND TRUE __VERIFIER_nondet_int() [L993] EXPR, FCALL malloc(sizeof(SLL)) VAL [head={12:0}, item={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={14:0}, status=0] [L993] FCALL item->next = malloc(sizeof(SLL)) VAL [head={12:0}, item={12:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={14:0}, status=0] [L994] EXPR, FCALL item->next VAL [head={12:0}, item={12:0}, item->next={14:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={14:0}, status=0] [L994] item = item->next [L995] FCALL item->next = ((void*)0) VAL [head={12:0}, item={14:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={14:0}, status=0] [L997] COND TRUE !status VAL [head={12:0}, item={14:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={14:0}, status=0] [L999] FCALL item->data = 1 VAL [head={12:0}, item={14:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={14:0}, status=0] [L1000] status = 1 VAL [head={12:0}, item={14:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={14:0}, status=1] [L1013] COND FALSE !(!(head != ((void*)0))) VAL [head={12:0}, item={14:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={14:0}, status=1] [L1013] COND FALSE !(0) VAL [head={12:0}, item={14:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={14:0}, status=1] [L1014] COND FALSE !(!(item != ((void*)0))) VAL [head={12:0}, item={14:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={14:0}, status=1] [L1014] COND FALSE !(0) VAL [head={12:0}, item={14:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={14:0}, status=1] [L991] COND TRUE __VERIFIER_nondet_int() [L993] EXPR, FCALL malloc(sizeof(SLL)) VAL [head={12:0}, item={14:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, status=1] [L993] FCALL item->next = malloc(sizeof(SLL)) VAL [head={12:0}, item={14:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, status=1] [L994] EXPR, FCALL item->next VAL [head={12:0}, item={14:0}, item->next={10:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, status=1] [L994] item = item->next [L995] FCALL item->next = ((void*)0) VAL [head={12:0}, item={10:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, status=1] [L997] COND FALSE !(!status) VAL [head={12:0}, item={10:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, status=1] [L1002] COND TRUE status == 1 VAL [head={12:0}, item={10:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, status=1] [L1004] FCALL item->data = 2 VAL [head={12:0}, item={10:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, status=1] [L1005] status = 2 VAL [head={12:0}, item={10:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, status=2] [L1013] COND FALSE !(!(head != ((void*)0))) VAL [head={12:0}, item={10:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, status=2] [L1013] COND FALSE !(0) VAL [head={12:0}, item={10:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, status=2] [L1014] COND FALSE !(!(item != ((void*)0))) VAL [head={12:0}, item={10:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, status=2] [L1014] COND FALSE !(0) VAL [head={12:0}, item={10:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={10:0}, status=2] [L991] COND TRUE __VERIFIER_nondet_int() [L993] EXPR, FCALL malloc(sizeof(SLL)) VAL [head={12:0}, item={10:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=2] [L993] FCALL item->next = malloc(sizeof(SLL)) VAL [head={12:0}, item={10:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=2] [L994] EXPR, FCALL item->next VAL [head={12:0}, item={10:0}, item->next={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=2] [L994] item = item->next [L995] FCALL item->next = ((void*)0) VAL [head={12:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=2] [L997] COND FALSE !(!status) VAL [head={12:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=2] [L1002] COND FALSE !(status == 1) VAL [head={12:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=2] [L1007] COND TRUE status >= 2 VAL [head={12:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=2] [L1009] FCALL item->data = 3 VAL [head={12:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=2] [L1010] status = 3 VAL [head={12:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1013] COND FALSE !(!(head != ((void*)0))) VAL [head={12:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1013] COND FALSE !(0) VAL [head={12:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1014] COND FALSE !(!(item != ((void*)0))) VAL [head={12:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1014] COND FALSE !(0) VAL [head={12:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L991] COND FALSE !(__VERIFIER_nondet_int()) [L1017] COND FALSE !(!(head != ((void*)0))) VAL [head={12:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1017] COND FALSE !(0) VAL [head={12:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1018] COND FALSE !(status == 1) VAL [head={12:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1023] COND FALSE !(status == 2) VAL [head={12:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1029] COND TRUE status == 3 VAL [head={12:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1031] COND FALSE !(!(head != ((void*)0))) VAL [head={12:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1031] COND FALSE !(0) VAL [head={12:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1032] EXPR, FCALL head->next VAL [head={12:0}, head->next={14:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1032] COND FALSE !(!(head->next != ((void*)0))) [L1032] COND FALSE !(0) VAL [head={12:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1033] EXPR, FCALL head->next VAL [head={12:0}, head->next={14:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1033] EXPR, FCALL head->next->next VAL [head={12:0}, head->next={14:0}, head->next->next={10:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1033] COND FALSE !(!(head->next->next != ((void*)0))) [L1033] COND FALSE !(0) VAL [head={12:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1034] EXPR, FCALL head->next VAL [head={12:0}, head->next={14:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1034] EXPR, FCALL head->next->next VAL [head={12:0}, head->next={14:0}, head->next->next={10:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1034] EXPR, FCALL head->next->next->next VAL [head={12:0}, head->next={14:0}, head->next->next={10:0}, head->next->next->next={11:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1034] COND FALSE !(!(head->next->next->next != ((void*)0))) [L1034] COND FALSE !(0) VAL [head={12:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1035] EXPR, FCALL head->next VAL [head={12:0}, head->next={14:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1035] EXPR, FCALL head->next->next VAL [head={12:0}, head->next={14:0}, head->next->next={10:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1035] EXPR, FCALL head->next->next->next VAL [head={12:0}, head->next={14:0}, head->next->next={10:0}, head->next->next->next={11:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1035] EXPR, FCALL head->next->next->next->data VAL [head={12:0}, head->next={14:0}, head->next->next={10:0}, head->next->next->next={11:0}, head->next->next->next->data=3, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] [L1035] COND TRUE !(head->next->next->next->data != 3) [L1035] __VERIFIER_error() VAL [head={12:0}, item={11:0}, malloc(sizeof(SLL))={12:0}, malloc(sizeof(SLL))={11:0}, status=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 135 locations, 14 error locations. UNSAFE Result, 45.6s OverallTime, 22 OverallIterations, 4 TraceHistogramMax, 24.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2443 SDtfs, 8898 SDslu, 20500 SDs, 0 SdLazy, 12428 SolverSat, 1010 SolverUnsat, 132 SolverUnknown, 0 SolverNotchecked, 9.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1233 GetRequests, 589 SyntacticMatches, 43 SemanticMatches, 601 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8010 ImplicationChecksByTransitivity, 25.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=305occurred 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.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 682 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 19.3s InterpolantComputationTime, 2017 NumberOfCodeBlocks, 2017 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1888 ConstructedInterpolants, 214 QuantifiedInterpolants, 5445124 SizeOfPredicates, 181 NumberOfNonLiveVariables, 1636 ConjunctsInSsa, 499 ConjunctsInUnsatCore, 31 InterpolantComputations, 11 PerfectInterpolantSequences, 132/672 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...