./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/sll-queue-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_658872f1-025a-465a-8888-6dc00d8b43e5/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_658872f1-025a-465a-8888-6dc00d8b43e5/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_658872f1-025a-465a-8888-6dc00d8b43e5/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_658872f1-025a-465a-8888-6dc00d8b43e5/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-queue-2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_658872f1-025a-465a-8888-6dc00d8b43e5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_658872f1-025a-465a-8888-6dc00d8b43e5/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e5083763cd1026dac92f37bc5a05779baf01a71b .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:02:06,234 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:02:06,236 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:02:06,246 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:02:06,247 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:02:06,248 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:02:06,249 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:02:06,251 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:02:06,252 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:02:06,253 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:02:06,254 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:02:06,256 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:02:06,256 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:02:06,257 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:02:06,258 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:02:06,259 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:02:06,259 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:02:06,260 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:02:06,262 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:02:06,264 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:02:06,265 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:02:06,266 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:02:06,268 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:02:06,268 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:02:06,270 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:02:06,271 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:02:06,271 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:02:06,272 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:02:06,272 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:02:06,273 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:02:06,273 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:02:06,274 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:02:06,275 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:02:06,275 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:02:06,276 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:02:06,277 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:02:06,277 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:02:06,277 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:02:06,277 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:02:06,278 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:02:06,279 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:02:06,279 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_658872f1-025a-465a-8888-6dc00d8b43e5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 09:02:06,291 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:02:06,291 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:02:06,292 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:02:06,292 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:02:06,293 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:02:06,293 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:02:06,293 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:02:06,293 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:02:06,293 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:02:06,294 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:02:06,294 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 09:02:06,294 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 09:02:06,294 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 09:02:06,294 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:02:06,294 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:02:06,295 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:02:06,295 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 09:02:06,295 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:02:06,295 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:02:06,301 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 09:02:06,301 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 09:02:06,301 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 09:02:06,301 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:02:06,302 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 09:02:06,302 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 09:02:06,302 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:02:06,302 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 09:02:06,302 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 09:02:06,302 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_658872f1-025a-465a-8888-6dc00d8b43e5/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e5083763cd1026dac92f37bc5a05779baf01a71b [2019-10-22 09:02:06,347 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:02:06,361 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:02:06,364 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:02:06,366 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:02:06,366 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:02:06,367 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_658872f1-025a-465a-8888-6dc00d8b43e5/bin/uautomizer/../../sv-benchmarks/c/forester-heap/sll-queue-2.i [2019-10-22 09:02:06,426 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_658872f1-025a-465a-8888-6dc00d8b43e5/bin/uautomizer/data/9e565d0ea/630094e8671244e9924a21d714427d6e/FLAGff48a15bd [2019-10-22 09:02:06,924 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:02:06,925 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_658872f1-025a-465a-8888-6dc00d8b43e5/sv-benchmarks/c/forester-heap/sll-queue-2.i [2019-10-22 09:02:06,944 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_658872f1-025a-465a-8888-6dc00d8b43e5/bin/uautomizer/data/9e565d0ea/630094e8671244e9924a21d714427d6e/FLAGff48a15bd [2019-10-22 09:02:07,220 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_658872f1-025a-465a-8888-6dc00d8b43e5/bin/uautomizer/data/9e565d0ea/630094e8671244e9924a21d714427d6e [2019-10-22 09:02:07,223 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:02:07,225 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:02:07,227 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:07,228 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:02:07,232 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:02:07,233 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:07" (1/1) ... [2019-10-22 09:02:07,236 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33cb8321 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:07, skipping insertion in model container [2019-10-22 09:02:07,236 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:07" (1/1) ... [2019-10-22 09:02:07,243 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:02:07,298 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:02:07,679 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:07,698 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:02:07,758 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:07,806 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:02:07,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:07 WrapperNode [2019-10-22 09:02:07,807 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:07,808 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:07,808 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:02:07,808 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:02:07,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:07" (1/1) ... [2019-10-22 09:02:07,835 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:07" (1/1) ... [2019-10-22 09:02:07,862 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:07,862 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:02:07,862 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:02:07,862 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:02:07,872 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:07" (1/1) ... [2019-10-22 09:02:07,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:07" (1/1) ... [2019-10-22 09:02:07,876 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:07" (1/1) ... [2019-10-22 09:02:07,877 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:07" (1/1) ... [2019-10-22 09:02:07,887 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:07" (1/1) ... [2019-10-22 09:02:07,904 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:07" (1/1) ... [2019-10-22 09:02:07,906 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:07" (1/1) ... [2019-10-22 09:02:07,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:02:07,909 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:02:07,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:02:07,910 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:02:07,911 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_658872f1-025a-465a-8888-6dc00d8b43e5/bin/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 [2019-10-22 09:02:07,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 09:02:07,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:02:07,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 09:02:07,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 09:02:07,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 09:02:07,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 09:02:07,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:02:07,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:02:08,511 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:02:08,512 INFO L284 CfgBuilder]: Removed 35 assume(true) statements. [2019-10-22 09:02:08,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:08 BoogieIcfgContainer [2019-10-22 09:02:08,514 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:02:08,520 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 09:02:08,520 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 09:02:08,523 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 09:02:08,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 09:02:07" (1/3) ... [2019-10-22 09:02:08,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f68c276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:02:08, skipping insertion in model container [2019-10-22 09:02:08,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:07" (2/3) ... [2019-10-22 09:02:08,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f68c276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:02:08, skipping insertion in model container [2019-10-22 09:02:08,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:08" (3/3) ... [2019-10-22 09:02:08,527 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-queue-2.i [2019-10-22 09:02:08,537 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 09:02:08,553 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2019-10-22 09:02:08,564 INFO L249 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2019-10-22 09:02:08,605 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 09:02:08,605 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 09:02:08,605 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 09:02:08,605 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:02:08,606 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:02:08,606 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 09:02:08,606 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:02:08,606 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 09:02:08,626 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2019-10-22 09:02:08,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-10-22 09:02:08,635 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:08,636 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-10-22 09:02:08,639 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:08,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:08,646 INFO L82 PathProgramCache]: Analyzing trace with hash 28752478, now seen corresponding path program 1 times [2019-10-22 09:02:08,653 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:08,653 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958077766] [2019-10-22 09:02:08,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:08,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:08,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:08,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:08,792 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958077766] [2019-10-22 09:02:08,793 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:08,793 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:08,793 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586251783] [2019-10-22 09:02:08,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 09:02:08,798 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:08,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 09:02:08,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 09:02:08,816 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 2 states. [2019-10-22 09:02:08,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:08,845 INFO L93 Difference]: Finished difference Result 168 states and 278 transitions. [2019-10-22 09:02:08,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 09:02:08,847 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-10-22 09:02:08,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:08,859 INFO L225 Difference]: With dead ends: 168 [2019-10-22 09:02:08,860 INFO L226 Difference]: Without dead ends: 80 [2019-10-22 09:02:08,863 INFO L600 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 [2019-10-22 09:02:08,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-22 09:02:08,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-10-22 09:02:08,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-22 09:02:08,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2019-10-22 09:02:08,912 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 5 [2019-10-22 09:02:08,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:08,912 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2019-10-22 09:02:08,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 09:02:08,912 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2019-10-22 09:02:08,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-10-22 09:02:08,913 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:08,913 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-10-22 09:02:08,914 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:08,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:08,914 INFO L82 PathProgramCache]: Analyzing trace with hash 889571111, now seen corresponding path program 1 times [2019-10-22 09:02:08,914 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:08,914 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235663050] [2019-10-22 09:02:08,915 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:08,915 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:08,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:08,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:08,991 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235663050] [2019-10-22 09:02:08,991 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:08,991 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:08,991 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137249174] [2019-10-22 09:02:08,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:08,993 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:08,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:08,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:08,994 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand 3 states. [2019-10-22 09:02:09,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:09,071 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2019-10-22 09:02:09,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:09,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-10-22 09:02:09,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:09,073 INFO L225 Difference]: With dead ends: 80 [2019-10-22 09:02:09,074 INFO L226 Difference]: Without dead ends: 70 [2019-10-22 09:02:09,074 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:09,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-22 09:02:09,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-10-22 09:02:09,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-22 09:02:09,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2019-10-22 09:02:09,084 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 6 [2019-10-22 09:02:09,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:09,085 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2019-10-22 09:02:09,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:09,085 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2019-10-22 09:02:09,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-10-22 09:02:09,085 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:09,086 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:09,086 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:09,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:09,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1270244236, now seen corresponding path program 1 times [2019-10-22 09:02:09,087 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:09,087 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228485901] [2019-10-22 09:02:09,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:09,089 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:09,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:09,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:09,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:09,161 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228485901] [2019-10-22 09:02:09,161 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:09,161 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:09,162 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275872536] [2019-10-22 09:02:09,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:09,162 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:09,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:09,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:09,163 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand 3 states. [2019-10-22 09:02:09,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:09,195 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2019-10-22 09:02:09,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:09,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-10-22 09:02:09,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:09,197 INFO L225 Difference]: With dead ends: 70 [2019-10-22 09:02:09,197 INFO L226 Difference]: Without dead ends: 68 [2019-10-22 09:02:09,198 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:09,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-22 09:02:09,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-10-22 09:02:09,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-10-22 09:02:09,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2019-10-22 09:02:09,205 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 9 [2019-10-22 09:02:09,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:09,205 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2019-10-22 09:02:09,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:09,206 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2019-10-22 09:02:09,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 09:02:09,206 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:09,206 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:09,207 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:09,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:09,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1286414876, now seen corresponding path program 1 times [2019-10-22 09:02:09,208 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:09,208 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076625524] [2019-10-22 09:02:09,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:09,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:09,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:09,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:09,248 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076625524] [2019-10-22 09:02:09,248 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:09,248 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:09,248 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169743503] [2019-10-22 09:02:09,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:09,249 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:09,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:09,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:09,249 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand 3 states. [2019-10-22 09:02:09,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:09,328 INFO L93 Difference]: Finished difference Result 153 states and 178 transitions. [2019-10-22 09:02:09,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:09,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-22 09:02:09,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:09,332 INFO L225 Difference]: With dead ends: 153 [2019-10-22 09:02:09,332 INFO L226 Difference]: Without dead ends: 87 [2019-10-22 09:02:09,333 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:09,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-22 09:02:09,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2019-10-22 09:02:09,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-22 09:02:09,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2019-10-22 09:02:09,345 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 12 [2019-10-22 09:02:09,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:09,345 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2019-10-22 09:02:09,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:09,346 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2019-10-22 09:02:09,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 09:02:09,346 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:09,346 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:09,347 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:09,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:09,347 INFO L82 PathProgramCache]: Analyzing trace with hash -138012862, now seen corresponding path program 1 times [2019-10-22 09:02:09,348 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:09,348 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597412398] [2019-10-22 09:02:09,348 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:09,348 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:09,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:09,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:09,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:09,419 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597412398] [2019-10-22 09:02:09,419 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:09,420 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:02:09,420 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310624122] [2019-10-22 09:02:09,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:02:09,420 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:09,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:02:09,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:02:09,421 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 5 states. [2019-10-22 09:02:09,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:09,536 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2019-10-22 09:02:09,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 09:02:09,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-22 09:02:09,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:09,537 INFO L225 Difference]: With dead ends: 91 [2019-10-22 09:02:09,537 INFO L226 Difference]: Without dead ends: 71 [2019-10-22 09:02:09,538 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:02:09,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-10-22 09:02:09,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-10-22 09:02:09,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-22 09:02:09,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2019-10-22 09:02:09,545 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 17 [2019-10-22 09:02:09,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:09,545 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2019-10-22 09:02:09,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:02:09,545 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2019-10-22 09:02:09,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 09:02:09,546 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:09,546 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:09,547 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:09,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:09,547 INFO L82 PathProgramCache]: Analyzing trace with hash -472870040, now seen corresponding path program 1 times [2019-10-22 09:02:09,548 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:09,548 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217382650] [2019-10-22 09:02:09,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:09,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:09,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:09,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:09,629 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217382650] [2019-10-22 09:02:09,629 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417721413] [2019-10-22 09:02:09,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_658872f1-025a-465a-8888-6dc00d8b43e5/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:09,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:09,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-22 09:02:09,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:09,810 INFO L375 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 [2019-10-22 09:02:09,811 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:09,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:09,825 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:09,825 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-22 09:02:09,847 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:09,847 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-22 09:02:09,848 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:09,865 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:09,875 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 15 [2019-10-22 09:02:09,875 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:09,888 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:09,888 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:09,888 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:23 [2019-10-22 09:02:09,970 INFO L341 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-10-22 09:02:09,971 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 78 [2019-10-22 09:02:09,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:09,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:09,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:09,985 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-10-22 09:02:10,008 INFO L567 ElimStorePlain]: treesize reduction 80, result has 25.9 percent of original size [2019-10-22 09:02:10,009 INFO L496 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. [2019-10-22 09:02:10,010 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:28 [2019-10-22 09:02:10,078 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:10,078 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 30 [2019-10-22 09:02:10,080 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:10,091 INFO L567 ElimStorePlain]: treesize reduction 12, result has 42.9 percent of original size [2019-10-22 09:02:10,092 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:10,092 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:4 [2019-10-22 09:02:10,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:10,101 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:02:10,101 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-10-22 09:02:10,101 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291948609] [2019-10-22 09:02:10,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 09:02:10,102 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:10,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 09:02:10,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-10-22 09:02:10,103 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand 8 states. [2019-10-22 09:02:10,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:10,310 INFO L93 Difference]: Finished difference Result 144 states and 158 transitions. [2019-10-22 09:02:10,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:02:10,311 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-10-22 09:02:10,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:10,312 INFO L225 Difference]: With dead ends: 144 [2019-10-22 09:02:10,312 INFO L226 Difference]: Without dead ends: 142 [2019-10-22 09:02:10,313 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-10-22 09:02:10,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-10-22 09:02:10,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 84. [2019-10-22 09:02:10,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-10-22 09:02:10,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2019-10-22 09:02:10,322 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 19 [2019-10-22 09:02:10,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:10,322 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2019-10-22 09:02:10,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 09:02:10,322 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2019-10-22 09:02:10,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-22 09:02:10,323 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:10,323 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:10,524 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:10,524 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:10,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:10,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1456359625, now seen corresponding path program 1 times [2019-10-22 09:02:10,525 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:10,525 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265977882] [2019-10-22 09:02:10,525 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:10,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:10,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:10,590 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265977882] [2019-10-22 09:02:10,590 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:10,590 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:10,590 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884850261] [2019-10-22 09:02:10,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:10,591 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:10,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:10,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:10,591 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand 3 states. [2019-10-22 09:02:10,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:10,633 INFO L93 Difference]: Finished difference Result 174 states and 199 transitions. [2019-10-22 09:02:10,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:10,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-10-22 09:02:10,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:10,635 INFO L225 Difference]: With dead ends: 174 [2019-10-22 09:02:10,635 INFO L226 Difference]: Without dead ends: 108 [2019-10-22 09:02:10,636 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:10,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-10-22 09:02:10,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2019-10-22 09:02:10,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-10-22 09:02:10,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2019-10-22 09:02:10,645 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 20 [2019-10-22 09:02:10,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:10,645 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2019-10-22 09:02:10,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:10,645 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2019-10-22 09:02:10,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-22 09:02:10,646 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:10,646 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:10,647 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:10,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:10,647 INFO L82 PathProgramCache]: Analyzing trace with hash 886899864, now seen corresponding path program 1 times [2019-10-22 09:02:10,647 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:10,648 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841451138] [2019-10-22 09:02:10,648 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,648 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:10,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:10,687 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 09:02:10,688 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841451138] [2019-10-22 09:02:10,688 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:10,688 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:10,688 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637876340] [2019-10-22 09:02:10,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:10,690 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:10,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:10,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:10,690 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand 3 states. [2019-10-22 09:02:10,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:10,753 INFO L93 Difference]: Finished difference Result 201 states and 228 transitions. [2019-10-22 09:02:10,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:10,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-10-22 09:02:10,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:10,754 INFO L225 Difference]: With dead ends: 201 [2019-10-22 09:02:10,755 INFO L226 Difference]: Without dead ends: 122 [2019-10-22 09:02:10,755 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:10,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-10-22 09:02:10,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 110. [2019-10-22 09:02:10,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-22 09:02:10,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2019-10-22 09:02:10,765 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 27 [2019-10-22 09:02:10,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:10,766 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2019-10-22 09:02:10,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:10,766 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2019-10-22 09:02:10,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-22 09:02:10,767 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:10,767 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:10,768 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:10,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:10,768 INFO L82 PathProgramCache]: Analyzing trace with hash 2041801735, now seen corresponding path program 1 times [2019-10-22 09:02:10,768 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:10,769 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887319080] [2019-10-22 09:02:10,769 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,769 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:10,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:10,964 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:10,964 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887319080] [2019-10-22 09:02:10,965 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113269616] [2019-10-22 09:02:10,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_658872f1-025a-465a-8888-6dc00d8b43e5/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:11,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-22 09:02:11,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:11,037 INFO L375 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 [2019-10-22 09:02:11,037 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:11,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:11,045 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:11,045 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-22 09:02:11,088 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:11,089 INFO L375 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-10-22 09:02:11,090 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:11,128 INFO L567 ElimStorePlain]: treesize reduction 14, result has 77.4 percent of original size [2019-10-22 09:02:11,147 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:11,148 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 27 treesize of output 31 [2019-10-22 09:02:11,148 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:11,191 INFO L567 ElimStorePlain]: treesize reduction 12, result has 76.5 percent of original size [2019-10-22 09:02:11,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:11,193 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 09:02:11,193 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:39 [2019-10-22 09:02:11,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:11,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:11,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:11,264 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:11,265 INFO L375 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 1 case distinctions, treesize of input 55 treesize of output 46 [2019-10-22 09:02:11,266 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:11,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:11,274 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 34 [2019-10-22 09:02:11,275 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:11,346 INFO L567 ElimStorePlain]: treesize reduction 16, result has 81.0 percent of original size [2019-10-22 09:02:11,347 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-10-22 09:02:11,347 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:106, output treesize:68 [2019-10-22 09:02:11,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:11,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:11,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:11,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:11,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:11,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:11,549 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:11,550 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 79 [2019-10-22 09:02:11,551 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:11,577 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:11,578 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 91 [2019-10-22 09:02:11,579 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:11,645 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:11,661 INFO L375 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 54 treesize of output 37 [2019-10-22 09:02:11,662 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:11,703 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:11,704 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 92 [2019-10-22 09:02:11,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:11,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:11,707 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:11,796 INFO L567 ElimStorePlain]: treesize reduction 36, result has 70.5 percent of original size [2019-10-22 09:02:11,797 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-10-22 09:02:11,797 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:131, output treesize:73 [2019-10-22 09:02:11,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:11,930 INFO L375 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 42 treesize of output 33 [2019-10-22 09:02:11,931 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:12,003 INFO L341 Elim1Store]: treesize reduction 50, result has 66.2 percent of original size [2019-10-22 09:02:12,004 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 134 [2019-10-22 09:02:12,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:12,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:12,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,020 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:12,242 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 45 [2019-10-22 09:02:12,243 INFO L567 ElimStorePlain]: treesize reduction 747, result has 15.3 percent of original size [2019-10-22 09:02:12,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,245 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-10-22 09:02:12,246 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:113, output treesize:135 [2019-10-22 09:02:12,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,762 INFO L392 ElimStorePlain]: Different costs {1=[|#memory_$Pointer$.base|], 21=[v_prenex_4]} [2019-10-22 09:02:12,769 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:12,769 INFO L375 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 1 case distinctions, treesize of input 27 treesize of output 23 [2019-10-22 09:02:12,770 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:12,847 INFO L567 ElimStorePlain]: treesize reduction 4, result has 97.2 percent of original size [2019-10-22 09:02:12,862 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:12,862 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 53 [2019-10-22 09:02:12,863 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:12,870 INFO L375 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 31 treesize of output 19 [2019-10-22 09:02:12,870 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:12,882 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:12,883 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 50 [2019-10-22 09:02:12,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:12,885 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 09:02:12,938 INFO L567 ElimStorePlain]: treesize reduction 40, result has 60.4 percent of original size [2019-10-22 09:02:12,939 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-10-22 09:02:12,939 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:152, output treesize:18 [2019-10-22 09:02:12,959 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:12,959 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:02:12,960 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-10-22 09:02:12,960 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705855664] [2019-10-22 09:02:12,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-22 09:02:12,960 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:12,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-22 09:02:12,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-10-22 09:02:12,961 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 12 states. [2019-10-22 09:02:13,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:13,334 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2019-10-22 09:02:13,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:02:13,335 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-10-22 09:02:13,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:13,336 INFO L225 Difference]: With dead ends: 112 [2019-10-22 09:02:13,336 INFO L226 Difference]: Without dead ends: 110 [2019-10-22 09:02:13,336 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 20 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-10-22 09:02:13,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-10-22 09:02:13,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2019-10-22 09:02:13,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-22 09:02:13,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2019-10-22 09:02:13,344 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 28 [2019-10-22 09:02:13,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:13,344 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2019-10-22 09:02:13,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-22 09:02:13,344 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2019-10-22 09:02:13,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-22 09:02:13,345 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:13,345 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:13,546 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:13,546 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:13,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:13,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1259768676, now seen corresponding path program 1 times [2019-10-22 09:02:13,547 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:13,547 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609175800] [2019-10-22 09:02:13,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:13,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:13,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 09:02:13,570 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609175800] [2019-10-22 09:02:13,570 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:13,570 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:13,570 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184275250] [2019-10-22 09:02:13,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:13,571 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:13,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:13,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:13,571 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand 3 states. [2019-10-22 09:02:13,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:13,582 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2019-10-22 09:02:13,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:13,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-22 09:02:13,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:13,584 INFO L225 Difference]: With dead ends: 111 [2019-10-22 09:02:13,584 INFO L226 Difference]: Without dead ends: 109 [2019-10-22 09:02:13,584 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:13,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-10-22 09:02:13,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-10-22 09:02:13,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-10-22 09:02:13,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2019-10-22 09:02:13,591 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 29 [2019-10-22 09:02:13,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:13,591 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2019-10-22 09:02:13,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:13,591 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2019-10-22 09:02:13,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-22 09:02:13,592 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:13,592 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:13,593 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:13,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:13,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1259766754, now seen corresponding path program 1 times [2019-10-22 09:02:13,593 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:13,593 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859402] [2019-10-22 09:02:13,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:13,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:13,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:13,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:13,899 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859402] [2019-10-22 09:02:13,899 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941513212] [2019-10-22 09:02:13,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_658872f1-025a-465a-8888-6dc00d8b43e5/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:13,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-22 09:02:13,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:13,950 INFO L375 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 [2019-10-22 09:02:13,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:13,960 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:13,961 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:13,961 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-22 09:02:13,991 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:13,991 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-22 09:02:13,991 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:14,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:14,017 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 15 [2019-10-22 09:02:14,017 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:14,032 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:14,037 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 15 [2019-10-22 09:02:14,038 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:14,050 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:14,051 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:14,051 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:68, output treesize:36 [2019-10-22 09:02:14,108 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_17|], 4=[|v_#memory_$Pointer$.offset_24|, |v_#memory_$Pointer$.base_30|]} [2019-10-22 09:02:14,112 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 11 [2019-10-22 09:02:14,112 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:14,125 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:14,130 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2019-10-22 09:02:14,131 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:14,142 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:14,161 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:14,162 INFO L375 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 90 [2019-10-22 09:02:14,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:14,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:14,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:14,164 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-10-22 09:02:14,199 INFO L567 ElimStorePlain]: treesize reduction 126, result has 28.4 percent of original size [2019-10-22 09:02:14,199 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:14,199 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:111, output treesize:49 [2019-10-22 09:02:14,243 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:14,244 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 40 [2019-10-22 09:02:14,244 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:14,263 INFO L567 ElimStorePlain]: treesize reduction 12, result has 73.3 percent of original size [2019-10-22 09:02:14,265 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-10-22 09:02:14,265 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:14,273 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:14,274 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:14,274 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:11 [2019-10-22 09:02:14,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:14,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:14,297 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:02:14,297 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 14 [2019-10-22 09:02:14,297 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275261250] [2019-10-22 09:02:14,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-22 09:02:14,298 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:14,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-22 09:02:14,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-10-22 09:02:14,298 INFO L87 Difference]: Start difference. First operand 109 states and 120 transitions. Second operand 14 states. [2019-10-22 09:02:14,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:14,809 INFO L93 Difference]: Finished difference Result 145 states and 158 transitions. [2019-10-22 09:02:14,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 09:02:14,809 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2019-10-22 09:02:14,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:14,810 INFO L225 Difference]: With dead ends: 145 [2019-10-22 09:02:14,810 INFO L226 Difference]: Without dead ends: 143 [2019-10-22 09:02:14,810 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2019-10-22 09:02:14,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-10-22 09:02:14,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 118. [2019-10-22 09:02:14,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-10-22 09:02:14,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 130 transitions. [2019-10-22 09:02:14,817 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 130 transitions. Word has length 29 [2019-10-22 09:02:14,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:14,817 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 130 transitions. [2019-10-22 09:02:14,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-22 09:02:14,817 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 130 transitions. [2019-10-22 09:02:14,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-22 09:02:14,818 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:14,818 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:15,019 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:15,019 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:15,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:15,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1992708989, now seen corresponding path program 1 times [2019-10-22 09:02:15,020 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:15,020 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333335940] [2019-10-22 09:02:15,020 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:15,020 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:15,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:15,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:15,169 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:15,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333335940] [2019-10-22 09:02:15,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232718177] [2019-10-22 09:02:15,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_658872f1-025a-465a-8888-6dc00d8b43e5/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:15,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 50 conjunts are in the unsatisfiable core [2019-10-22 09:02:15,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:15,231 INFO L375 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 [2019-10-22 09:02:15,231 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:15,243 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:15,243 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:15,243 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-22 09:02:15,282 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:15,282 INFO L375 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-22 09:02:15,283 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:15,330 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.3 percent of original size [2019-10-22 09:02:15,335 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 15 [2019-10-22 09:02:15,335 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:15,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:15,352 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 15 [2019-10-22 09:02:15,353 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:15,379 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:15,379 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:15,379 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:77, output treesize:49 [2019-10-22 09:02:15,420 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:15,421 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-10-22 09:02:15,421 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:15,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:15,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:15,445 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-10-22 09:02:15,445 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:15,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:15,467 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:15,467 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:49 [2019-10-22 09:02:15,492 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:15,493 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2019-10-22 09:02:15,493 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:15,535 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:15,543 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 32 [2019-10-22 09:02:15,544 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:15,570 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:15,597 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:15,597 INFO L375 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 82 treesize of output 83 [2019-10-22 09:02:15,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:15,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:15,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:15,600 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:15,697 INFO L567 ElimStorePlain]: treesize reduction 147, result has 28.6 percent of original size [2019-10-22 09:02:15,698 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:15,698 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:153, output treesize:58 [2019-10-22 09:02:15,738 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:15,738 INFO L375 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 144 treesize of output 103 [2019-10-22 09:02:15,739 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:15,766 INFO L567 ElimStorePlain]: treesize reduction 96, result has 54.5 percent of original size [2019-10-22 09:02:15,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:15,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:15,771 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 43 [2019-10-22 09:02:15,771 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:15,781 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:15,782 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:15,782 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:154, output treesize:76 [2019-10-22 09:02:15,856 INFO L392 ElimStorePlain]: Different costs {3=[|#memory_$Pointer$.offset|], 9=[|#memory_$Pointer$.base|]} [2019-10-22 09:02:15,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:15,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:15,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:15,867 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 21 [2019-10-22 09:02:15,868 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:15,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:15,889 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:15,889 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 45 [2019-10-22 09:02:15,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:15,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:15,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:15,891 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:15,895 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:15,895 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:15,896 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:84, output treesize:4 [2019-10-22 09:02:15,903 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:15,903 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:02:15,904 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2019-10-22 09:02:15,904 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522807989] [2019-10-22 09:02:15,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-22 09:02:15,904 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:15,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-22 09:02:15,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-10-22 09:02:15,905 INFO L87 Difference]: Start difference. First operand 118 states and 130 transitions. Second operand 14 states. [2019-10-22 09:02:16,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:16,472 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2019-10-22 09:02:16,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 09:02:16,473 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2019-10-22 09:02:16,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:16,474 INFO L225 Difference]: With dead ends: 156 [2019-10-22 09:02:16,474 INFO L226 Difference]: Without dead ends: 154 [2019-10-22 09:02:16,475 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-10-22 09:02:16,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-22 09:02:16,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 137. [2019-10-22 09:02:16,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-10-22 09:02:16,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 150 transitions. [2019-10-22 09:02:16,485 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 150 transitions. Word has length 31 [2019-10-22 09:02:16,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:16,486 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 150 transitions. [2019-10-22 09:02:16,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-22 09:02:16,486 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 150 transitions. [2019-10-22 09:02:16,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 09:02:16,493 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:16,493 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:16,694 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:16,694 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:16,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:16,694 INFO L82 PathProgramCache]: Analyzing trace with hash 509365297, now seen corresponding path program 1 times [2019-10-22 09:02:16,695 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:16,695 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899173914] [2019-10-22 09:02:16,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:16,695 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:16,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:16,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:16,723 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-22 09:02:16,723 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899173914] [2019-10-22 09:02:16,723 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:16,724 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:16,724 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799925343] [2019-10-22 09:02:16,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:16,724 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:16,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:16,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:16,725 INFO L87 Difference]: Start difference. First operand 137 states and 150 transitions. Second operand 3 states. [2019-10-22 09:02:16,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:16,760 INFO L93 Difference]: Finished difference Result 202 states and 224 transitions. [2019-10-22 09:02:16,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:16,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-22 09:02:16,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:16,761 INFO L225 Difference]: With dead ends: 202 [2019-10-22 09:02:16,761 INFO L226 Difference]: Without dead ends: 111 [2019-10-22 09:02:16,762 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:16,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-22 09:02:16,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 96. [2019-10-22 09:02:16,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-10-22 09:02:16,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2019-10-22 09:02:16,769 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 36 [2019-10-22 09:02:16,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:16,769 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2019-10-22 09:02:16,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:16,769 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2019-10-22 09:02:16,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-22 09:02:16,770 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:16,770 INFO L380 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] [2019-10-22 09:02:16,771 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:16,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:16,771 INFO L82 PathProgramCache]: Analyzing trace with hash 525270376, now seen corresponding path program 1 times [2019-10-22 09:02:16,771 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:16,772 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714689360] [2019-10-22 09:02:16,772 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:16,772 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:16,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:16,798 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 09:02:16,798 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714689360] [2019-10-22 09:02:16,798 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:16,798 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:02:16,799 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867017303] [2019-10-22 09:02:16,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:02:16,800 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:16,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:02:16,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:02:16,801 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand 4 states. [2019-10-22 09:02:16,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:16,845 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2019-10-22 09:02:16,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:02:16,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-10-22 09:02:16,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:16,847 INFO L225 Difference]: With dead ends: 118 [2019-10-22 09:02:16,847 INFO L226 Difference]: Without dead ends: 107 [2019-10-22 09:02:16,847 INFO L600 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 [2019-10-22 09:02:16,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-10-22 09:02:16,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2019-10-22 09:02:16,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-10-22 09:02:16,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2019-10-22 09:02:16,857 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 37 [2019-10-22 09:02:16,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:16,858 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2019-10-22 09:02:16,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:02:16,859 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2019-10-22 09:02:16,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-22 09:02:16,859 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:16,860 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 09:02:16,860 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:16,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:16,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1226334954, now seen corresponding path program 1 times [2019-10-22 09:02:16,860 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:16,861 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068969324] [2019-10-22 09:02:16,861 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:16,861 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:16,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:16,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:17,035 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:17,035 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068969324] [2019-10-22 09:02:17,035 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512030660] [2019-10-22 09:02:17,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_658872f1-025a-465a-8888-6dc00d8b43e5/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:17,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:17,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-22 09:02:17,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:17,095 INFO L375 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 [2019-10-22 09:02:17,095 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:17,100 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:17,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:17,101 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-22 09:02:17,115 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:17,115 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-22 09:02:17,115 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:17,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:17,138 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 15 [2019-10-22 09:02:17,138 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:17,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:17,152 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 15 [2019-10-22 09:02:17,152 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:17,161 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:17,162 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:17,162 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:68, output treesize:36 [2019-10-22 09:02:17,207 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:17,207 INFO L375 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 98 [2019-10-22 09:02:17,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:17,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:17,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:17,210 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-10-22 09:02:17,247 INFO L567 ElimStorePlain]: treesize reduction 220, result has 23.1 percent of original size [2019-10-22 09:02:17,250 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 44 [2019-10-22 09:02:17,251 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:17,258 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:17,258 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:17,259 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:92, output treesize:38 [2019-10-22 09:02:17,327 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:17,327 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 63 [2019-10-22 09:02:17,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:17,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:17,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:17,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:17,330 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 09:02:17,349 INFO L567 ElimStorePlain]: treesize reduction 28, result has 54.1 percent of original size [2019-10-22 09:02:17,355 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:17,355 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2019-10-22 09:02:17,355 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:17,360 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:17,361 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:17,361 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:68, output treesize:7 [2019-10-22 09:02:17,368 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:17,368 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:02:17,369 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2019-10-22 09:02:17,369 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379766964] [2019-10-22 09:02:17,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-22 09:02:17,369 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:17,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-22 09:02:17,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-10-22 09:02:17,370 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand 14 states. [2019-10-22 09:02:17,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:17,635 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2019-10-22 09:02:17,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:02:17,635 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2019-10-22 09:02:17,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:17,635 INFO L225 Difference]: With dead ends: 111 [2019-10-22 09:02:17,635 INFO L226 Difference]: Without dead ends: 80 [2019-10-22 09:02:17,636 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2019-10-22 09:02:17,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-22 09:02:17,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-10-22 09:02:17,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-22 09:02:17,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2019-10-22 09:02:17,640 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 37 [2019-10-22 09:02:17,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:17,640 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2019-10-22 09:02:17,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-22 09:02:17,640 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2019-10-22 09:02:17,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-22 09:02:17,641 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:17,642 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:17,842 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:17,842 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:17,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:17,842 INFO L82 PathProgramCache]: Analyzing trace with hash 778254669, now seen corresponding path program 1 times [2019-10-22 09:02:17,843 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:17,843 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536891576] [2019-10-22 09:02:17,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:17,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:17,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:17,962 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:17,962 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536891576] [2019-10-22 09:02:17,962 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896418066] [2019-10-22 09:02:17,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_658872f1-025a-465a-8888-6dc00d8b43e5/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:18,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:18,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-22 09:02:18,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:18,020 INFO L375 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 [2019-10-22 09:02:18,020 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:18,025 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:18,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:18,025 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-22 09:02:18,051 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:18,051 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-22 09:02:18,052 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:18,080 INFO L567 ElimStorePlain]: treesize reduction 14, result has 76.7 percent of original size [2019-10-22 09:02:18,084 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 15 [2019-10-22 09:02:18,084 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:18,093 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:18,093 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:18,093 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:33 [2019-10-22 09:02:18,121 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-22 09:02:18,121 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-10-22 09:02:18,121 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:18,131 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:18,131 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:18,132 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:36 [2019-10-22 09:02:18,187 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:18,187 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 [2019-10-22 09:02:18,188 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:18,240 INFO L567 ElimStorePlain]: treesize reduction 40, result has 72.4 percent of original size [2019-10-22 09:02:18,275 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:18,276 INFO L375 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 88 treesize of output 105 [2019-10-22 09:02:18,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:18,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,278 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:18,355 INFO L567 ElimStorePlain]: treesize reduction 162, result has 30.2 percent of original size [2019-10-22 09:02:18,356 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 09:02:18,356 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:99, output treesize:69 [2019-10-22 09:02:18,451 INFO L341 Elim1Store]: treesize reduction 62, result has 37.4 percent of original size [2019-10-22 09:02:18,452 INFO L375 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 71 treesize of output 70 [2019-10-22 09:02:18,452 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:18,477 INFO L567 ElimStorePlain]: treesize reduction 34, result has 66.0 percent of original size [2019-10-22 09:02:18,478 INFO L496 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. [2019-10-22 09:02:18,478 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:85, output treesize:66 [2019-10-22 09:02:18,512 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:18,512 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2019-10-22 09:02:18,513 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:18,535 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:18,666 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-10-22 09:02:18,667 INFO L341 Elim1Store]: treesize reduction 23, result has 85.6 percent of original size [2019-10-22 09:02:18,667 INFO L375 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 5 new quantified variables, introduced 7 case distinctions, treesize of input 139 treesize of output 177 [2019-10-22 09:02:18,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:18,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:18,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:18,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:18,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:18,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:18,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:18,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:18,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:18,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:18,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:18,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:18,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:18,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:18,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:18,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:18,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:18,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:18,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:18,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:18,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:18,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:18,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:18,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:18,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:18,723 INFO L496 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-22 09:02:18,874 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 64 [2019-10-22 09:02:18,874 INFO L567 ElimStorePlain]: treesize reduction 353, result has 35.3 percent of original size [2019-10-22 09:02:18,875 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-10-22 09:02:18,875 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:151, output treesize:264 [2019-10-22 09:02:19,188 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 72 [2019-10-22 09:02:19,188 INFO L341 Elim1Store]: treesize reduction 62, result has 72.9 percent of original size [2019-10-22 09:02:19,188 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 179 treesize of output 222 [2019-10-22 09:02:19,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:19,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:19,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:19,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:19,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:19,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:19,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:19,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:19,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:19,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:19,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:19,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:19,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,299 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 15 xjuncts. [2019-10-22 09:02:19,447 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 31 [2019-10-22 09:02:19,448 INFO L567 ElimStorePlain]: treesize reduction 5390, result has 2.2 percent of original size [2019-10-22 09:02:19,448 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-22 09:02:19,448 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:179, output treesize:124 [2019-10-22 09:02:19,523 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:19,523 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 131 treesize of output 116 [2019-10-22 09:02:19,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:19,536 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-22 09:02:19,566 INFO L567 ElimStorePlain]: treesize reduction 72, result has 28.7 percent of original size [2019-10-22 09:02:19,567 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:19,567 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:131, output treesize:4 [2019-10-22 09:02:19,581 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:19,581 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:02:19,581 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2019-10-22 09:02:19,581 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771440779] [2019-10-22 09:02:19,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-22 09:02:19,582 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:19,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-22 09:02:19,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-10-22 09:02:19,582 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 16 states. [2019-10-22 09:02:20,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:20,072 INFO L93 Difference]: Finished difference Result 149 states and 159 transitions. [2019-10-22 09:02:20,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 09:02:20,072 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2019-10-22 09:02:20,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:20,073 INFO L225 Difference]: With dead ends: 149 [2019-10-22 09:02:20,073 INFO L226 Difference]: Without dead ends: 147 [2019-10-22 09:02:20,074 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-10-22 09:02:20,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-10-22 09:02:20,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 78. [2019-10-22 09:02:20,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-10-22 09:02:20,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2019-10-22 09:02:20,078 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 38 [2019-10-22 09:02:20,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:20,079 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2019-10-22 09:02:20,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-22 09:02:20,079 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2019-10-22 09:02:20,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-22 09:02:20,080 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:20,080 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:20,281 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:20,282 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:20,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:20,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1793269558, now seen corresponding path program 1 times [2019-10-22 09:02:20,282 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:20,282 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142808045] [2019-10-22 09:02:20,282 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:20,282 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:20,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:20,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:20,697 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:20,697 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142808045] [2019-10-22 09:02:20,697 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105656079] [2019-10-22 09:02:20,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_658872f1-025a-465a-8888-6dc00d8b43e5/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:20,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:20,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 46 conjunts are in the unsatisfiable core [2019-10-22 09:02:20,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:20,798 INFO L341 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-10-22 09:02:20,799 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 27 treesize of output 15 [2019-10-22 09:02:20,799 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:20,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:20,830 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:20,830 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 27 treesize of output 31 [2019-10-22 09:02:20,830 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:20,861 INFO L567 ElimStorePlain]: treesize reduction 12, result has 76.5 percent of original size [2019-10-22 09:02:20,862 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:20,862 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:39 [2019-10-22 09:02:20,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:20,898 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_19|], 6=[|v_#memory_$Pointer$.offset_32|, |v_#memory_$Pointer$.base_44|]} [2019-10-22 09:02:20,906 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 82 treesize of output 78 [2019-10-22 09:02:20,907 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:20,914 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 82 [2019-10-22 09:02:20,914 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:21,030 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-10-22 09:02:21,031 INFO L567 ElimStorePlain]: treesize reduction 7, result has 95.7 percent of original size [2019-10-22 09:02:21,040 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:21,053 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:21,053 INFO L375 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 1 case distinctions, treesize of input 82 treesize of output 77 [2019-10-22 09:02:21,053 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:21,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:21,065 INFO L375 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 71 treesize of output 55 [2019-10-22 09:02:21,065 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:21,156 INFO L567 ElimStorePlain]: treesize reduction 12, result has 90.6 percent of original size [2019-10-22 09:02:21,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:21,165 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 36 [2019-10-22 09:02:21,165 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:21,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:21,181 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:21,181 INFO L375 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 1 case distinctions, treesize of input 63 treesize of output 58 [2019-10-22 09:02:21,181 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:21,243 INFO L567 ElimStorePlain]: treesize reduction 8, result has 90.7 percent of original size [2019-10-22 09:02:21,243 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-22 09:02:21,243 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:169, output treesize:78 [2019-10-22 09:02:21,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:21,304 INFO L392 ElimStorePlain]: Different costs {0=[v_prenex_14, |v_#memory_int_20|], 2=[|v_#memory_int_18|, v_prenex_12], 3=[v_prenex_13, v_prenex_11], 9=[|v_#memory_$Pointer$.base_45|, |v_#memory_$Pointer$.offset_33|]} [2019-10-22 09:02:21,366 INFO L375 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 112 treesize of output 100 [2019-10-22 09:02:21,366 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:21,995 WARN L191 SmtUtils]: Spent 628.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-10-22 09:02:21,996 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:22,029 INFO L375 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 175 treesize of output 151 [2019-10-22 09:02:22,030 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:22,374 WARN L191 SmtUtils]: Spent 343.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-10-22 09:02:22,374 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:22,401 INFO L375 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 148 treesize of output 136 [2019-10-22 09:02:22,402 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:22,651 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-10-22 09:02:22,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:22,675 INFO L375 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 97 treesize of output 85 [2019-10-22 09:02:22,676 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:22,818 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-10-22 09:02:22,818 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:22,846 INFO L341 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-10-22 09:02:22,846 INFO L375 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 2 case distinctions, treesize of input 82 treesize of output 65 [2019-10-22 09:02:22,847 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:22,910 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:22,930 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:22,931 INFO L375 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 2 case distinctions, treesize of input 62 treesize of output 61 [2019-10-22 09:02:22,931 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:23,026 INFO L567 ElimStorePlain]: treesize reduction 12, result has 93.8 percent of original size [2019-10-22 09:02:23,081 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:23,082 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 133 treesize of output 140 [2019-10-22 09:02:23,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:23,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:23,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:23,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:23,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:23,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:23,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:23,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:23,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:23,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:23,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:23,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:23,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:23,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:23,092 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 09:02:23,189 INFO L567 ElimStorePlain]: treesize reduction 50, result has 72.4 percent of original size [2019-10-22 09:02:23,237 INFO L341 Elim1Store]: treesize reduction 19, result has 74.0 percent of original size [2019-10-22 09:02:23,238 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 84 treesize of output 109 [2019-10-22 09:02:23,238 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:23,326 INFO L567 ElimStorePlain]: treesize reduction 31, result has 78.2 percent of original size [2019-10-22 09:02:23,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:23,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:23,327 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-10-22 09:02:23,327 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:288, output treesize:111 [2019-10-22 09:02:23,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:23,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:23,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:23,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:23,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:23,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:23,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:23,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:23,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:23,489 INFO L392 ElimStorePlain]: Different costs {1=[v_prenex_17, v_prenex_16, v_prenex_15], 12=[|v_#memory_int_21|], 20=[|v_#memory_$Pointer$.base_46|, |v_#memory_$Pointer$.offset_34|]} [2019-10-22 09:02:23,526 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:23,526 INFO L375 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 1 case distinctions, treesize of input 113 treesize of output 132 [2019-10-22 09:02:23,527 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:26,043 WARN L191 SmtUtils]: Spent 2.52 s on a formula simplification. DAG size of input: 130 DAG size of output: 127 [2019-10-22 09:02:26,044 INFO L567 ElimStorePlain]: treesize reduction 30, result has 94.8 percent of original size [2019-10-22 09:02:26,069 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:26,069 INFO L375 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 1 case distinctions, treesize of input 113 treesize of output 104 [2019-10-22 09:02:26,070 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:27,927 WARN L191 SmtUtils]: Spent 1.86 s on a formula simplification. DAG size of input: 123 DAG size of output: 120 [2019-10-22 09:02:27,927 INFO L567 ElimStorePlain]: treesize reduction 24, result has 95.6 percent of original size [2019-10-22 09:02:27,943 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:27,943 INFO L375 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 75 [2019-10-22 09:02:27,944 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:29,488 WARN L191 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 116 DAG size of output: 113 [2019-10-22 09:02:29,488 INFO L567 ElimStorePlain]: treesize reduction 24, result has 95.3 percent of original size [2019-10-22 09:02:29,529 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:29,529 INFO L375 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 1 case distinctions, treesize of input 168 treesize of output 203 [2019-10-22 09:02:29,530 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:29,559 INFO L375 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 117 treesize of output 101 [2019-10-22 09:02:29,560 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:29,595 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:29,595 INFO L375 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 1 case distinctions, treesize of input 80 treesize of output 95 [2019-10-22 09:02:29,595 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:29,607 INFO L375 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 66 treesize of output 58 [2019-10-22 09:02:29,608 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:30,292 WARN L191 SmtUtils]: Spent 683.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2019-10-22 09:02:30,292 INFO L567 ElimStorePlain]: treesize reduction 136, result has 73.1 percent of original size [2019-10-22 09:02:30,314 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:30,314 INFO L375 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 79 [2019-10-22 09:02:30,315 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:30,330 INFO L375 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 55 treesize of output 43 [2019-10-22 09:02:30,331 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:30,349 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:30,349 INFO L375 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 156 treesize of output 119 [2019-10-22 09:02:30,351 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:30,584 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-10-22 09:02:30,584 INFO L567 ElimStorePlain]: treesize reduction 120, result has 70.6 percent of original size [2019-10-22 09:02:30,608 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:30,608 INFO L375 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 1 case distinctions, treesize of input 71 treesize of output 62 [2019-10-22 09:02:30,609 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:30,616 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:30,617 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:30,644 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:30,645 INFO L375 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 103 [2019-10-22 09:02:30,645 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:30,652 INFO L375 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 40 treesize of output 28 [2019-10-22 09:02:30,652 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:30,737 INFO L567 ElimStorePlain]: treesize reduction 59, result has 71.5 percent of original size [2019-10-22 09:02:30,737 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-10-22 09:02:30,737 INFO L221 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:559, output treesize:148 [2019-10-22 09:02:30,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:30,996 INFO L392 ElimStorePlain]: Different costs {1=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|], 3=[v_prenex_19, v_prenex_20]} [2019-10-22 09:02:31,009 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:31,009 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 50 [2019-10-22 09:02:31,010 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:31,069 INFO L567 ElimStorePlain]: treesize reduction 4, result has 97.1 percent of original size [2019-10-22 09:02:31,073 INFO L375 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 37 treesize of output 25 [2019-10-22 09:02:31,073 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:31,095 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:31,108 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:31,108 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 83 [2019-10-22 09:02:31,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:31,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:31,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:31,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:31,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:31,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:31,113 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-22 09:02:31,183 INFO L567 ElimStorePlain]: treesize reduction 16, result has 82.4 percent of original size [2019-10-22 09:02:31,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:31,190 INFO L375 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 55 treesize of output 39 [2019-10-22 09:02:31,190 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:31,213 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:31,214 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-10-22 09:02:31,214 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:161, output treesize:38 [2019-10-22 09:02:31,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:31,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:31,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:31,289 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:31,290 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:02:31,290 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2019-10-22 09:02:31,290 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395403828] [2019-10-22 09:02:31,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-22 09:02:31,291 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:31,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-22 09:02:31,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2019-10-22 09:02:31,291 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand 20 states. [2019-10-22 09:02:31,853 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-10-22 09:02:32,168 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-10-22 09:02:32,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:32,736 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2019-10-22 09:02:32,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-22 09:02:32,736 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2019-10-22 09:02:32,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:32,736 INFO L225 Difference]: With dead ends: 101 [2019-10-22 09:02:32,737 INFO L226 Difference]: Without dead ends: 99 [2019-10-22 09:02:32,737 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=143, Invalid=727, Unknown=0, NotChecked=0, Total=870 [2019-10-22 09:02:32,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-22 09:02:32,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 84. [2019-10-22 09:02:32,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-10-22 09:02:32,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2019-10-22 09:02:32,744 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 40 [2019-10-22 09:02:32,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:32,745 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2019-10-22 09:02:32,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-22 09:02:32,745 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2019-10-22 09:02:32,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-22 09:02:32,745 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:32,746 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:32,946 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:32,947 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:32,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:32,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1428751921, now seen corresponding path program 1 times [2019-10-22 09:02:32,947 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:32,947 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723651863] [2019-10-22 09:02:32,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:32,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:32,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:32,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:32,975 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-22 09:02:32,976 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723651863] [2019-10-22 09:02:32,976 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:32,976 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:32,976 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682917585] [2019-10-22 09:02:32,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:32,977 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:32,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:32,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:32,977 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 3 states. [2019-10-22 09:02:33,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:33,007 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2019-10-22 09:02:33,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:33,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-10-22 09:02:33,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:33,008 INFO L225 Difference]: With dead ends: 110 [2019-10-22 09:02:33,008 INFO L226 Difference]: Without dead ends: 98 [2019-10-22 09:02:33,009 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:33,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-10-22 09:02:33,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 84. [2019-10-22 09:02:33,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-10-22 09:02:33,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2019-10-22 09:02:33,016 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 41 [2019-10-22 09:02:33,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:33,016 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2019-10-22 09:02:33,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:33,016 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2019-10-22 09:02:33,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-22 09:02:33,018 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:33,018 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:33,018 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:33,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:33,019 INFO L82 PathProgramCache]: Analyzing trace with hash 755507507, now seen corresponding path program 1 times [2019-10-22 09:02:33,019 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:33,019 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792920279] [2019-10-22 09:02:33,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:33,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:33,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:33,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:33,275 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:33,275 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792920279] [2019-10-22 09:02:33,275 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111249709] [2019-10-22 09:02:33,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_658872f1-025a-465a-8888-6dc00d8b43e5/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:33,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 63 conjunts are in the unsatisfiable core [2019-10-22 09:02:33,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:33,362 INFO L375 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 [2019-10-22 09:02:33,362 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:33,370 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:33,370 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:33,370 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-22 09:02:33,419 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:33,419 INFO L375 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-22 09:02:33,420 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:33,492 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.3 percent of original size [2019-10-22 09:02:33,499 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 15 [2019-10-22 09:02:33,500 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:33,523 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:33,526 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 15 [2019-10-22 09:02:33,526 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:33,540 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:33,540 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:33,540 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:77, output treesize:49 [2019-10-22 09:02:33,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:33,591 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-10-22 09:02:33,592 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:33,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:33,619 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:33,623 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-10-22 09:02:33,624 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:33,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:33,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:33,668 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:49 [2019-10-22 09:02:33,762 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:33,762 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 [2019-10-22 09:02:33,763 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:33,861 INFO L567 ElimStorePlain]: treesize reduction 40, result has 80.5 percent of original size [2019-10-22 09:02:33,872 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 32 [2019-10-22 09:02:33,873 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:33,906 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:33,939 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:33,940 INFO L375 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 91 treesize of output 88 [2019-10-22 09:02:33,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:33,941 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:34,031 INFO L567 ElimStorePlain]: treesize reduction 76, result has 50.3 percent of original size [2019-10-22 09:02:34,031 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:34,031 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:159, output treesize:77 [2019-10-22 09:02:34,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:34,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:34,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:34,080 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-10-22 09:02:34,080 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:34,106 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:34,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:34,117 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:34,118 INFO L375 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 59 [2019-10-22 09:02:34,118 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:34,157 INFO L567 ElimStorePlain]: treesize reduction 44, result has 63.6 percent of original size [2019-10-22 09:02:34,157 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:34,157 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:115, output treesize:77 [2019-10-22 09:02:34,182 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:34,188 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:34,214 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:34,214 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2019-10-22 09:02:34,215 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:34,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:34,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:34,293 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:34,294 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 50 [2019-10-22 09:02:34,294 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:34,329 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:34,418 INFO L341 Elim1Store]: treesize reduction 15, result has 86.6 percent of original size [2019-10-22 09:02:34,419 INFO L375 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 5 new quantified variables, introduced 7 case distinctions, treesize of input 145 treesize of output 143 [2019-10-22 09:02:34,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:34,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:34,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:34,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:34,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:34,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:34,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:34,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:34,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:34,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:34,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:34,470 INFO L496 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-22 09:02:34,652 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 37 [2019-10-22 09:02:34,652 INFO L567 ElimStorePlain]: treesize reduction 455, result has 15.9 percent of original size [2019-10-22 09:02:34,652 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:34,653 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:229, output treesize:85 [2019-10-22 09:02:34,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:34,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:34,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:34,706 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:34,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:34,709 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 65 [2019-10-22 09:02:34,709 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:34,734 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:34,763 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:34,763 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 144 treesize of output 129 [2019-10-22 09:02:34,765 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:34,818 INFO L567 ElimStorePlain]: treesize reduction 240, result has 30.0 percent of original size [2019-10-22 09:02:34,818 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:34,819 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:205, output treesize:103 [2019-10-22 09:02:34,977 INFO L392 ElimStorePlain]: Different costs {6=[|#memory_$Pointer$.offset|], 14=[|#memory_$Pointer$.base|]} [2019-10-22 09:02:34,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:34,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:34,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:34,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:34,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:34,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:34,988 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 24 [2019-10-22 09:02:34,988 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:34,997 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:35,023 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:35,023 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 72 [2019-10-22 09:02:35,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:35,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:35,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:35,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:35,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:35,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:35,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:35,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:35,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:35,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:35,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:35,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:35,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:35,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:35,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:35,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:35,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:35,034 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:35,051 INFO L567 ElimStorePlain]: treesize reduction 22, result has 29.0 percent of original size [2019-10-22 09:02:35,051 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:35,052 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:107, output treesize:4 [2019-10-22 09:02:35,073 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:35,073 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:02:35,073 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2019-10-22 09:02:35,074 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101709605] [2019-10-22 09:02:35,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-22 09:02:35,074 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:35,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-22 09:02:35,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2019-10-22 09:02:35,075 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 18 states. [2019-10-22 09:02:36,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:36,227 INFO L93 Difference]: Finished difference Result 131 states and 138 transitions. [2019-10-22 09:02:36,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-22 09:02:36,227 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 41 [2019-10-22 09:02:36,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:36,228 INFO L225 Difference]: With dead ends: 131 [2019-10-22 09:02:36,228 INFO L226 Difference]: Without dead ends: 129 [2019-10-22 09:02:36,229 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2019-10-22 09:02:36,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-10-22 09:02:36,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 82. [2019-10-22 09:02:36,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-10-22 09:02:36,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2019-10-22 09:02:36,236 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 41 [2019-10-22 09:02:36,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:36,236 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2019-10-22 09:02:36,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-22 09:02:36,236 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2019-10-22 09:02:36,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-22 09:02:36,237 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:36,237 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:36,437 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:36,438 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:36,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:36,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1699655007, now seen corresponding path program 1 times [2019-10-22 09:02:36,438 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:36,439 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938990402] [2019-10-22 09:02:36,439 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:36,439 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:36,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:36,675 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:36,675 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938990402] [2019-10-22 09:02:36,675 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728601811] [2019-10-22 09:02:36,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_658872f1-025a-465a-8888-6dc00d8b43e5/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:36,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 76 conjunts are in the unsatisfiable core [2019-10-22 09:02:36,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:36,763 INFO L375 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 [2019-10-22 09:02:36,763 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:36,775 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:36,775 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:36,775 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-22 09:02:36,821 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:36,822 INFO L375 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-22 09:02:36,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:36,876 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.3 percent of original size [2019-10-22 09:02:36,881 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 15 [2019-10-22 09:02:36,882 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:36,897 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:36,900 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 15 [2019-10-22 09:02:36,901 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:36,915 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:36,916 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:36,916 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:77, output treesize:49 [2019-10-22 09:02:36,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:36,952 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-10-22 09:02:36,952 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:36,970 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:36,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:36,979 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-10-22 09:02:36,979 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:36,993 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:36,993 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:36,993 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:49 [2019-10-22 09:02:37,026 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:37,026 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 26 treesize of output 89 [2019-10-22 09:02:37,027 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:37,146 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-10-22 09:02:37,147 INFO L567 ElimStorePlain]: treesize reduction 40, result has 80.1 percent of original size [2019-10-22 09:02:37,151 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 32 [2019-10-22 09:02:37,152 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:37,180 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:37,205 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:37,205 INFO L375 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 91 treesize of output 88 [2019-10-22 09:02:37,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:37,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:37,206 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:37,243 INFO L567 ElimStorePlain]: treesize reduction 60, result has 57.4 percent of original size [2019-10-22 09:02:37,244 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:37,244 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:155, output treesize:81 [2019-10-22 09:02:37,290 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:37,297 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:37,297 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 63 [2019-10-22 09:02:37,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:37,340 INFO L567 ElimStorePlain]: treesize reduction 32, result has 75.8 percent of original size [2019-10-22 09:02:37,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:37,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:37,345 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-10-22 09:02:37,345 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:37,365 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:37,365 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:37,365 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:119, output treesize:81 [2019-10-22 09:02:37,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:37,386 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:37,387 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2019-10-22 09:02:37,387 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:37,423 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:37,485 INFO L341 Elim1Store]: treesize reduction 15, result has 86.6 percent of original size [2019-10-22 09:02:37,486 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 208 treesize of output 170 [2019-10-22 09:02:37,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:37,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-22 09:02:37,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:37,489 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:37,553 INFO L567 ElimStorePlain]: treesize reduction 176, result has 43.8 percent of original size [2019-10-22 09:02:37,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:37,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:37,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:37,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:37,563 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 50 [2019-10-22 09:02:37,563 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:37,578 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:37,578 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:37,578 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:237, output treesize:85 [2019-10-22 09:02:37,647 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:37,647 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 219 treesize of output 148 [2019-10-22 09:02:37,648 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:37,693 INFO L567 ElimStorePlain]: treesize reduction 240, result has 42.6 percent of original size [2019-10-22 09:02:37,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:37,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:37,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:37,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:37,700 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 65 [2019-10-22 09:02:37,701 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:37,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:37,714 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:37,715 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:229, output treesize:127 [2019-10-22 09:02:37,992 INFO L392 ElimStorePlain]: Different costs {14=[|#memory_$Pointer$.offset|], 24=[|#memory_$Pointer$.base|]} [2019-10-22 09:02:37,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:37,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:38,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:38,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-22 09:02:38,033 INFO L341 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2019-10-22 09:02:38,034 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 100 treesize of output 91 [2019-10-22 09:02:38,034 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:38,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:38,070 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:38,070 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 76 [2019-10-22 09:02:38,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:38,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:38,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:38,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:38,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:38,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:38,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:38,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:38,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:02:38,075 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:02:38,079 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:02:38,079 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:02:38,079 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:143, output treesize:4 [2019-10-22 09:02:38,101 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:38,101 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:02:38,102 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2019-10-22 09:02:38,102 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044658756] [2019-10-22 09:02:38,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-22 09:02:38,103 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:38,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-22 09:02:38,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-10-22 09:02:38,103 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand 20 states. [2019-10-22 09:02:38,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:38,921 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2019-10-22 09:02:38,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-22 09:02:38,922 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 44 [2019-10-22 09:02:38,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:38,922 INFO L225 Difference]: With dead ends: 129 [2019-10-22 09:02:38,923 INFO L226 Difference]: Without dead ends: 127 [2019-10-22 09:02:38,923 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2019-10-22 09:02:38,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-10-22 09:02:38,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 106. [2019-10-22 09:02:38,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-10-22 09:02:38,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2019-10-22 09:02:38,930 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 44 [2019-10-22 09:02:38,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:38,930 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2019-10-22 09:02:38,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-22 09:02:38,930 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2019-10-22 09:02:38,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-22 09:02:38,931 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:38,931 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:39,132 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:02:39,132 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:39,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:39,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1057023877, now seen corresponding path program 1 times [2019-10-22 09:02:39,132 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:39,132 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742936193] [2019-10-22 09:02:39,133 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:39,133 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:39,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:39,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:39,212 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:39,212 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 09:02:39,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 09:02:39 BoogieIcfgContainer [2019-10-22 09:02:39,247 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 09:02:39,247 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:02:39,247 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:02:39,247 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:02:39,248 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:08" (3/4) ... [2019-10-22 09:02:39,250 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 09:02:39,303 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_658872f1-025a-465a-8888-6dc00d8b43e5/bin/uautomizer/witness.graphml [2019-10-22 09:02:39,309 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:02:39,311 INFO L168 Benchmark]: Toolchain (without parser) took 32085.95 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 466.1 MB). Free memory was 951.2 MB in the beginning and 1.2 GB in the end (delta: -254.8 MB). Peak memory consumption was 211.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:39,311 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:39,311 INFO L168 Benchmark]: CACSL2BoogieTranslator took 579.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -168.8 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:39,311 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.21 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:39,312 INFO L168 Benchmark]: Boogie Preprocessor took 47.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:39,312 INFO L168 Benchmark]: RCFGBuilder took 609.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:39,312 INFO L168 Benchmark]: TraceAbstraction took 30726.91 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 327.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -149.4 MB). Peak memory consumption was 178.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:39,312 INFO L168 Benchmark]: Witness Printer took 62.69 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:39,313 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 579.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -168.8 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.21 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 609.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30726.91 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 327.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -149.4 MB). Peak memory consumption was 178.3 MB. Max. memory is 11.5 GB. * Witness Printer took 62.69 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1035]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L985] SLL* head = malloc(sizeof(SLL)); [L986] head->next = ((void*)0) [L987] head->data = 0 [L988] SLL* item = head; [L989] int status = 0; [L991] COND TRUE __VERIFIER_nondet_int() [L993] item->next = malloc(sizeof(SLL)) [L994] EXPR item->next [L994] item = item->next [L995] item->next = ((void*)0) [L997] COND TRUE !status [L999] item->data = 1 [L1000] status = 1 [L1013] COND FALSE !(!(head != ((void*)0))) [L1014] COND FALSE !(!(item != ((void*)0))) [L991] COND TRUE __VERIFIER_nondet_int() [L993] item->next = malloc(sizeof(SLL)) [L994] EXPR item->next [L994] item = item->next [L995] item->next = ((void*)0) [L997] COND FALSE !(!status) [L1002] COND TRUE status == 1 [L1004] item->data = 2 [L1005] status = 2 [L1013] COND FALSE !(!(head != ((void*)0))) [L1014] COND FALSE !(!(item != ((void*)0))) [L991] COND TRUE __VERIFIER_nondet_int() [L993] item->next = malloc(sizeof(SLL)) [L994] EXPR item->next [L994] item = item->next [L995] item->next = ((void*)0) [L997] COND FALSE !(!status) [L1002] COND FALSE !(status == 1) [L1007] COND TRUE status >= 2 [L1009] item->data = 3 [L1010] status = 3 [L1013] COND FALSE !(!(head != ((void*)0))) [L1014] COND FALSE !(!(item != ((void*)0))) [L991] COND FALSE !(__VERIFIER_nondet_int()) [L1017] COND FALSE !(!(head != ((void*)0))) [L1018] COND FALSE !(status == 1) [L1023] COND FALSE !(status == 2) [L1029] COND TRUE status == 3 [L1031] COND FALSE !(!(head != ((void*)0))) [L1032] EXPR head->next [L1032] COND FALSE !(!(head->next != ((void*)0))) [L1033] EXPR head->next [L1033] EXPR head->next->next [L1033] COND FALSE !(!(head->next->next != ((void*)0))) [L1034] EXPR head->next [L1034] EXPR head->next->next [L1034] EXPR head->next->next->next [L1034] COND FALSE !(!(head->next->next->next != ((void*)0))) [L1035] EXPR head->next [L1035] EXPR head->next->next [L1035] EXPR head->next->next->next [L1035] EXPR head->next->next->next->data [L1035] COND TRUE !(head->next->next->next->data != 3) [L1035] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 85 locations, 14 error locations. Result: UNSAFE, OverallTime: 30.6s, OverallIterations: 21, TraceHistogramMax: 4, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1365 SDtfs, 1724 SDslu, 4712 SDs, 0 SdLazy, 2841 SolverSat, 217 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 481 GetRequests, 269 SyntacticMatches, 28 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 319 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 20.8s InterpolantComputationTime, 900 NumberOfCodeBlocks, 900 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 824 ConstructedInterpolants, 74 QuantifiedInterpolants, 985380 SizeOfPredicates, 118 NumberOfNonLiveVariables, 1108 ConjunctsInSsa, 376 ConjunctsInUnsatCore, 29 InterpolantComputations, 11 PerfectInterpolantSequences, 88/337 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...