./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.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_fa5e1787-5b68-48aa-ac6e-2a035d08e498/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fa5e1787-5b68-48aa-ac6e-2a035d08e498/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fa5e1787-5b68-48aa-ac6e-2a035d08e498/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fa5e1787-5b68-48aa-ac6e-2a035d08e498/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_fa5e1787-5b68-48aa-ac6e-2a035d08e498/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fa5e1787-5b68-48aa-ac6e-2a035d08e498/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 b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 19:24:18,560 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 19:24:18,562 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 19:24:18,572 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 19:24:18,573 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 19:24:18,574 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 19:24:18,576 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 19:24:18,578 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 19:24:18,579 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 19:24:18,580 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 19:24:18,583 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 19:24:18,583 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 19:24:18,584 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 19:24:18,586 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 19:24:18,592 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 19:24:18,593 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 19:24:18,594 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 19:24:18,595 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 19:24:18,596 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 19:24:18,597 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 19:24:18,600 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 19:24:18,601 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 19:24:18,602 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 19:24:18,602 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 19:24:18,602 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 19:24:18,603 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 19:24:18,609 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 19:24:18,610 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 19:24:18,612 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 19:24:18,613 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 19:24:18,615 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 19:24:18,615 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 19:24:18,616 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 19:24:18,616 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 19:24:18,616 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 19:24:18,617 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 19:24:18,617 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fa5e1787-5b68-48aa-ac6e-2a035d08e498/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-26 19:24:18,637 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 19:24:18,639 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 19:24:18,639 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 19:24:18,639 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 19:24:18,640 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 19:24:18,640 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 19:24:18,640 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 19:24:18,640 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 19:24:18,640 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 19:24:18,641 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 19:24:18,641 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 19:24:18,641 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 19:24:18,641 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 19:24:18,641 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 19:24:18,641 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 19:24:18,641 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 19:24:18,642 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 19:24:18,642 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 19:24:18,642 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 19:24:18,642 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 19:24:18,642 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 19:24:18,642 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 19:24:18,642 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:24:18,643 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 19:24:18,643 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 19:24:18,643 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 19:24:18,643 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 19:24:18,643 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 19:24:18,643 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 19:24:18,643 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_fa5e1787-5b68-48aa-ac6e-2a035d08e498/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 -> b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 [2018-10-26 19:24:18,685 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 19:24:18,696 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 19:24:18,700 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 19:24:18,702 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 19:24:18,703 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 19:24:18,703 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fa5e1787-5b68-48aa-ac6e-2a035d08e498/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-10-26 19:24:18,749 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fa5e1787-5b68-48aa-ac6e-2a035d08e498/bin-2019/uautomizer/data/424191272/37cfa868f5da4c7593ef0025cc55328f/FLAG837376944 [2018-10-26 19:24:19,165 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 19:24:19,165 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fa5e1787-5b68-48aa-ac6e-2a035d08e498/sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-10-26 19:24:19,176 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fa5e1787-5b68-48aa-ac6e-2a035d08e498/bin-2019/uautomizer/data/424191272/37cfa868f5da4c7593ef0025cc55328f/FLAG837376944 [2018-10-26 19:24:19,187 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fa5e1787-5b68-48aa-ac6e-2a035d08e498/bin-2019/uautomizer/data/424191272/37cfa868f5da4c7593ef0025cc55328f [2018-10-26 19:24:19,189 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 19:24:19,190 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 19:24:19,190 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 19:24:19,190 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 19:24:19,193 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 19:24:19,193 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:24:19" (1/1) ... [2018-10-26 19:24:19,195 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@625bd11a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:24:19, skipping insertion in model container [2018-10-26 19:24:19,195 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:24:19" (1/1) ... [2018-10-26 19:24:19,202 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 19:24:19,241 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 19:24:19,466 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:24:19,474 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 19:24:19,509 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:24:19,555 INFO L193 MainTranslator]: Completed translation [2018-10-26 19:24:19,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:24:19 WrapperNode [2018-10-26 19:24:19,556 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 19:24:19,556 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 19:24:19,556 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 19:24:19,556 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 19:24:19,569 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:24:19" (1/1) ... [2018-10-26 19:24:19,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:24:19" (1/1) ... [2018-10-26 19:24:19,581 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:24:19" (1/1) ... [2018-10-26 19:24:19,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:24:19" (1/1) ... [2018-10-26 19:24:19,651 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:24:19" (1/1) ... [2018-10-26 19:24:19,657 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:24:19" (1/1) ... [2018-10-26 19:24:19,660 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:24:19" (1/1) ... [2018-10-26 19:24:19,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 19:24:19,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 19:24:19,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 19:24:19,665 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 19:24:19,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:24:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa5e1787-5b68-48aa-ac6e-2a035d08e498/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 19:24:19,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 19:24:19,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 19:24:19,718 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 19:24:19,718 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-10-26 19:24:19,718 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-10-26 19:24:19,718 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-10-26 19:24:19,718 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-10-26 19:24:19,718 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-10-26 19:24:19,718 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-10-26 19:24:19,718 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-10-26 19:24:19,719 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-10-26 19:24:19,719 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-10-26 19:24:19,719 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-10-26 19:24:19,719 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-10-26 19:24:19,719 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-10-26 19:24:19,719 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-10-26 19:24:19,719 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-10-26 19:24:19,719 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-10-26 19:24:19,719 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-10-26 19:24:19,720 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-10-26 19:24:19,720 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-10-26 19:24:19,720 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-10-26 19:24:19,720 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-10-26 19:24:19,720 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-10-26 19:24:19,720 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-10-26 19:24:19,720 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-10-26 19:24:19,720 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-10-26 19:24:19,720 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-10-26 19:24:19,721 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-10-26 19:24:19,721 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-10-26 19:24:19,721 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-10-26 19:24:19,721 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-10-26 19:24:19,721 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-10-26 19:24:19,721 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-10-26 19:24:19,721 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-10-26 19:24:19,721 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-10-26 19:24:19,721 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-10-26 19:24:19,721 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-10-26 19:24:19,722 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-10-26 19:24:19,722 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-10-26 19:24:19,722 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-10-26 19:24:19,722 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-10-26 19:24:19,722 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-10-26 19:24:19,722 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-10-26 19:24:19,722 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-10-26 19:24:19,722 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-10-26 19:24:19,722 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-10-26 19:24:19,722 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-10-26 19:24:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-10-26 19:24:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-10-26 19:24:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-10-26 19:24:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-10-26 19:24:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-10-26 19:24:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-10-26 19:24:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-10-26 19:24:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-10-26 19:24:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-10-26 19:24:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-10-26 19:24:19,724 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-10-26 19:24:19,724 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-10-26 19:24:19,724 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-10-26 19:24:19,724 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-10-26 19:24:19,724 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-10-26 19:24:19,724 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-10-26 19:24:19,724 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-10-26 19:24:19,724 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-10-26 19:24:19,724 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 19:24:19,724 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-10-26 19:24:19,724 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-10-26 19:24:19,725 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-10-26 19:24:19,725 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-10-26 19:24:19,725 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-10-26 19:24:19,725 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-10-26 19:24:19,725 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-10-26 19:24:19,725 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-10-26 19:24:19,725 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-10-26 19:24:19,725 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-10-26 19:24:19,725 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-10-26 19:24:19,725 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-10-26 19:24:19,726 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-10-26 19:24:19,726 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-10-26 19:24:19,726 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-10-26 19:24:19,726 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-10-26 19:24:19,726 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-10-26 19:24:19,726 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-10-26 19:24:19,726 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-10-26 19:24:19,726 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-10-26 19:24:19,726 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-10-26 19:24:19,726 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-10-26 19:24:19,726 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-10-26 19:24:19,727 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-10-26 19:24:19,727 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-10-26 19:24:19,727 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-10-26 19:24:19,727 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-10-26 19:24:19,727 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-10-26 19:24:19,727 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-10-26 19:24:19,727 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-10-26 19:24:19,727 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-10-26 19:24:19,727 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-10-26 19:24:19,727 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-10-26 19:24:19,728 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-10-26 19:24:19,728 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-10-26 19:24:19,728 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-10-26 19:24:19,728 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-10-26 19:24:19,728 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-10-26 19:24:19,728 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-10-26 19:24:19,728 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-10-26 19:24:19,728 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-10-26 19:24:19,728 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 19:24:19,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-10-26 19:24:19,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-10-26 19:24:19,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-26 19:24:19,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-10-26 19:24:19,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-26 19:24:19,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-10-26 19:24:19,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 19:24:19,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 19:24:19,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-10-26 19:24:20,587 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 19:24:20,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:24:20 BoogieIcfgContainer [2018-10-26 19:24:20,587 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 19:24:20,588 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 19:24:20,588 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 19:24:20,590 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 19:24:20,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 07:24:19" (1/3) ... [2018-10-26 19:24:20,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c84be24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:24:20, skipping insertion in model container [2018-10-26 19:24:20,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:24:19" (2/3) ... [2018-10-26 19:24:20,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c84be24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:24:20, skipping insertion in model container [2018-10-26 19:24:20,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:24:20" (3/3) ... [2018-10-26 19:24:20,593 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-10-26 19:24:20,600 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 19:24:20,607 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-10-26 19:24:20,620 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2018-10-26 19:24:20,646 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 19:24:20,646 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 19:24:20,646 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 19:24:20,647 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 19:24:20,647 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 19:24:20,647 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 19:24:20,647 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 19:24:20,647 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 19:24:20,647 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 19:24:20,663 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2018-10-26 19:24:20,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-26 19:24:20,668 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:24:20,669 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] [2018-10-26 19:24:20,671 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:24:20,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:24:20,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1293338631, now seen corresponding path program 1 times [2018-10-26 19:24:20,677 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:24:20,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:24:20,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:24:20,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:24:20,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:24:20,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:24:20,804 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 19:24:20,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:24:20,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 19:24:20,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-26 19:24:20,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-26 19:24:20,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 19:24:20,822 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 2 states. [2018-10-26 19:24:20,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:24:20,845 INFO L93 Difference]: Finished difference Result 198 states and 256 transitions. [2018-10-26 19:24:20,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-26 19:24:20,847 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-10-26 19:24:20,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:24:20,854 INFO L225 Difference]: With dead ends: 198 [2018-10-26 19:24:20,855 INFO L226 Difference]: Without dead ends: 88 [2018-10-26 19:24:20,857 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 19:24:20,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-10-26 19:24:20,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-10-26 19:24:20,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-26 19:24:20,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2018-10-26 19:24:20,890 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 21 [2018-10-26 19:24:20,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:24:20,891 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2018-10-26 19:24:20,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-26 19:24:20,891 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2018-10-26 19:24:20,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-26 19:24:20,891 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:24:20,892 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] [2018-10-26 19:24:20,892 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:24:20,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:24:20,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1347792492, now seen corresponding path program 1 times [2018-10-26 19:24:20,892 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:24:20,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:24:20,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:24:20,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:24:20,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:24:20,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:24:21,186 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 19:24:21,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:24:21,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 19:24:21,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 19:24:21,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 19:24:21,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-26 19:24:21,188 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand 7 states. [2018-10-26 19:24:21,633 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-26 19:24:21,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:24:21,816 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2018-10-26 19:24:21,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 19:24:21,818 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-10-26 19:24:21,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:24:21,819 INFO L225 Difference]: With dead ends: 107 [2018-10-26 19:24:21,819 INFO L226 Difference]: Without dead ends: 105 [2018-10-26 19:24:21,820 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-10-26 19:24:21,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-10-26 19:24:21,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 86. [2018-10-26 19:24:21,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-10-26 19:24:21,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2018-10-26 19:24:21,828 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 23 [2018-10-26 19:24:21,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:24:21,828 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2018-10-26 19:24:21,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 19:24:21,828 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2018-10-26 19:24:21,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 19:24:21,829 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:24:21,829 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 19:24:21,830 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:24:21,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:24:21,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1086976655, now seen corresponding path program 1 times [2018-10-26 19:24:21,830 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:24:21,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:24:21,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:24:21,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:24:21,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:24:21,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:24:22,152 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 19:24:22,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:24:22,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-26 19:24:22,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-26 19:24:22,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-26 19:24:22,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-10-26 19:24:22,153 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand 10 states. [2018-10-26 19:24:22,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:24:22,647 INFO L93 Difference]: Finished difference Result 166 states and 174 transitions. [2018-10-26 19:24:22,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-26 19:24:22,648 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-10-26 19:24:22,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:24:22,649 INFO L225 Difference]: With dead ends: 166 [2018-10-26 19:24:22,649 INFO L226 Difference]: Without dead ends: 164 [2018-10-26 19:24:22,650 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2018-10-26 19:24:22,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-10-26 19:24:22,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 118. [2018-10-26 19:24:22,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-26 19:24:22,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-10-26 19:24:22,660 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 27 [2018-10-26 19:24:22,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:24:22,661 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-10-26 19:24:22,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-26 19:24:22,661 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-10-26 19:24:22,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-26 19:24:22,662 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:24:22,662 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:24:22,662 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:24:22,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:24:22,663 INFO L82 PathProgramCache]: Analyzing trace with hash 2127889302, now seen corresponding path program 1 times [2018-10-26 19:24:22,663 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:24:22,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:24:22,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:24:22,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:24:22,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:24:22,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:24:22,720 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 19:24:22,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:24:22,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:24:22,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:24:22,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:24:22,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:24:22,721 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 4 states. [2018-10-26 19:24:22,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:24:22,780 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2018-10-26 19:24:22,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:24:22,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-10-26 19:24:22,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:24:22,786 INFO L225 Difference]: With dead ends: 129 [2018-10-26 19:24:22,786 INFO L226 Difference]: Without dead ends: 127 [2018-10-26 19:24:22,786 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:24:22,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-26 19:24:22,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 116. [2018-10-26 19:24:22,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-10-26 19:24:22,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2018-10-26 19:24:22,795 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 34 [2018-10-26 19:24:22,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:24:22,795 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2018-10-26 19:24:22,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:24:22,796 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2018-10-26 19:24:22,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-26 19:24:22,796 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:24:22,796 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:24:22,797 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:24:22,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:24:22,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1158131534, now seen corresponding path program 1 times [2018-10-26 19:24:22,797 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:24:22,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:24:22,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:24:22,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:24:22,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:24:22,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:24:22,992 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 19:24:22,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:24:22,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 19:24:22,992 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 19:24:22,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 19:24:22,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:24:22,993 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 5 states. [2018-10-26 19:24:23,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:24:23,086 INFO L93 Difference]: Finished difference Result 152 states and 162 transitions. [2018-10-26 19:24:23,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 19:24:23,087 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-10-26 19:24:23,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:24:23,087 INFO L225 Difference]: With dead ends: 152 [2018-10-26 19:24:23,087 INFO L226 Difference]: Without dead ends: 133 [2018-10-26 19:24:23,088 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 19:24:23,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-26 19:24:23,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 120. [2018-10-26 19:24:23,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-10-26 19:24:23,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 127 transitions. [2018-10-26 19:24:23,095 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 127 transitions. Word has length 36 [2018-10-26 19:24:23,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:24:23,095 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 127 transitions. [2018-10-26 19:24:23,095 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 19:24:23,096 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2018-10-26 19:24:23,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-26 19:24:23,096 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:24:23,097 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:24:23,097 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:24:23,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:24:23,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1177888219, now seen corresponding path program 1 times [2018-10-26 19:24:23,097 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:24:23,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:24:23,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:24:23,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:24:23,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:24:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:24:23,167 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 19:24:23,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:24:23,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:24:23,168 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:24:23,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:24:23,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:24:23,168 INFO L87 Difference]: Start difference. First operand 120 states and 127 transitions. Second operand 4 states. [2018-10-26 19:24:23,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:24:23,238 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2018-10-26 19:24:23,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:24:23,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-10-26 19:24:23,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:24:23,243 INFO L225 Difference]: With dead ends: 126 [2018-10-26 19:24:23,243 INFO L226 Difference]: Without dead ends: 124 [2018-10-26 19:24:23,243 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:24:23,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-10-26 19:24:23,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 118. [2018-10-26 19:24:23,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-26 19:24:23,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 124 transitions. [2018-10-26 19:24:23,254 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 124 transitions. Word has length 38 [2018-10-26 19:24:23,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:24:23,254 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 124 transitions. [2018-10-26 19:24:23,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:24:23,254 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2018-10-26 19:24:23,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-26 19:24:23,255 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:24:23,255 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:24:23,256 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:24:23,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:24:23,256 INFO L82 PathProgramCache]: Analyzing trace with hash 589117983, now seen corresponding path program 1 times [2018-10-26 19:24:23,256 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:24:23,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:24:23,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:24:23,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:24:23,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:24:23,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:24:23,457 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 19:24:23,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:24:23,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-10-26 19:24:23,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-26 19:24:23,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-26 19:24:23,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-10-26 19:24:23,458 INFO L87 Difference]: Start difference. First operand 118 states and 124 transitions. Second operand 13 states. [2018-10-26 19:24:23,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:24:23,955 INFO L93 Difference]: Finished difference Result 167 states and 176 transitions. [2018-10-26 19:24:23,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-26 19:24:23,958 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2018-10-26 19:24:23,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:24:23,959 INFO L225 Difference]: With dead ends: 167 [2018-10-26 19:24:23,959 INFO L226 Difference]: Without dead ends: 165 [2018-10-26 19:24:23,959 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2018-10-26 19:24:23,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-10-26 19:24:23,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 142. [2018-10-26 19:24:23,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-10-26 19:24:23,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 150 transitions. [2018-10-26 19:24:23,966 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 150 transitions. Word has length 41 [2018-10-26 19:24:23,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:24:23,966 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 150 transitions. [2018-10-26 19:24:23,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-26 19:24:23,967 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 150 transitions. [2018-10-26 19:24:23,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-26 19:24:23,967 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:24:23,968 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:24:23,968 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:24:23,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:24:23,968 INFO L82 PathProgramCache]: Analyzing trace with hash -55747688, now seen corresponding path program 1 times [2018-10-26 19:24:23,968 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:24:23,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:24:23,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:24:23,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:24:23,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:24:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:24:24,088 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:24:24,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:24:24,088 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa5e1787-5b68-48aa-ac6e-2a035d08e498/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 19:24:24,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:24:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:24:24,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:24:24,223 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 19:24:24,226 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 19:24:24,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:24,229 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:24,242 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 19:24:24,250 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 19:24:24,250 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:24,254 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:24,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:24,260 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-10-26 19:24:24,268 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 21 treesize of output 16 [2018-10-26 19:24:24,272 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:24,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-26 19:24:24,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:24,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:24,286 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 21 treesize of output 16 [2018-10-26 19:24:24,290 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:24,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-26 19:24:24,291 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:24,324 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:24,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:24,336 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-10-26 19:24:24,382 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 24 treesize of output 18 [2018-10-26 19:24:24,388 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:24,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-26 19:24:24,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:24,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:24,405 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 24 treesize of output 18 [2018-10-26 19:24:24,408 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:24,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-10-26 19:24:24,409 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:24,411 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:24,415 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 19:24:24,415 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2018-10-26 19:24:24,427 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:24:24,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:24:24,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2018-10-26 19:24:24,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 19:24:24,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 19:24:24,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-26 19:24:24,448 INFO L87 Difference]: Start difference. First operand 142 states and 150 transitions. Second operand 8 states. [2018-10-26 19:24:24,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:24:24,861 INFO L93 Difference]: Finished difference Result 177 states and 186 transitions. [2018-10-26 19:24:24,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-26 19:24:24,861 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-10-26 19:24:24,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:24:24,862 INFO L225 Difference]: With dead ends: 177 [2018-10-26 19:24:24,862 INFO L226 Difference]: Without dead ends: 142 [2018-10-26 19:24:24,862 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-10-26 19:24:24,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-10-26 19:24:24,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-10-26 19:24:24,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-10-26 19:24:24,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 149 transitions. [2018-10-26 19:24:24,866 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 149 transitions. Word has length 42 [2018-10-26 19:24:24,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:24:24,867 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 149 transitions. [2018-10-26 19:24:24,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 19:24:24,867 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 149 transitions. [2018-10-26 19:24:24,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-26 19:24:24,868 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:24:24,868 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:24:24,868 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:24:24,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:24:24,869 INFO L82 PathProgramCache]: Analyzing trace with hash -734620293, now seen corresponding path program 1 times [2018-10-26 19:24:24,869 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:24:24,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:24:24,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:24:24,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:24:24,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:24:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:24:25,222 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 19:24:25,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:24:25,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-10-26 19:24:25,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-26 19:24:25,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-26 19:24:25,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-10-26 19:24:25,223 INFO L87 Difference]: Start difference. First operand 142 states and 149 transitions. Second operand 18 states. [2018-10-26 19:24:26,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:24:26,691 INFO L93 Difference]: Finished difference Result 178 states and 186 transitions. [2018-10-26 19:24:26,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-26 19:24:26,692 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 50 [2018-10-26 19:24:26,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:24:26,693 INFO L225 Difference]: With dead ends: 178 [2018-10-26 19:24:26,693 INFO L226 Difference]: Without dead ends: 176 [2018-10-26 19:24:26,693 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=354, Invalid=1128, Unknown=0, NotChecked=0, Total=1482 [2018-10-26 19:24:26,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-10-26 19:24:26,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 162. [2018-10-26 19:24:26,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-10-26 19:24:26,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 169 transitions. [2018-10-26 19:24:26,700 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 169 transitions. Word has length 50 [2018-10-26 19:24:26,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:24:26,700 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 169 transitions. [2018-10-26 19:24:26,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-26 19:24:26,700 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 169 transitions. [2018-10-26 19:24:26,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-26 19:24:26,701 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:24:26,702 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, 1, 1, 1, 1, 1, 1] [2018-10-26 19:24:26,702 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:24:26,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:24:26,702 INFO L82 PathProgramCache]: Analyzing trace with hash 2123776255, now seen corresponding path program 1 times [2018-10-26 19:24:26,702 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:24:26,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:24:26,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:24:26,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:24:26,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:24:26,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:24:27,763 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 19:24:27,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:24:27,764 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa5e1787-5b68-48aa-ac6e-2a035d08e498/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 19:24:27,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:24:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:24:27,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:24:27,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-26 19:24:27,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:27,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:27,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-26 19:24:27,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 19:24:27,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 19:24:27,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:27,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:27,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:27,894 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-10-26 19:24:27,920 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:27,921 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:27,921 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 19:24:27,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:27,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:27,925 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-10-26 19:24:27,945 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 19:24:27,947 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 19:24:27,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:27,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:27,956 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 19:24:27,956 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-10-26 19:24:27,993 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 30 treesize of output 34 [2018-10-26 19:24:27,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 14 treesize of output 13 [2018-10-26 19:24:27,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:27,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:28,004 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 19:24:28,004 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-10-26 19:24:28,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 29 treesize of output 19 [2018-10-26 19:24:28,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-10-26 19:24:28,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:28,088 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 19:24:28,088 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:28,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:28,110 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 19:24:28,110 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:14 [2018-10-26 19:24:28,227 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 23 treesize of output 24 [2018-10-26 19:24:28,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 19:24:28,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:28,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:28,250 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 19:24:28,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:23 [2018-10-26 19:24:28,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 63 [2018-10-26 19:24:28,315 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 38 treesize of output 39 [2018-10-26 19:24:28,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:28,395 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 29 treesize of output 28 [2018-10-26 19:24:28,395 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:28,418 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:28,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 43 [2018-10-26 19:24:28,424 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-26 19:24:28,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:24:28,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-10-26 19:24:28,483 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:36, output treesize:56 [2018-10-26 19:24:28,686 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 32 treesize of output 30 [2018-10-26 19:24:28,697 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 19:24:28,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:28,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 19:24:28,710 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:28,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:28,722 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 32 treesize of output 26 [2018-10-26 19:24:28,724 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 19:24:28,724 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:28,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 19:24:28,729 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:28,731 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:28,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:28,737 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:65, output treesize:3 [2018-10-26 19:24:28,762 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 19:24:28,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:24:28,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 16] total 37 [2018-10-26 19:24:28,778 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-26 19:24:28,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-26 19:24:28,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1166, Unknown=0, NotChecked=0, Total=1332 [2018-10-26 19:24:28,779 INFO L87 Difference]: Start difference. First operand 162 states and 169 transitions. Second operand 37 states. [2018-10-26 19:24:30,791 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2018-10-26 19:24:30,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:24:30,881 INFO L93 Difference]: Finished difference Result 269 states and 281 transitions. [2018-10-26 19:24:30,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-26 19:24:30,881 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 61 [2018-10-26 19:24:30,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:24:30,883 INFO L225 Difference]: With dead ends: 269 [2018-10-26 19:24:30,883 INFO L226 Difference]: Without dead ends: 267 [2018-10-26 19:24:30,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=714, Invalid=3068, Unknown=0, NotChecked=0, Total=3782 [2018-10-26 19:24:30,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-10-26 19:24:30,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 207. [2018-10-26 19:24:30,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-26 19:24:30,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 217 transitions. [2018-10-26 19:24:30,891 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 217 transitions. Word has length 61 [2018-10-26 19:24:30,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:24:30,892 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 217 transitions. [2018-10-26 19:24:30,892 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-26 19:24:30,892 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 217 transitions. [2018-10-26 19:24:30,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-26 19:24:30,893 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:24:30,893 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:24:30,893 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:24:30,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:24:30,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1867499255, now seen corresponding path program 1 times [2018-10-26 19:24:30,894 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:24:30,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:24:30,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:24:30,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:24:30,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:24:30,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:24:31,695 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:24:31,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:24:31,696 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa5e1787-5b68-48aa-ac6e-2a035d08e498/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 19:24:31,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:24:31,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:24:31,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:24:31,740 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 19:24:31,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:31,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:31,742 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-26 19:24:31,787 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:31,788 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:31,789 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 19:24:31,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:31,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:31,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-10-26 19:24:31,854 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:31,855 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:31,856 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:31,856 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 34 [2018-10-26 19:24:31,857 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:31,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:31,863 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:28 [2018-10-26 19:24:31,888 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 11 treesize of output 8 [2018-10-26 19:24:31,889 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 19:24:31,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:31,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:31,898 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 19:24:31,898 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:40 [2018-10-26 19:24:32,049 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 47 treesize of output 43 [2018-10-26 19:24:32,066 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 14 treesize of output 13 [2018-10-26 19:24:32,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:32,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:32,189 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 19:24:32,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:53 [2018-10-26 19:24:32,261 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 46 treesize of output 32 [2018-10-26 19:24:32,284 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 25 treesize of output 14 [2018-10-26 19:24:32,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:32,290 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 19:24:32,291 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:32,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:32,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 19:24:32,300 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:60, output treesize:28 [2018-10-26 19:24:32,366 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:32,366 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:32,367 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:32,368 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:32,369 INFO L477 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-10-26 19:24:32,369 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:32,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:32,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:13 [2018-10-26 19:24:32,396 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 11 treesize of output 8 [2018-10-26 19:24:32,397 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 19:24:32,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:32,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:32,403 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 19:24:32,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2018-10-26 19:24:32,448 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 38 treesize of output 34 [2018-10-26 19:24:32,451 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 14 treesize of output 13 [2018-10-26 19:24:32,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:32,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:32,461 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 19:24:32,462 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-10-26 19:24:32,515 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 37 treesize of output 25 [2018-10-26 19:24:32,518 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 19:24:32,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:32,523 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 19:24:32,523 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:32,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:32,528 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 19:24:32,528 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:4 [2018-10-26 19:24:32,547 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:24:32,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:24:32,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 35 [2018-10-26 19:24:32,564 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-26 19:24:32,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-26 19:24:32,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1047, Unknown=0, NotChecked=0, Total=1190 [2018-10-26 19:24:32,564 INFO L87 Difference]: Start difference. First operand 207 states and 217 transitions. Second operand 35 states. [2018-10-26 19:24:34,028 WARN L179 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2018-10-26 19:24:34,224 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2018-10-26 19:24:34,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:24:34,742 INFO L93 Difference]: Finished difference Result 225 states and 234 transitions. [2018-10-26 19:24:34,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-26 19:24:34,743 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 66 [2018-10-26 19:24:34,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:24:34,743 INFO L225 Difference]: With dead ends: 225 [2018-10-26 19:24:34,744 INFO L226 Difference]: Without dead ends: 223 [2018-10-26 19:24:34,744 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=771, Invalid=2421, Unknown=0, NotChecked=0, Total=3192 [2018-10-26 19:24:34,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-10-26 19:24:34,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 196. [2018-10-26 19:24:34,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-10-26 19:24:34,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 205 transitions. [2018-10-26 19:24:34,752 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 205 transitions. Word has length 66 [2018-10-26 19:24:34,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:24:34,752 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 205 transitions. [2018-10-26 19:24:34,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-26 19:24:34,752 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 205 transitions. [2018-10-26 19:24:34,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-26 19:24:34,753 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:24:34,753 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:24:34,753 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:24:34,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:24:34,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1098529262, now seen corresponding path program 1 times [2018-10-26 19:24:34,754 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:24:34,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:24:34,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:24:34,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:24:34,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:24:34,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:24:35,150 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-26 19:24:36,070 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:24:36,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:24:36,070 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa5e1787-5b68-48aa-ac6e-2a035d08e498/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 19:24:36,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:24:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:24:36,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:24:36,196 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 19:24:36,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:36,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:36,207 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-26 19:24:36,270 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:36,271 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:36,271 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 19:24:36,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:36,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:36,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-10-26 19:24:36,311 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 19:24:36,313 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 19:24:36,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:36,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:36,323 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 19:24:36,324 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 19:24:36,324 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:36,325 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:36,331 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 19:24:36,332 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2018-10-26 19:24:36,389 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:36,393 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 51 treesize of output 55 [2018-10-26 19:24:36,414 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 19:24:36,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:36,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:36,442 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:36,444 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 29 treesize of output 30 [2018-10-26 19:24:36,448 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 19:24:36,449 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:36,452 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:36,541 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 19:24:36,541 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:51 [2018-10-26 19:24:36,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 48 [2018-10-26 19:24:36,731 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 2 case distinctions, treesize of input 16 treesize of output 31 [2018-10-26 19:24:36,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-26 19:24:36,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:24:36,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 73 [2018-10-26 19:24:36,778 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:24:36,779 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 20 treesize of output 21 [2018-10-26 19:24:36,779 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:36,793 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:36,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 91 [2018-10-26 19:24:36,808 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 2 case distinctions, treesize of input 20 treesize of output 51 [2018-10-26 19:24:36,809 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-26 19:24:36,825 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:24:36,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-10-26 19:24:36,853 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:78, output treesize:131 [2018-10-26 19:24:36,896 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 19:24:36,898 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 19:24:36,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:36,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:36,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:36,906 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:48 [2018-10-26 19:24:37,286 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 48 treesize of output 40 [2018-10-26 19:24:37,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 19:24:37,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:37,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:37,614 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 19:24:37,630 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 19:24:37,630 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:37,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 5 treesize of output 3 [2018-10-26 19:24:37,734 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:37,738 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:37,742 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 19:24:37,742 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:62, output treesize:13 [2018-10-26 19:24:37,987 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 19:24:37,988 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 19:24:37,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:37,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:37,990 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 19:24:37,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-10-26 19:24:38,017 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:24:38,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:24:38,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 19] total 43 [2018-10-26 19:24:38,044 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-26 19:24:38,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-26 19:24:38,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1624, Unknown=0, NotChecked=0, Total=1806 [2018-10-26 19:24:38,045 INFO L87 Difference]: Start difference. First operand 196 states and 205 transitions. Second operand 43 states. [2018-10-26 19:24:40,054 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2018-10-26 19:24:41,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:24:41,381 INFO L93 Difference]: Finished difference Result 338 states and 355 transitions. [2018-10-26 19:24:41,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-26 19:24:41,385 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 67 [2018-10-26 19:24:41,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:24:41,386 INFO L225 Difference]: With dead ends: 338 [2018-10-26 19:24:41,386 INFO L226 Difference]: Without dead ends: 319 [2018-10-26 19:24:41,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1459 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1068, Invalid=5574, Unknown=0, NotChecked=0, Total=6642 [2018-10-26 19:24:41,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-10-26 19:24:41,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 250. [2018-10-26 19:24:41,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-10-26 19:24:41,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 262 transitions. [2018-10-26 19:24:41,397 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 262 transitions. Word has length 67 [2018-10-26 19:24:41,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:24:41,399 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 262 transitions. [2018-10-26 19:24:41,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-26 19:24:41,399 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 262 transitions. [2018-10-26 19:24:41,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-26 19:24:41,401 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:24:41,401 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:24:41,402 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:24:41,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:24:41,402 INFO L82 PathProgramCache]: Analyzing trace with hash -2022347208, now seen corresponding path program 2 times [2018-10-26 19:24:41,402 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:24:41,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:24:41,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:24:41,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:24:41,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:24:41,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:24:41,898 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-26 19:24:42,126 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-26 19:24:42,513 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:24:42,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:24:42,513 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa5e1787-5b68-48aa-ac6e-2a035d08e498/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 19:24:42,521 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-26 19:24:42,545 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-26 19:24:42,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 19:24:42,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:24:42,574 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 19:24:42,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:42,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:42,578 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-10-26 19:24:42,631 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:42,632 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:42,632 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 19:24:42,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:42,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:42,638 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2018-10-26 19:24:42,660 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 19:24:42,662 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 19:24:42,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:42,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:42,673 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 19:24:42,674 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 19:24:42,674 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:42,676 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:42,683 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 19:24:42,683 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:28 [2018-10-26 19:24:42,741 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:42,744 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 29 treesize of output 30 [2018-10-26 19:24:42,762 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 19:24:42,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:42,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:43,083 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:43,086 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 43 treesize of output 47 [2018-10-26 19:24:43,089 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 19:24:43,089 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:43,095 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:43,103 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 19:24:43,103 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:70, output treesize:54 [2018-10-26 19:24:43,203 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 81 treesize of output 71 [2018-10-26 19:24:43,211 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 2 case distinctions, treesize of input 24 treesize of output 39 [2018-10-26 19:24:43,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-26 19:24:43,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:24:43,270 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 80 treesize of output 67 [2018-10-26 19:24:43,273 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:24:43,274 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 24 treesize of output 43 [2018-10-26 19:24:43,274 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:43,291 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:43,304 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:24:43,305 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 76 treesize of output 72 [2018-10-26 19:24:43,307 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 33 treesize of output 39 [2018-10-26 19:24:43,307 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:43,315 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:43,336 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 2 xjuncts. [2018-10-26 19:24:43,337 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:94, output treesize:131 [2018-10-26 19:24:43,787 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:43,787 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 77 treesize of output 66 [2018-10-26 19:24:43,793 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 45 [2018-10-26 19:24:43,794 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-10-26 19:24:43,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 50 [2018-10-26 19:24:43,813 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-26 19:24:43,814 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 49 treesize of output 34 [2018-10-26 19:24:43,815 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:43,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-10-26 19:24:43,848 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 41 treesize of output 31 [2018-10-26 19:24:43,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 19:24:43,850 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:43,856 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 19:24:43,856 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:43,860 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:43,862 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 41 treesize of output 31 [2018-10-26 19:24:43,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-10-26 19:24:43,890 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:43,921 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 19:24:43,922 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:43,925 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:43,936 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 19:24:43,936 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:87, output treesize:10 [2018-10-26 19:24:44,050 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:24:44,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:24:44,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 39 [2018-10-26 19:24:44,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-26 19:24:44,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-26 19:24:44,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1325, Unknown=0, NotChecked=0, Total=1482 [2018-10-26 19:24:44,068 INFO L87 Difference]: Start difference. First operand 250 states and 262 transitions. Second operand 39 states. [2018-10-26 19:24:45,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:24:45,576 INFO L93 Difference]: Finished difference Result 297 states and 310 transitions. [2018-10-26 19:24:45,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-26 19:24:45,577 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 73 [2018-10-26 19:24:45,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:24:45,578 INFO L225 Difference]: With dead ends: 297 [2018-10-26 19:24:45,578 INFO L226 Difference]: Without dead ends: 256 [2018-10-26 19:24:45,579 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1004 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=664, Invalid=3496, Unknown=0, NotChecked=0, Total=4160 [2018-10-26 19:24:45,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-10-26 19:24:45,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 250. [2018-10-26 19:24:45,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-10-26 19:24:45,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 261 transitions. [2018-10-26 19:24:45,591 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 261 transitions. Word has length 73 [2018-10-26 19:24:45,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:24:45,591 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 261 transitions. [2018-10-26 19:24:45,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-26 19:24:45,591 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 261 transitions. [2018-10-26 19:24:45,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-26 19:24:45,592 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:24:45,592 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:24:45,592 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:24:45,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:24:45,593 INFO L82 PathProgramCache]: Analyzing trace with hash 140320045, now seen corresponding path program 1 times [2018-10-26 19:24:45,593 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:24:45,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:24:45,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:24:45,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 19:24:45,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:24:45,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:24:45,833 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:24:45,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:24:45,833 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa5e1787-5b68-48aa-ac6e-2a035d08e498/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 19:24:45,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:24:45,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:24:45,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:24:45,877 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 19:24:45,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:45,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:45,878 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-26 19:24:45,885 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:45,886 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:45,886 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 19:24:45,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:45,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:45,891 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-10-26 19:24:45,920 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:45,946 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:45,974 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:45,975 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 34 [2018-10-26 19:24:45,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:45,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:45,987 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:28 [2018-10-26 19:24:46,005 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 11 treesize of output 8 [2018-10-26 19:24:46,007 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 19:24:46,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:46,010 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:46,019 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 19:24:46,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:40 [2018-10-26 19:24:46,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-10-26 19:24:46,065 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 14 treesize of output 13 [2018-10-26 19:24:46,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:46,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:46,079 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 19:24:46,079 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:53 [2018-10-26 19:24:46,114 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 46 treesize of output 32 [2018-10-26 19:24:46,116 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 19:24:46,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:46,121 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 25 treesize of output 14 [2018-10-26 19:24:46,122 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:46,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:46,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 19:24:46,131 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:60, output treesize:28 [2018-10-26 19:24:46,229 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:46,249 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:46,273 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:46,295 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:46,296 INFO L303 Elim1Store]: Index analysis took 116 ms [2018-10-26 19:24:46,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 51 [2018-10-26 19:24:46,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:46,614 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 19:24:46,614 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:45 [2018-10-26 19:24:47,174 WARN L179 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-10-26 19:24:47,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-10-26 19:24:47,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-10-26 19:24:47,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:47,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:47,321 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 19:24:47,321 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:61 [2018-10-26 19:24:47,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2018-10-26 19:24:47,384 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 14 treesize of output 13 [2018-10-26 19:24:47,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:47,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:47,402 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 19:24:47,402 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:74 [2018-10-26 19:24:47,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 38 [2018-10-26 19:24:47,452 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 31 treesize of output 18 [2018-10-26 19:24:47,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:47,459 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 19:24:47,459 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:47,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:47,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-26 19:24:47,473 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:81, output treesize:45 [2018-10-26 19:24:47,569 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:47,570 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:47,571 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:47,571 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:47,572 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:47,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-10-26 19:24:47,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:47,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:47,582 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:13 [2018-10-26 19:24:47,599 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 11 treesize of output 8 [2018-10-26 19:24:47,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 19:24:47,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:47,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:47,606 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 19:24:47,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2018-10-26 19:24:47,762 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 38 treesize of output 34 [2018-10-26 19:24:47,764 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 14 treesize of output 13 [2018-10-26 19:24:47,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:47,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:47,773 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 19:24:47,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-10-26 19:24:47,799 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 37 treesize of output 25 [2018-10-26 19:24:47,801 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 19:24:47,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:47,806 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 19:24:47,806 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:47,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:47,812 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 19:24:47,813 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:4 [2018-10-26 19:24:47,846 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:24:47,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:24:47,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 25] total 29 [2018-10-26 19:24:47,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-26 19:24:47,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-26 19:24:47,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2018-10-26 19:24:47,864 INFO L87 Difference]: Start difference. First operand 250 states and 261 transitions. Second operand 29 states. [2018-10-26 19:24:50,458 WARN L179 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2018-10-26 19:24:50,626 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2018-10-26 19:24:51,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:24:51,321 INFO L93 Difference]: Finished difference Result 256 states and 267 transitions. [2018-10-26 19:24:51,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-26 19:24:51,321 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 75 [2018-10-26 19:24:51,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:24:51,322 INFO L225 Difference]: With dead ends: 256 [2018-10-26 19:24:51,322 INFO L226 Difference]: Without dead ends: 254 [2018-10-26 19:24:51,323 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=749, Invalid=2113, Unknown=0, NotChecked=0, Total=2862 [2018-10-26 19:24:51,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-10-26 19:24:51,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 193. [2018-10-26 19:24:51,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-10-26 19:24:51,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 201 transitions. [2018-10-26 19:24:51,333 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 201 transitions. Word has length 75 [2018-10-26 19:24:51,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:24:51,333 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 201 transitions. [2018-10-26 19:24:51,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-26 19:24:51,333 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 201 transitions. [2018-10-26 19:24:51,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-26 19:24:51,336 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:24:51,336 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:24:51,337 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:24:51,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:24:51,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1083581878, now seen corresponding path program 1 times [2018-10-26 19:24:51,337 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:24:51,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:24:51,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:24:51,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:24:51,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:24:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:24:52,089 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:24:52,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 19:24:52,090 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa5e1787-5b68-48aa-ac6e-2a035d08e498/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 19:24:52,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:24:52,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:24:52,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 19:24:52,170 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 19:24:52,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:52,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:52,173 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-26 19:24:52,247 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:52,247 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:52,248 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 19:24:52,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:52,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:52,256 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-10-26 19:24:52,289 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 19:24:52,291 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 19:24:52,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:52,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:52,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:52,300 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2018-10-26 19:24:52,371 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:52,374 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 39 treesize of output 43 [2018-10-26 19:24:52,376 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 19:24:52,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:52,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:52,388 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 19:24:52,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2018-10-26 19:24:52,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 40 [2018-10-26 19:24:52,534 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 2 case distinctions, treesize of input 16 treesize of output 31 [2018-10-26 19:24:52,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-26 19:24:52,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:24:52,570 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:52,573 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 63 treesize of output 68 [2018-10-26 19:24:52,576 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 19:24:52,576 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:52,585 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:52,587 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:52,590 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 63 treesize of output 80 [2018-10-26 19:24:52,592 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 21 [2018-10-26 19:24:52,593 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:52,602 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:52,626 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 2 xjuncts. [2018-10-26 19:24:52,626 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:75, output treesize:160 [2018-10-26 19:24:52,722 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:52,723 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:52,724 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:52,725 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 19:24:52,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:52,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:52,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:74, output treesize:67 [2018-10-26 19:24:52,783 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:24:52,786 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 45 treesize of output 56 [2018-10-26 19:24:52,791 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 26 [2018-10-26 19:24:52,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:52,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:52,810 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:52,813 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 61 treesize of output 60 [2018-10-26 19:24:52,826 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 19 [2018-10-26 19:24:52,826 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:52,833 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:52,842 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 19:24:52,842 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:86, output treesize:69 [2018-10-26 19:24:52,930 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:52,931 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:52,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 93 [2018-10-26 19:24:52,939 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 19:24:52,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:52,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:52,977 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:52,978 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:52,983 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 89 treesize of output 105 [2018-10-26 19:24:52,986 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 14 treesize of output 13 [2018-10-26 19:24:52,986 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:52,997 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:53,007 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 19:24:53,007 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:111, output treesize:87 [2018-10-26 19:24:53,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 146 [2018-10-26 19:24:53,197 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 2 case distinctions, treesize of input 20 treesize of output 51 [2018-10-26 19:24:53,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-26 19:24:53,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:24:53,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 148 [2018-10-26 19:24:53,271 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 2 case distinctions, treesize of input 20 treesize of output 51 [2018-10-26 19:24:53,272 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-26 19:24:53,310 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 19:24:53,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 152 [2018-10-26 19:24:53,321 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 19:24:53,323 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 20 treesize of output 25 [2018-10-26 19:24:53,323 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:53,338 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:53,378 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 2 xjuncts. [2018-10-26 19:24:53,378 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:165, output treesize:265 [2018-10-26 19:24:53,469 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 22 [2018-10-26 19:24:53,471 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 19:24:53,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:53,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:53,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:53,486 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:132, output treesize:140 [2018-10-26 19:24:53,932 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 170 treesize of output 133 [2018-10-26 19:24:53,934 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 19:24:53,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:53,946 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 103 treesize of output 82 [2018-10-26 19:24:53,946 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:53,955 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 42 treesize of output 31 [2018-10-26 19:24:53,955 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:53,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:53,972 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 19:24:53,972 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:194, output treesize:95 [2018-10-26 19:24:54,173 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 19:24:54,185 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 34 treesize of output 48 [2018-10-26 19:24:54,187 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 19:24:54,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:54,194 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 19:24:54,194 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:54,197 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 19:24:54,197 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:54,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:54,206 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 19:24:54,206 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:104, output treesize:71 [2018-10-26 19:24:54,261 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 19:24:54,263 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 19:24:54,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:54,270 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 19:24:54,270 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:54,274 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 19:24:54,275 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 19:24:54,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 19:24:54,280 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 19:24:54,280 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:75, output treesize:4 [2018-10-26 19:24:54,327 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:24:54,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 19:24:54,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 32] total 57 [2018-10-26 19:24:54,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-26 19:24:54,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-26 19:24:54,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=3006, Unknown=0, NotChecked=0, Total=3192 [2018-10-26 19:24:54,347 INFO L87 Difference]: Start difference. First operand 193 states and 201 transitions. Second operand 57 states. [2018-10-26 19:24:55,988 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 73 [2018-10-26 19:24:56,292 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 77 [2018-10-26 19:24:58,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:24:58,727 INFO L93 Difference]: Finished difference Result 274 states and 285 transitions. [2018-10-26 19:24:58,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-26 19:24:58,727 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 76 [2018-10-26 19:24:58,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:24:58,728 INFO L225 Difference]: With dead ends: 274 [2018-10-26 19:24:58,728 INFO L226 Difference]: Without dead ends: 272 [2018-10-26 19:24:58,730 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1974 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1055, Invalid=8065, Unknown=0, NotChecked=0, Total=9120 [2018-10-26 19:24:58,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-10-26 19:24:58,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 229. [2018-10-26 19:24:58,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-10-26 19:24:58,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 239 transitions. [2018-10-26 19:24:58,741 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 239 transitions. Word has length 76 [2018-10-26 19:24:58,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:24:58,741 INFO L481 AbstractCegarLoop]: Abstraction has 229 states and 239 transitions. [2018-10-26 19:24:58,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-26 19:24:58,741 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 239 transitions. [2018-10-26 19:24:58,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-26 19:24:58,742 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:24:58,742 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 19:24:58,742 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:24:58,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:24:58,742 INFO L82 PathProgramCache]: Analyzing trace with hash -292622321, now seen corresponding path program 1 times [2018-10-26 19:24:58,742 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 19:24:58,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 19:24:58,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:24:58,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:24:58,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:24:58,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 19:24:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 19:24:58,800 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-26 19:24:58,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 07:24:58 BoogieIcfgContainer [2018-10-26 19:24:58,843 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 19:24:58,843 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 19:24:58,843 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 19:24:58,843 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 19:24:58,844 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:24:20" (3/4) ... [2018-10-26 19:24:58,848 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-26 19:24:58,895 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_fa5e1787-5b68-48aa-ac6e-2a035d08e498/bin-2019/uautomizer/witness.graphml [2018-10-26 19:24:58,895 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 19:24:58,895 INFO L168 Benchmark]: Toolchain (without parser) took 39706.18 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 404.8 MB). Free memory was 957.0 MB in the beginning and 931.1 MB in the end (delta: 25.9 MB). Peak memory consumption was 430.7 MB. Max. memory is 11.5 GB. [2018-10-26 19:24:58,896 INFO L168 Benchmark]: CDTParser took 0.15 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 19:24:58,896 INFO L168 Benchmark]: CACSL2BoogieTranslator took 365.53 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 19:24:58,896 INFO L168 Benchmark]: Boogie Preprocessor took 108.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 932.8 MB in the beginning and 1.2 GB in the end (delta: -221.0 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2018-10-26 19:24:58,897 INFO L168 Benchmark]: RCFGBuilder took 922.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 55.7 MB). Peak memory consumption was 55.7 MB. Max. memory is 11.5 GB. [2018-10-26 19:24:58,897 INFO L168 Benchmark]: TraceAbstraction took 38254.82 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 247.5 MB). Free memory was 1.1 GB in the beginning and 941.8 MB in the end (delta: 156.4 MB). Peak memory consumption was 403.8 MB. Max. memory is 11.5 GB. [2018-10-26 19:24:58,897 INFO L168 Benchmark]: Witness Printer took 51.85 ms. Allocated memory is still 1.4 GB. Free memory was 941.8 MB in the beginning and 931.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-26 19:24:58,898 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 365.53 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 108.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 932.8 MB in the beginning and 1.2 GB in the end (delta: -221.0 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 922.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 55.7 MB). Peak memory consumption was 55.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 38254.82 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 247.5 MB). Free memory was 1.1 GB in the beginning and 941.8 MB in the end (delta: 156.4 MB). Peak memory consumption was 403.8 MB. Max. memory is 11.5 GB. * Witness Printer took 51.85 ms. Allocated memory is still 1.4 GB. Free memory was 941.8 MB in the beginning and 931.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1038]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L987] EXPR, FCALL malloc(sizeof(struct TSLL)) VAL [malloc(sizeof(struct TSLL))={15:0}] [L987] struct TSLL* null = malloc(sizeof(struct TSLL)); VAL [malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L988] FCALL null->next = ((void*)0) VAL [malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L989] FCALL null->prev = ((void*)0) VAL [malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L990] FCALL null->colour = BLACK VAL [malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L992] EXPR, FCALL malloc(sizeof(struct TSLL)) VAL [malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L992] struct TSLL* list = malloc(sizeof(struct TSLL)); VAL [list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L993] FCALL list->next = null VAL [list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L994] FCALL list->prev = null VAL [list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L995] FCALL list->colour = BLACK VAL [list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L997] struct TSLL* end = list; VAL [end={17:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L1000] COND TRUE __VERIFIER_nondet_int() [L1003] EXPR, FCALL malloc(sizeof(struct TSLL)) VAL [end={17:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={16:0}, null={15:0}] [L1003] FCALL end->next = malloc(sizeof(struct TSLL)) VAL [end={17:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={16:0}, null={15:0}] [L1004] EXPR, FCALL end->next VAL [end={17:0}, end->next={16:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={16:0}, null={15:0}] [L1004] FCALL end->next->prev = end VAL [end={17:0}, end->next={16:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L1005] EXPR, FCALL end->next VAL [end={17:0}, end->next={16:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={16:0}, null={15:0}] [L1005] end = end->next [L1006] FCALL end->next = null VAL [end={16:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={16:0}, null={15:0}] [L1008] COND FALSE !(__VERIFIER_nondet_int()) [L1014] FCALL end->colour = RED VAL [end={16:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L1015] EXPR, FCALL malloc(sizeof(struct TSLL)) VAL [end={16:0}, list={17:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={16:0}, null={15:0}] [L1015] FCALL end->next = malloc(sizeof(struct TSLL)) VAL [end={16:0}, list={17:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L1016] EXPR, FCALL end->next VAL [end={16:0}, end->next={14:0}, list={17:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={16:0}, null={15:0}] [L1016] FCALL end->next->prev = end VAL [end={16:0}, end->next={14:0}, list={17:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={16:0}, null={15:0}] [L1017] EXPR, FCALL end->next VAL [end={16:0}, end->next={14:0}, list={17:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L1017] end = end->next [L1018] FCALL end->next = null VAL [end={14:0}, list={17:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={16:0}, null={15:0}] [L1019] FCALL end->colour = BLACK VAL [end={14:0}, list={17:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={16:0}, null={15:0}] [L1021] EXPR, FCALL end->colour VAL [end={14:0}, end->colour=1, list={17:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L1021] COND FALSE !(!(BLACK == end->colour)) [L1021] COND FALSE !(0) VAL [end={14:0}, list={17:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L1022] EXPR, FCALL end->next VAL [end={14:0}, end->next={15:0}, list={17:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={16:0}, null={15:0}] [L1022] COND FALSE !(!(null == end->next)) [L1022] COND FALSE !(0) VAL [end={14:0}, list={17:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L1023] COND FALSE !(!(null != end)) VAL [end={14:0}, list={17:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={16:0}, null={15:0}] [L1023] COND FALSE !(0) VAL [end={14:0}, list={17:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={16:0}, null={15:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list VAL [end={17:0}, list={17:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={16:0}, null={15:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={17:0}, list={17:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={16:0}, null={15:0}] [L1030] COND FALSE !(0) VAL [end={17:0}, list={17:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={16:0}, null={15:0}] [L1031] EXPR, FCALL end->colour VAL [end={17:0}, end->colour=1, list={17:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={16:0}, null={15:0}] [L1031] COND FALSE !(!(BLACK == end->colour)) [L1031] COND FALSE !(0) VAL [end={17:0}, list={17:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L1032] COND TRUE null != end VAL [end={17:0}, list={17:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L1034] EXPR, FCALL end->colour VAL [end={17:0}, end->colour=1, list={17:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L1034] COND FALSE !(RED == end->colour) [L1041] EXPR, FCALL end->next VAL [end={17:0}, end->next={16:0}, list={17:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L1041] end = end->next [L1032] COND TRUE null != end VAL [end={16:0}, list={17:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={16:0}, null={15:0}] [L1034] EXPR, FCALL end->colour VAL [end={16:0}, end->colour=0, list={17:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={16:0}, null={15:0}] [L1034] COND TRUE RED == end->colour [L1036] EXPR, FCALL end->next VAL [end={16:0}, end->next={14:0}, list={17:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L1036] end = end->next [L1037] COND FALSE !(!(null != end)) VAL [end={14:0}, list={17:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={16:0}, null={15:0}] [L1037] COND FALSE !(0) VAL [end={14:0}, list={17:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] [L1038] EXPR, FCALL end->colour VAL [end={14:0}, end->colour=1, list={17:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={15:0}, malloc(sizeof(struct TSLL))={16:0}, null={15:0}] [L1038] COND TRUE !(BLACK != end->colour) [L1038] __VERIFIER_error() VAL [end={14:0}, list={17:0}, malloc(sizeof(struct TSLL))={14:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={16:0}, malloc(sizeof(struct TSLL))={15:0}, null={15:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 107 locations, 7 error locations. UNSAFE Result, 38.2s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 20.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 984 SDtfs, 8576 SDslu, 7247 SDs, 0 SdLazy, 8068 SolverSat, 1317 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 7.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 895 GetRequests, 368 SyntacticMatches, 20 SemanticMatches, 507 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6665 ImplicationChecksByTransitivity, 22.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=250occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 398 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 16.2s InterpolantComputationTime, 1270 NumberOfCodeBlocks, 1270 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1168 ConstructedInterpolants, 116 QuantifiedInterpolants, 1726143 SizeOfPredicates, 133 NumberOfNonLiveVariables, 1217 ConjunctsInSsa, 303 ConjunctsInUnsatCore, 22 InterpolantComputations, 8 PerfectInterpolantSequences, 26/170 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...