./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-properties/list-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a297b9fc-36a3-4538-85df-6dc29540f570/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a297b9fc-36a3-4538-85df-6dc29540f570/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a297b9fc-36a3-4538-85df-6dc29540f570/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a297b9fc-36a3-4538-85df-6dc29540f570/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-properties/list-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_a297b9fc-36a3-4538-85df-6dc29540f570/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a297b9fc-36a3-4538-85df-6dc29540f570/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 283704c20cde057c38dc133107a27c4d033fb1ba .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 04:06:23,649 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 04:06:23,651 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 04:06:23,670 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 04:06:23,671 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 04:06:23,672 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 04:06:23,675 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 04:06:23,685 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 04:06:23,692 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 04:06:23,696 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 04:06:23,698 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 04:06:23,699 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 04:06:23,700 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 04:06:23,703 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 04:06:23,704 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 04:06:23,705 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 04:06:23,707 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 04:06:23,709 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 04:06:23,713 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 04:06:23,718 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 04:06:23,724 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 04:06:23,727 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 04:06:23,731 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 04:06:23,732 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 04:06:23,736 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 04:06:23,736 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 04:06:23,736 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 04:06:23,738 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 04:06:23,739 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 04:06:23,740 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 04:06:23,741 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 04:06:23,742 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 04:06:23,742 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 04:06:23,744 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 04:06:23,745 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 04:06:23,745 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 04:06:23,746 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 04:06:23,746 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 04:06:23,746 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 04:06:23,747 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 04:06:23,749 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 04:06:23,750 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a297b9fc-36a3-4538-85df-6dc29540f570/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 04:06:23,781 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 04:06:23,783 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 04:06:23,795 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 04:06:23,795 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 04:06:23,795 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 04:06:23,796 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 04:06:23,796 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 04:06:23,796 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 04:06:23,797 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 04:06:23,797 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 04:06:23,797 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 04:06:23,797 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 04:06:23,798 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 04:06:23,798 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 04:06:23,798 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 04:06:23,798 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 04:06:23,799 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 04:06:23,799 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 04:06:23,799 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 04:06:23,800 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 04:06:23,800 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 04:06:23,800 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 04:06:23,801 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 04:06:23,801 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 04:06:23,801 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 04:06:23,802 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 04:06:23,802 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 04:06:23,802 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 04:06:23,802 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/run_dir_a297b9fc-36a3-4538-85df-6dc29540f570/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 -> 283704c20cde057c38dc133107a27c4d033fb1ba [2019-11-20 04:06:23,974 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 04:06:23,985 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 04:06:23,988 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 04:06:23,990 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 04:06:23,998 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 04:06:23,999 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a297b9fc-36a3-4538-85df-6dc29540f570/bin/uautomizer/../../sv-benchmarks/c/list-properties/list-1.i [2019-11-20 04:06:24,062 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a297b9fc-36a3-4538-85df-6dc29540f570/bin/uautomizer/data/1561343b6/d21971cde14748099dcdd1abf5d3a412/FLAG2347ee462 [2019-11-20 04:06:24,579 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 04:06:24,580 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a297b9fc-36a3-4538-85df-6dc29540f570/sv-benchmarks/c/list-properties/list-1.i [2019-11-20 04:06:24,597 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a297b9fc-36a3-4538-85df-6dc29540f570/bin/uautomizer/data/1561343b6/d21971cde14748099dcdd1abf5d3a412/FLAG2347ee462 [2019-11-20 04:06:24,861 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a297b9fc-36a3-4538-85df-6dc29540f570/bin/uautomizer/data/1561343b6/d21971cde14748099dcdd1abf5d3a412 [2019-11-20 04:06:24,864 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 04:06:24,865 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 04:06:24,866 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 04:06:24,866 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 04:06:24,871 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 04:06:24,872 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:06:24" (1/1) ... [2019-11-20 04:06:24,875 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e1ba59a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:06:24, skipping insertion in model container [2019-11-20 04:06:24,875 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:06:24" (1/1) ... [2019-11-20 04:06:24,884 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 04:06:24,958 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 04:06:25,480 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 04:06:25,491 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 04:06:25,540 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 04:06:25,602 INFO L192 MainTranslator]: Completed translation [2019-11-20 04:06:25,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:06:25 WrapperNode [2019-11-20 04:06:25,603 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 04:06:25,605 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 04:06:25,605 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 04:06:25,605 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 04:06:25,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:06:25" (1/1) ... [2019-11-20 04:06:25,631 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:06:25" (1/1) ... [2019-11-20 04:06:25,656 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 04:06:25,656 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 04:06:25,657 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 04:06:25,657 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 04:06:25,667 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:06:25" (1/1) ... [2019-11-20 04:06:25,667 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:06:25" (1/1) ... [2019-11-20 04:06:25,672 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:06:25" (1/1) ... [2019-11-20 04:06:25,673 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:06:25" (1/1) ... [2019-11-20 04:06:25,681 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:06:25" (1/1) ... [2019-11-20 04:06:25,692 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:06:25" (1/1) ... [2019-11-20 04:06:25,694 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:06:25" (1/1) ... [2019-11-20 04:06:25,698 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 04:06:25,698 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 04:06:25,698 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 04:06:25,699 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 04:06:25,712 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:06:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a297b9fc-36a3-4538-85df-6dc29540f570/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-11-20 04:06:25,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 04:06:25,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 04:06:25,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 04:06:25,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 04:06:25,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 04:06:25,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 04:06:25,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 04:06:26,196 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 04:06:26,196 INFO L285 CfgBuilder]: Removed 14 assume(true) statements. [2019-11-20 04:06:26,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:06:26 BoogieIcfgContainer [2019-11-20 04:06:26,198 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 04:06:26,199 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 04:06:26,199 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 04:06:26,202 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 04:06:26,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:06:24" (1/3) ... [2019-11-20 04:06:26,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7db1e826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:06:26, skipping insertion in model container [2019-11-20 04:06:26,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:06:25" (2/3) ... [2019-11-20 04:06:26,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7db1e826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:06:26, skipping insertion in model container [2019-11-20 04:06:26,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:06:26" (3/3) ... [2019-11-20 04:06:26,207 INFO L109 eAbstractionObserver]: Analyzing ICFG list-1.i [2019-11-20 04:06:26,216 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 04:06:26,222 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 04:06:26,235 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 04:06:26,258 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 04:06:26,259 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 04:06:26,259 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 04:06:26,259 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 04:06:26,259 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 04:06:26,260 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 04:06:26,260 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 04:06:26,260 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 04:06:26,275 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-11-20 04:06:26,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-20 04:06:26,281 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:06:26,282 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:06:26,282 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:06:26,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:26,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1661254537, now seen corresponding path program 1 times [2019-11-20 04:06:26,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:26,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920166754] [2019-11-20 04:06:26,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:26,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:26,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:06:26,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920166754] [2019-11-20 04:06:26,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:06:26,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 04:06:26,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43686951] [2019-11-20 04:06:26,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 04:06:26,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:06:26,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 04:06:26,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 04:06:26,448 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2019-11-20 04:06:26,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:06:26,470 INFO L93 Difference]: Finished difference Result 46 states and 64 transitions. [2019-11-20 04:06:26,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 04:06:26,472 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-11-20 04:06:26,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:06:26,482 INFO L225 Difference]: With dead ends: 46 [2019-11-20 04:06:26,483 INFO L226 Difference]: Without dead ends: 21 [2019-11-20 04:06:26,486 INFO L630 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-11-20 04:06:26,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-20 04:06:26,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-20 04:06:26,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-20 04:06:26,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-11-20 04:06:26,526 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 12 [2019-11-20 04:06:26,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:06:26,527 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-11-20 04:06:26,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 04:06:26,527 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-11-20 04:06:26,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 04:06:26,528 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:06:26,528 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:06:26,528 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:06:26,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:26,529 INFO L82 PathProgramCache]: Analyzing trace with hash 57591681, now seen corresponding path program 1 times [2019-11-20 04:06:26,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:26,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308615320] [2019-11-20 04:06:26,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:26,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:06:26,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308615320] [2019-11-20 04:06:26,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:06:26,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 04:06:26,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474495070] [2019-11-20 04:06:26,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 04:06:26,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:06:26,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 04:06:26,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:06:26,675 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 5 states. [2019-11-20 04:06:26,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:06:26,859 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2019-11-20 04:06:26,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 04:06:26,859 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-20 04:06:26,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:06:26,862 INFO L225 Difference]: With dead ends: 46 [2019-11-20 04:06:26,863 INFO L226 Difference]: Without dead ends: 42 [2019-11-20 04:06:26,864 INFO L630 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-11-20 04:06:26,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-20 04:06:26,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-11-20 04:06:26,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-20 04:06:26,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-11-20 04:06:26,878 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 16 [2019-11-20 04:06:26,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:06:26,878 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-11-20 04:06:26,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 04:06:26,878 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2019-11-20 04:06:26,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 04:06:26,880 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:06:26,881 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:06:26,881 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:06:26,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:26,881 INFO L82 PathProgramCache]: Analyzing trace with hash -440293124, now seen corresponding path program 1 times [2019-11-20 04:06:26,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:26,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177121588] [2019-11-20 04:06:26,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:26,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:06:26,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177121588] [2019-11-20 04:06:26,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:06:26,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 04:06:26,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201739746] [2019-11-20 04:06:26,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 04:06:26,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:06:26,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 04:06:26,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:06:26,998 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 5 states. [2019-11-20 04:06:27,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:06:27,195 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2019-11-20 04:06:27,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 04:06:27,198 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-20 04:06:27,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:06:27,199 INFO L225 Difference]: With dead ends: 48 [2019-11-20 04:06:27,199 INFO L226 Difference]: Without dead ends: 40 [2019-11-20 04:06:27,200 INFO L630 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-11-20 04:06:27,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-20 04:06:27,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2019-11-20 04:06:27,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-20 04:06:27,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-11-20 04:06:27,218 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 18 [2019-11-20 04:06:27,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:06:27,218 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-11-20 04:06:27,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 04:06:27,219 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-11-20 04:06:27,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 04:06:27,219 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:06:27,220 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:06:27,220 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:06:27,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:27,220 INFO L82 PathProgramCache]: Analyzing trace with hash 584409852, now seen corresponding path program 1 times [2019-11-20 04:06:27,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:27,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938983218] [2019-11-20 04:06:27,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:27,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:06:27,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938983218] [2019-11-20 04:06:27,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 04:06:27,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 04:06:27,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569158876] [2019-11-20 04:06:27,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 04:06:27,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:06:27,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 04:06:27,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 04:06:27,315 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 5 states. [2019-11-20 04:06:27,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:06:27,454 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2019-11-20 04:06:27,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 04:06:27,455 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-20 04:06:27,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:06:27,456 INFO L225 Difference]: With dead ends: 48 [2019-11-20 04:06:27,456 INFO L226 Difference]: Without dead ends: 37 [2019-11-20 04:06:27,457 INFO L630 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-11-20 04:06:27,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-20 04:06:27,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2019-11-20 04:06:27,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-20 04:06:27,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2019-11-20 04:06:27,462 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 18 [2019-11-20 04:06:27,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:06:27,462 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2019-11-20 04:06:27,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 04:06:27,462 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2019-11-20 04:06:27,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 04:06:27,463 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:06:27,463 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:06:27,464 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:06:27,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:27,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1573518424, now seen corresponding path program 1 times [2019-11-20 04:06:27,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:27,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102080803] [2019-11-20 04:06:27,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:27,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:06:27,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102080803] [2019-11-20 04:06:27,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255436393] [2019-11-20 04:06:27,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a297b9fc-36a3-4538-85df-6dc29540f570/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-11-20 04:06:27,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:27,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-20 04:06:27,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:27,794 INFO L377 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-11-20 04:06:27,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:27,799 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:27,799 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:27,800 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 04:06:27,837 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:27,838 INFO L377 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-11-20 04:06:27,839 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:27,857 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:27,869 INFO L377 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 11 treesize of output 7 [2019-11-20 04:06:27,869 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:27,882 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:27,882 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:27,883 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2019-11-20 04:06:27,913 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-20 04:06:27,914 INFO L377 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 1 case distinctions, treesize of input 27 treesize of output 11 [2019-11-20 04:06:27,914 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:27,928 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:27,928 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:27,928 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-11-20 04:06:27,963 INFO L377 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 19 treesize of output 18 [2019-11-20 04:06:27,964 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:27,973 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:27,974 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 04:06:27,975 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-11-20 04:06:28,043 INFO L377 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-11-20 04:06:28,044 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:28,050 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:28,051 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:28,051 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-11-20 04:06:28,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:06:28,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:06:28,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-11-20 04:06:28,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826887184] [2019-11-20 04:06:28,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 04:06:28,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:06:28,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 04:06:28,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 04:06:28,060 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 10 states. [2019-11-20 04:06:28,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:06:28,471 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2019-11-20 04:06:28,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 04:06:28,472 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-20 04:06:28,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:06:28,473 INFO L225 Difference]: With dead ends: 50 [2019-11-20 04:06:28,473 INFO L226 Difference]: Without dead ends: 46 [2019-11-20 04:06:28,474 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-11-20 04:06:28,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-20 04:06:28,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2019-11-20 04:06:28,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-20 04:06:28,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2019-11-20 04:06:28,485 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 20 [2019-11-20 04:06:28,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:06:28,486 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2019-11-20 04:06:28,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 04:06:28,490 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2019-11-20 04:06:28,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 04:06:28,491 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:06:28,491 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:06:28,696 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:06:28,696 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:06:28,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:28,697 INFO L82 PathProgramCache]: Analyzing trace with hash -710116760, now seen corresponding path program 1 times [2019-11-20 04:06:28,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:28,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383377641] [2019-11-20 04:06:28,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:28,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:28,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:06:28,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383377641] [2019-11-20 04:06:28,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628075275] [2019-11-20 04:06:28,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a297b9fc-36a3-4538-85df-6dc29540f570/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-11-20 04:06:28,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:28,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-20 04:06:28,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:28,978 INFO L377 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-11-20 04:06:28,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:28,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:28,981 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:28,981 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 04:06:29,013 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:29,013 INFO L377 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-11-20 04:06:29,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:29,025 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:29,036 INFO L377 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 11 treesize of output 7 [2019-11-20 04:06:29,037 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:29,056 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:29,056 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:29,057 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2019-11-20 04:06:29,080 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-20 04:06:29,081 INFO L377 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 1 case distinctions, treesize of input 27 treesize of output 11 [2019-11-20 04:06:29,081 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:29,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:29,088 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:29,088 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-11-20 04:06:29,114 INFO L377 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 19 treesize of output 18 [2019-11-20 04:06:29,115 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:29,125 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:29,126 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 04:06:29,126 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-11-20 04:06:29,167 INFO L377 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-11-20 04:06:29,168 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:29,174 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:29,175 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:29,175 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-11-20 04:06:29,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:06:29,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:06:29,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-11-20 04:06:29,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912024368] [2019-11-20 04:06:29,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 04:06:29,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:06:29,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 04:06:29,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 04:06:29,181 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 10 states. [2019-11-20 04:06:29,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:06:29,611 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2019-11-20 04:06:29,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 04:06:29,612 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-20 04:06:29,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:06:29,613 INFO L225 Difference]: With dead ends: 61 [2019-11-20 04:06:29,613 INFO L226 Difference]: Without dead ends: 55 [2019-11-20 04:06:29,614 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-11-20 04:06:29,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-20 04:06:29,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 43. [2019-11-20 04:06:29,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-20 04:06:29,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2019-11-20 04:06:29,621 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 20 [2019-11-20 04:06:29,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:06:29,621 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2019-11-20 04:06:29,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 04:06:29,621 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2019-11-20 04:06:29,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 04:06:29,622 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:06:29,622 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:06:29,823 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:06:29,823 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:06:29,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:29,824 INFO L82 PathProgramCache]: Analyzing trace with hash -274040989, now seen corresponding path program 1 times [2019-11-20 04:06:29,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:29,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937686236] [2019-11-20 04:06:29,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:30,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:06:30,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937686236] [2019-11-20 04:06:30,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303902850] [2019-11-20 04:06:30,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a297b9fc-36a3-4538-85df-6dc29540f570/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-11-20 04:06:30,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:30,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-20 04:06:30,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:30,091 INFO L377 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-11-20 04:06:30,091 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:30,093 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:30,094 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:30,094 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 04:06:30,140 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:30,140 INFO L377 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-11-20 04:06:30,141 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:30,147 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:30,147 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:30,147 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-11-20 04:06:30,176 INFO L377 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 13 treesize of output 9 [2019-11-20 04:06:30,176 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:30,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:30,207 INFO L377 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 13 treesize of output 9 [2019-11-20 04:06:30,208 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:30,224 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:30,225 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:30,225 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2019-11-20 04:06:30,273 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_20|], 2=[|v_#memory_$Pointer$.base_16|, |v_#memory_$Pointer$.offset_14|]} [2019-11-20 04:06:30,279 INFO L377 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 29 treesize of output 19 [2019-11-20 04:06:30,279 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:30,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:30,317 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:30,317 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 132 [2019-11-20 04:06:30,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:06:30,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:30,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:30,324 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-20 04:06:30,387 INFO L567 ElimStorePlain]: treesize reduction 188, result has 28.5 percent of original size [2019-11-20 04:06:30,394 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2019-11-20 04:06:30,395 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:30,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:30,406 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:30,406 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2019-11-20 04:06:30,446 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2019-11-20 04:06:30,447 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:30,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:30,459 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-20 04:06:30,460 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:30,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:30,467 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:30,467 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2019-11-20 04:06:30,473 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 04:06:30,473 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:30,479 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:30,480 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:30,480 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-20 04:06:30,483 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:06:30,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:06:30,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-11-20 04:06:30,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75315377] [2019-11-20 04:06:30,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 04:06:30,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:06:30,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 04:06:30,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-11-20 04:06:30,485 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand 14 states. [2019-11-20 04:06:30,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:06:30,915 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2019-11-20 04:06:30,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 04:06:30,916 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-11-20 04:06:30,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:06:30,917 INFO L225 Difference]: With dead ends: 63 [2019-11-20 04:06:30,917 INFO L226 Difference]: Without dead ends: 59 [2019-11-20 04:06:30,918 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-11-20 04:06:30,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-20 04:06:30,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2019-11-20 04:06:30,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-20 04:06:30,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2019-11-20 04:06:30,930 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 22 [2019-11-20 04:06:30,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:06:30,930 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2019-11-20 04:06:30,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 04:06:30,930 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2019-11-20 04:06:30,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 04:06:30,931 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:06:30,932 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:06:31,132 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:06:31,133 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:06:31,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:31,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1311709090, now seen corresponding path program 2 times [2019-11-20 04:06:31,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:31,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971959058] [2019-11-20 04:06:31,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:31,311 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:06:31,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971959058] [2019-11-20 04:06:31,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840182428] [2019-11-20 04:06:31,312 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a297b9fc-36a3-4538-85df-6dc29540f570/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-11-20 04:06:31,391 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 04:06:31,391 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 04:06:31,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-20 04:06:31,395 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:31,408 INFO L377 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-11-20 04:06:31,408 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:31,414 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:31,414 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:31,414 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 04:06:31,447 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:31,447 INFO L377 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-11-20 04:06:31,448 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:31,459 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:31,459 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:31,459 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-20 04:06:31,472 INFO L377 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 11 treesize of output 7 [2019-11-20 04:06:31,472 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:31,490 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:31,497 INFO L377 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 11 treesize of output 7 [2019-11-20 04:06:31,497 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:31,515 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:31,516 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:31,516 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:26 [2019-11-20 04:06:31,536 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_21|], 2=[|v_#memory_$Pointer$.base_18|, |v_#memory_$Pointer$.offset_16|]} [2019-11-20 04:06:31,542 INFO L377 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 23 treesize of output 15 [2019-11-20 04:06:31,542 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:31,567 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:31,598 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:31,599 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 108 [2019-11-20 04:06:31,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:06:31,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:31,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:31,603 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-20 04:06:31,657 INFO L567 ElimStorePlain]: treesize reduction 146, result has 30.1 percent of original size [2019-11-20 04:06:31,662 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 49 [2019-11-20 04:06:31,663 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:31,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:31,670 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:31,670 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:105, output treesize:27 [2019-11-20 04:06:31,699 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-11-20 04:06:31,700 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:31,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:31,712 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-11-20 04:06:31,712 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:31,717 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:31,717 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:31,717 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2019-11-20 04:06:31,723 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 04:06:31,723 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:31,725 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:31,725 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:31,726 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-20 04:06:31,729 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:06:31,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:06:31,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-11-20 04:06:31,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45947799] [2019-11-20 04:06:31,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 04:06:31,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:06:31,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 04:06:31,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-20 04:06:31,731 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand 10 states. [2019-11-20 04:06:32,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:06:32,065 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2019-11-20 04:06:32,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 04:06:32,066 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-11-20 04:06:32,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:06:32,066 INFO L225 Difference]: With dead ends: 65 [2019-11-20 04:06:32,067 INFO L226 Difference]: Without dead ends: 55 [2019-11-20 04:06:32,067 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-11-20 04:06:32,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-20 04:06:32,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2019-11-20 04:06:32,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-20 04:06:32,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2019-11-20 04:06:32,074 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 24 [2019-11-20 04:06:32,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:06:32,074 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2019-11-20 04:06:32,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 04:06:32,074 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2019-11-20 04:06:32,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 04:06:32,076 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:06:32,076 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:06:32,279 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:06:32,283 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:06:32,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:32,283 INFO L82 PathProgramCache]: Analyzing trace with hash 905043038, now seen corresponding path program 1 times [2019-11-20 04:06:32,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:32,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792578410] [2019-11-20 04:06:32,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:32,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:32,430 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 04:06:32,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792578410] [2019-11-20 04:06:32,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355095149] [2019-11-20 04:06:32,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a297b9fc-36a3-4538-85df-6dc29540f570/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-11-20 04:06:32,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:32,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-20 04:06:32,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:32,532 INFO L377 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-11-20 04:06:32,533 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:32,543 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:32,544 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:32,544 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 04:06:32,570 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:32,570 INFO L377 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-11-20 04:06:32,571 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:32,579 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:32,589 INFO L377 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 11 treesize of output 7 [2019-11-20 04:06:32,589 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:32,597 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:32,597 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:32,597 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2019-11-20 04:06:32,613 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-20 04:06:32,613 INFO L377 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 1 case distinctions, treesize of input 27 treesize of output 11 [2019-11-20 04:06:32,614 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:32,624 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:32,624 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:32,625 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-11-20 04:06:32,648 INFO L377 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 19 treesize of output 18 [2019-11-20 04:06:32,648 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:32,657 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:32,658 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 04:06:32,658 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-11-20 04:06:32,689 INFO L377 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-11-20 04:06:32,690 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:32,699 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:32,700 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:32,700 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-11-20 04:06:32,703 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 04:06:32,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:06:32,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-11-20 04:06:32,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547379165] [2019-11-20 04:06:32,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 04:06:32,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:06:32,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 04:06:32,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 04:06:32,705 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand 10 states. [2019-11-20 04:06:32,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:06:32,986 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2019-11-20 04:06:32,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 04:06:32,986 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-11-20 04:06:32,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:06:32,987 INFO L225 Difference]: With dead ends: 63 [2019-11-20 04:06:32,987 INFO L226 Difference]: Without dead ends: 50 [2019-11-20 04:06:32,988 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-11-20 04:06:32,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-20 04:06:32,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 40. [2019-11-20 04:06:32,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-20 04:06:32,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2019-11-20 04:06:32,994 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 24 [2019-11-20 04:06:32,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:06:32,994 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-11-20 04:06:32,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 04:06:32,995 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2019-11-20 04:06:32,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 04:06:32,996 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:06:32,996 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:06:33,200 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:06:33,200 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:06:33,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:33,200 INFO L82 PathProgramCache]: Analyzing trace with hash -719006641, now seen corresponding path program 2 times [2019-11-20 04:06:33,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:33,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060465195] [2019-11-20 04:06:33,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:33,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:33,436 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:06:33,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060465195] [2019-11-20 04:06:33,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976850493] [2019-11-20 04:06:33,436 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a297b9fc-36a3-4538-85df-6dc29540f570/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-11-20 04:06:33,516 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 04:06:33,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 04:06:33,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-20 04:06:33,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:33,530 INFO L377 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-11-20 04:06:33,530 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:33,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:33,536 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:33,536 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 04:06:33,562 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:33,563 INFO L377 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-11-20 04:06:33,564 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:33,597 INFO L567 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2019-11-20 04:06:33,602 INFO L377 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 11 treesize of output 7 [2019-11-20 04:06:33,602 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:33,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:33,616 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:33,616 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2019-11-20 04:06:33,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:06:33,659 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-20 04:06:33,659 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:33,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:33,669 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:33,669 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-11-20 04:06:33,710 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:33,710 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-20 04:06:33,711 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:33,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:33,736 INFO L377 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 19 treesize of output 18 [2019-11-20 04:06:33,736 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:33,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:33,747 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:33,747 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2019-11-20 04:06:33,791 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-20 04:06:33,792 INFO L377 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 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-20 04:06:33,792 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:33,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:33,804 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 04:06:33,804 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2019-11-20 04:06:33,846 INFO L377 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 26 treesize of output 28 [2019-11-20 04:06:33,847 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:33,871 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:33,872 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-20 04:06:33,872 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2019-11-20 04:06:33,945 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 04:06:33,946 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:33,955 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:33,955 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:33,956 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2019-11-20 04:06:33,982 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:06:33,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:06:33,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2019-11-20 04:06:33,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261033099] [2019-11-20 04:06:33,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-20 04:06:33,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:06:33,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-20 04:06:33,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2019-11-20 04:06:33,984 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 18 states. [2019-11-20 04:06:34,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:06:34,682 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2019-11-20 04:06:34,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-20 04:06:34,682 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-11-20 04:06:34,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:06:34,683 INFO L225 Difference]: With dead ends: 82 [2019-11-20 04:06:34,683 INFO L226 Difference]: Without dead ends: 76 [2019-11-20 04:06:34,684 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=183, Invalid=687, Unknown=0, NotChecked=0, Total=870 [2019-11-20 04:06:34,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-20 04:06:34,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 53. [2019-11-20 04:06:34,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-20 04:06:34,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2019-11-20 04:06:34,692 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 24 [2019-11-20 04:06:34,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:06:34,692 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2019-11-20 04:06:34,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-20 04:06:34,692 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2019-11-20 04:06:34,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 04:06:34,693 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:06:34,694 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:06:34,897 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:06:34,898 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:06:34,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:34,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1204744990, now seen corresponding path program 1 times [2019-11-20 04:06:34,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:34,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195595960] [2019-11-20 04:06:34,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:35,077 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:06:35,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195595960] [2019-11-20 04:06:35,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822688674] [2019-11-20 04:06:35,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a297b9fc-36a3-4538-85df-6dc29540f570/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-11-20 04:06:35,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:35,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-20 04:06:35,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:35,147 INFO L377 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-11-20 04:06:35,147 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:35,150 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:35,150 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:35,150 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 04:06:35,192 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:35,192 INFO L377 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-11-20 04:06:35,193 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:35,199 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:35,200 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:35,200 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-11-20 04:06:35,227 INFO L377 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 13 treesize of output 9 [2019-11-20 04:06:35,227 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:35,239 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:35,245 INFO L377 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 13 treesize of output 9 [2019-11-20 04:06:35,245 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:35,257 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:35,258 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:35,258 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2019-11-20 04:06:35,297 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_30|], 2=[|v_#memory_$Pointer$.base_23|, |v_#memory_$Pointer$.offset_18|]} [2019-11-20 04:06:35,306 INFO L377 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 29 treesize of output 19 [2019-11-20 04:06:35,307 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:35,324 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:35,353 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:35,354 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 132 [2019-11-20 04:06:35,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:06:35,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:35,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:35,358 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-20 04:06:35,419 INFO L567 ElimStorePlain]: treesize reduction 188, result has 28.5 percent of original size [2019-11-20 04:06:35,423 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2019-11-20 04:06:35,424 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:35,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:35,431 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:35,431 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2019-11-20 04:06:35,469 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2019-11-20 04:06:35,470 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:35,479 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:35,482 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-20 04:06:35,483 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:35,489 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:35,489 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:35,489 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2019-11-20 04:06:35,501 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 04:06:35,502 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:35,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:35,504 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:35,504 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-20 04:06:35,506 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:06:35,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:06:35,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-11-20 04:06:35,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206705043] [2019-11-20 04:06:35,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 04:06:35,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:06:35,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 04:06:35,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-11-20 04:06:35,508 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand 14 states. [2019-11-20 04:06:35,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:06:35,809 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2019-11-20 04:06:35,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 04:06:35,809 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-11-20 04:06:35,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:06:35,810 INFO L225 Difference]: With dead ends: 73 [2019-11-20 04:06:35,810 INFO L226 Difference]: Without dead ends: 60 [2019-11-20 04:06:35,811 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-11-20 04:06:35,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-20 04:06:35,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 48. [2019-11-20 04:06:35,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-20 04:06:35,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2019-11-20 04:06:35,818 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 24 [2019-11-20 04:06:35,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:06:35,819 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2019-11-20 04:06:35,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 04:06:35,819 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2019-11-20 04:06:35,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 04:06:35,820 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:06:35,821 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:06:36,023 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:06:36,024 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:06:36,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:36,024 INFO L82 PathProgramCache]: Analyzing trace with hash -419304689, now seen corresponding path program 1 times [2019-11-20 04:06:36,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:36,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22977501] [2019-11-20 04:06:36,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:36,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:36,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:06:36,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22977501] [2019-11-20 04:06:36,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543800377] [2019-11-20 04:06:36,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a297b9fc-36a3-4538-85df-6dc29540f570/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-11-20 04:06:36,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:36,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-20 04:06:36,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:36,269 INFO L377 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-11-20 04:06:36,269 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:36,273 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:36,273 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:36,274 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 04:06:36,298 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:36,298 INFO L377 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-11-20 04:06:36,299 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:36,320 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:36,326 INFO L377 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 11 treesize of output 7 [2019-11-20 04:06:36,326 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:36,338 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:36,338 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:36,338 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2019-11-20 04:06:36,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:06:36,354 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-20 04:06:36,354 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:36,363 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:36,363 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:36,364 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-11-20 04:06:36,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:06:36,421 INFO L377 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 19 treesize of output 18 [2019-11-20 04:06:36,422 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:36,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:36,439 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:36,439 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2019-11-20 04:06:36,484 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-20 04:06:36,484 INFO L377 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 34 treesize of output 21 [2019-11-20 04:06:36,484 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:36,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:36,494 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 04:06:36,494 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2019-11-20 04:06:36,563 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:36,564 INFO L377 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 2 case distinctions, treesize of input 26 treesize of output 68 [2019-11-20 04:06:36,564 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:36,604 INFO L567 ElimStorePlain]: treesize reduction 28, result has 59.4 percent of original size [2019-11-20 04:06:36,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:36,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:36,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:36,606 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-11-20 04:06:36,607 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:41 [2019-11-20 04:06:36,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:36,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:36,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:36,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:36,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:36,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:36,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:36,835 INFO L377 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-11-20 04:06:36,835 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:36,839 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:36,840 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:36,840 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-11-20 04:06:36,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:06:36,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:06:36,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2019-11-20 04:06:36,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173740051] [2019-11-20 04:06:36,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-20 04:06:36,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:06:36,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-20 04:06:36,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2019-11-20 04:06:36,846 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand 17 states. [2019-11-20 04:06:37,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:06:37,878 INFO L93 Difference]: Finished difference Result 94 states and 110 transitions. [2019-11-20 04:06:37,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-20 04:06:37,878 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2019-11-20 04:06:37,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:06:37,879 INFO L225 Difference]: With dead ends: 94 [2019-11-20 04:06:37,879 INFO L226 Difference]: Without dead ends: 88 [2019-11-20 04:06:37,880 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=221, Invalid=835, Unknown=0, NotChecked=0, Total=1056 [2019-11-20 04:06:37,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-20 04:06:37,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 52. [2019-11-20 04:06:37,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-20 04:06:37,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2019-11-20 04:06:37,886 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 24 [2019-11-20 04:06:37,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:06:37,886 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2019-11-20 04:06:37,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-20 04:06:37,887 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2019-11-20 04:06:37,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 04:06:37,888 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:06:37,888 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:06:38,092 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:06:38,092 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:06:38,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:38,092 INFO L82 PathProgramCache]: Analyzing trace with hash 573028938, now seen corresponding path program 3 times [2019-11-20 04:06:38,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:38,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749484350] [2019-11-20 04:06:38,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:38,378 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:06:38,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749484350] [2019-11-20 04:06:38,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843512037] [2019-11-20 04:06:38,379 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a297b9fc-36a3-4538-85df-6dc29540f570/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-11-20 04:06:38,438 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-20 04:06:38,438 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 04:06:38,440 WARN L253 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 62 conjunts are in the unsatisfiable core [2019-11-20 04:06:38,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:38,448 INFO L377 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-11-20 04:06:38,448 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:38,453 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:38,453 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:38,453 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 04:06:38,476 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:38,476 INFO L377 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-11-20 04:06:38,477 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:38,505 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-20 04:06:38,505 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:38,506 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-20 04:06:38,541 INFO L377 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 11 treesize of output 7 [2019-11-20 04:06:38,541 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:38,558 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:38,562 INFO L377 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 11 treesize of output 7 [2019-11-20 04:06:38,562 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:38,577 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:38,578 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:38,578 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-11-20 04:06:38,626 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:38,627 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 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-11-20 04:06:38,627 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:38,657 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:38,658 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_36|], 2=[|v_#memory_$Pointer$.base_26|, |v_#memory_$Pointer$.offset_21|]} [2019-11-20 04:06:38,663 INFO L377 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 11 treesize of output 7 [2019-11-20 04:06:38,663 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:38,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:38,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:06:38,697 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 19 [2019-11-20 04:06:38,697 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:38,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:38,722 INFO L377 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 30 treesize of output 14 [2019-11-20 04:06:38,723 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:38,739 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:38,740 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:38,740 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:96, output treesize:47 [2019-11-20 04:06:38,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:06:38,788 INFO L377 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 55 treesize of output 19 [2019-11-20 04:06:38,788 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:38,814 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:38,821 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 04:06:38,831 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:38,832 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 102 [2019-11-20 04:06:38,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:38,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:38,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:38,836 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:38,923 INFO L567 ElimStorePlain]: treesize reduction 8, result has 93.4 percent of original size [2019-11-20 04:06:38,950 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:38,950 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 109 [2019-11-20 04:06:38,951 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:39,016 INFO L567 ElimStorePlain]: treesize reduction 24, result has 76.5 percent of original size [2019-11-20 04:06:39,017 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:39,017 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:169, output treesize:83 [2019-11-20 04:06:39,079 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_38|], 5=[|v_#memory_$Pointer$.base_28|, |v_#memory_$Pointer$.offset_23|]} [2019-11-20 04:06:39,086 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2019-11-20 04:06:39,087 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:39,157 INFO L567 ElimStorePlain]: treesize reduction 16, result has 91.8 percent of original size [2019-11-20 04:06:39,219 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:39,219 INFO L377 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 167 [2019-11-20 04:06:39,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:39,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:39,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:06:39,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:39,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:39,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:39,230 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2019-11-20 04:06:39,313 INFO L567 ElimStorePlain]: treesize reduction 706, result has 14.9 percent of original size [2019-11-20 04:06:39,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:06:39,338 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:39,339 INFO L377 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 1 case distinctions, treesize of input 120 treesize of output 157 [2019-11-20 04:06:39,339 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:39,351 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:39,352 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:39,352 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:206, output treesize:60 [2019-11-20 04:06:39,436 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:39,436 INFO L377 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 57 treesize of output 40 [2019-11-20 04:06:39,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:39,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:39,438 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 04:06:39,468 INFO L567 ElimStorePlain]: treesize reduction 8, result has 85.5 percent of original size [2019-11-20 04:06:39,474 INFO L377 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-11-20 04:06:39,475 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:39,484 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:39,485 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 04:06:39,485 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:29 [2019-11-20 04:06:39,561 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:39,562 INFO L377 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 29 [2019-11-20 04:06:39,562 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:39,577 INFO L567 ElimStorePlain]: treesize reduction 4, result has 80.0 percent of original size [2019-11-20 04:06:39,577 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:39,578 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:3 [2019-11-20 04:06:39,585 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:06:39,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:06:39,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2019-11-20 04:06:39,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257637289] [2019-11-20 04:06:39,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-20 04:06:39,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:06:39,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-20 04:06:39,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2019-11-20 04:06:39,587 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand 19 states. [2019-11-20 04:06:40,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:06:40,387 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2019-11-20 04:06:40,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-20 04:06:40,388 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 26 [2019-11-20 04:06:40,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:06:40,389 INFO L225 Difference]: With dead ends: 81 [2019-11-20 04:06:40,389 INFO L226 Difference]: Without dead ends: 77 [2019-11-20 04:06:40,390 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2019-11-20 04:06:40,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-20 04:06:40,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 61. [2019-11-20 04:06:40,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-20 04:06:40,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2019-11-20 04:06:40,402 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 26 [2019-11-20 04:06:40,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:06:40,403 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2019-11-20 04:06:40,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-20 04:06:40,403 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2019-11-20 04:06:40,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 04:06:40,407 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:06:40,407 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:06:40,607 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:06:40,608 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:06:40,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:40,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1624106954, now seen corresponding path program 1 times [2019-11-20 04:06:40,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:40,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22182457] [2019-11-20 04:06:40,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:40,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:40,819 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:06:40,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22182457] [2019-11-20 04:06:40,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407320934] [2019-11-20 04:06:40,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a297b9fc-36a3-4538-85df-6dc29540f570/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:06:40,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:40,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-20 04:06:40,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:40,907 INFO L377 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-11-20 04:06:40,907 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:40,913 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:40,913 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:40,913 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 04:06:40,930 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:40,930 INFO L377 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-11-20 04:06:40,930 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:40,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:40,958 INFO L377 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 11 treesize of output 7 [2019-11-20 04:06:40,958 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:40,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:40,975 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:40,975 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2019-11-20 04:06:40,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:06:40,986 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-20 04:06:40,986 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:40,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:40,994 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:40,994 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-11-20 04:06:41,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:06:41,024 INFO L377 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 19 treesize of output 18 [2019-11-20 04:06:41,024 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:41,037 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:41,037 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:41,038 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2019-11-20 04:06:41,094 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-20 04:06:41,094 INFO L377 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 34 treesize of output 21 [2019-11-20 04:06:41,095 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:41,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:41,109 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 04:06:41,109 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2019-11-20 04:06:41,200 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:41,200 INFO L377 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 2 case distinctions, treesize of input 26 treesize of output 68 [2019-11-20 04:06:41,201 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:41,267 INFO L567 ElimStorePlain]: treesize reduction 28, result has 59.4 percent of original size [2019-11-20 04:06:41,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:41,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:41,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:41,270 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-11-20 04:06:41,270 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:41 [2019-11-20 04:06:41,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:41,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:41,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:41,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:41,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:41,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:41,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:41,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:41,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:41,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:41,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:41,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:41,446 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2019-11-20 04:06:41,446 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:41,453 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2019-11-20 04:06:41,453 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:41,495 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:41,495 INFO L377 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 37 [2019-11-20 04:06:41,496 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:41,534 INFO L567 ElimStorePlain]: treesize reduction 21, result has 44.7 percent of original size [2019-11-20 04:06:41,534 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-20 04:06:41,534 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:86, output treesize:7 [2019-11-20 04:06:41,558 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:06:41,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:06:41,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 16 [2019-11-20 04:06:41,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874474132] [2019-11-20 04:06:41,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 04:06:41,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:06:41,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 04:06:41,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-11-20 04:06:41,561 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 16 states. [2019-11-20 04:06:42,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:06:42,405 INFO L93 Difference]: Finished difference Result 112 states and 131 transitions. [2019-11-20 04:06:42,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-20 04:06:42,406 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-11-20 04:06:42,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:06:42,407 INFO L225 Difference]: With dead ends: 112 [2019-11-20 04:06:42,407 INFO L226 Difference]: Without dead ends: 100 [2019-11-20 04:06:42,408 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 18 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=226, Invalid=830, Unknown=0, NotChecked=0, Total=1056 [2019-11-20 04:06:42,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-20 04:06:42,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 80. [2019-11-20 04:06:42,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-20 04:06:42,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 95 transitions. [2019-11-20 04:06:42,416 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 95 transitions. Word has length 26 [2019-11-20 04:06:42,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:06:42,416 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 95 transitions. [2019-11-20 04:06:42,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 04:06:42,417 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2019-11-20 04:06:42,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 04:06:42,418 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:06:42,418 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:06:42,621 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:06:42,622 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:06:42,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:42,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1646157366, now seen corresponding path program 2 times [2019-11-20 04:06:42,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:42,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325209809] [2019-11-20 04:06:42,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:42,856 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:06:42,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325209809] [2019-11-20 04:06:42,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373498709] [2019-11-20 04:06:42,857 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a297b9fc-36a3-4538-85df-6dc29540f570/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:06:42,916 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 04:06:42,917 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 04:06:42,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 50 conjunts are in the unsatisfiable core [2019-11-20 04:06:42,921 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:42,925 INFO L377 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-11-20 04:06:42,926 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:42,943 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:42,943 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:42,943 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 04:06:42,966 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:42,967 INFO L377 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-11-20 04:06:42,967 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:42,999 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-11-20 04:06:43,000 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:43,000 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-11-20 04:06:43,033 INFO L377 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 11 treesize of output 7 [2019-11-20 04:06:43,033 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:43,055 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:43,060 INFO L377 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 11 treesize of output 7 [2019-11-20 04:06:43,060 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:43,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:43,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:43,079 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:40 [2019-11-20 04:06:43,134 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:43,134 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 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-11-20 04:06:43,135 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:43,158 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:43,159 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_44|], 2=[|v_#memory_$Pointer$.offset_26|, |v_#memory_$Pointer$.base_31|]} [2019-11-20 04:06:43,168 INFO L377 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 11 treesize of output 7 [2019-11-20 04:06:43,168 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:43,201 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:43,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:06:43,208 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-20 04:06:43,209 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:43,231 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:43,259 INFO L343 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-11-20 04:06:43,260 INFO L377 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 1 case distinctions, treesize of input 39 treesize of output 27 [2019-11-20 04:06:43,260 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:43,315 INFO L567 ElimStorePlain]: treesize reduction 8, result has 82.2 percent of original size [2019-11-20 04:06:43,315 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:43,315 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:86, output treesize:37 [2019-11-20 04:06:43,371 INFO L377 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 100 [2019-11-20 04:06:43,372 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:43,406 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:43,411 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:06:43,413 INFO L377 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 55 treesize of output 19 [2019-11-20 04:06:43,413 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:43,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:43,450 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:43,450 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 105 [2019-11-20 04:06:43,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:06:43,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:43,452 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-11-20 04:06:43,503 INFO L567 ElimStorePlain]: treesize reduction 94, result has 49.2 percent of original size [2019-11-20 04:06:43,504 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:43,504 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:145, output treesize:84 [2019-11-20 04:06:43,554 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_28|, |v_#memory_int_46|], 6=[|v_#memory_$Pointer$.base_33|]} [2019-11-20 04:06:43,575 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:43,575 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 209 treesize of output 199 [2019-11-20 04:06:43,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:06:43,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:43,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:43,579 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-20 04:06:43,641 INFO L567 ElimStorePlain]: treesize reduction 334, result has 32.9 percent of original size [2019-11-20 04:06:43,645 INFO L377 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 152 treesize of output 137 [2019-11-20 04:06:43,646 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:43,666 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:43,713 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:43,714 INFO L377 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 160 [2019-11-20 04:06:43,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:06:43,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:43,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:43,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:43,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:43,719 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-11-20 04:06:43,771 INFO L567 ElimStorePlain]: treesize reduction 480, result has 15.6 percent of original size [2019-11-20 04:06:43,771 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 04:06:43,772 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:220, output treesize:88 [2019-11-20 04:06:43,819 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|#memory_$Pointer$.base|]} [2019-11-20 04:06:43,827 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 64 [2019-11-20 04:06:43,828 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:43,845 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:43,855 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:43,855 INFO L377 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 76 treesize of output 47 [2019-11-20 04:06:43,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:06:43,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:06:43,857 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 04:06:43,878 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-20 04:06:43,879 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 04:06:43,879 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:99, output treesize:19 [2019-11-20 04:06:43,942 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:06:43,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:06:43,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2019-11-20 04:06:43,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538958616] [2019-11-20 04:06:43,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-20 04:06:43,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:06:43,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-20 04:06:43,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2019-11-20 04:06:43,944 INFO L87 Difference]: Start difference. First operand 80 states and 95 transitions. Second operand 19 states. [2019-11-20 04:06:44,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:06:44,635 INFO L93 Difference]: Finished difference Result 102 states and 120 transitions. [2019-11-20 04:06:44,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 04:06:44,635 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 26 [2019-11-20 04:06:44,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:06:44,636 INFO L225 Difference]: With dead ends: 102 [2019-11-20 04:06:44,636 INFO L226 Difference]: Without dead ends: 96 [2019-11-20 04:06:44,637 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2019-11-20 04:06:44,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-20 04:06:44,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 82. [2019-11-20 04:06:44,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-20 04:06:44,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 97 transitions. [2019-11-20 04:06:44,646 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 97 transitions. Word has length 26 [2019-11-20 04:06:44,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:06:44,646 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 97 transitions. [2019-11-20 04:06:44,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-20 04:06:44,646 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 97 transitions. [2019-11-20 04:06:44,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-20 04:06:44,652 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:06:44,652 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:06:44,856 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:06:44,856 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:06:44,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:44,857 INFO L82 PathProgramCache]: Analyzing trace with hash 973671813, now seen corresponding path program 4 times [2019-11-20 04:06:44,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:44,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192577939] [2019-11-20 04:06:44,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:44,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:45,393 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:06:45,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192577939] [2019-11-20 04:06:45,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607402627] [2019-11-20 04:06:45,394 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a297b9fc-36a3-4538-85df-6dc29540f570/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:06:45,469 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-20 04:06:45,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 04:06:45,471 WARN L253 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 60 conjunts are in the unsatisfiable core [2019-11-20 04:06:45,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:45,478 INFO L377 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-11-20 04:06:45,478 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:45,484 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:45,484 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:45,484 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 04:06:45,525 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:45,526 INFO L377 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-11-20 04:06:45,526 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:45,566 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-11-20 04:06:45,566 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:45,567 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-11-20 04:06:45,620 INFO L377 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 11 treesize of output 7 [2019-11-20 04:06:45,620 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:45,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:45,652 INFO L377 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 11 treesize of output 7 [2019-11-20 04:06:45,652 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:45,676 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:45,677 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:45,677 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:40 [2019-11-20 04:06:45,749 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:45,749 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 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-11-20 04:06:45,750 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:45,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:45,830 INFO L343 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-11-20 04:06:45,830 INFO L377 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 1 case distinctions, treesize of input 39 treesize of output 27 [2019-11-20 04:06:45,830 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:45,887 INFO L567 ElimStorePlain]: treesize reduction 8, result has 85.7 percent of original size [2019-11-20 04:06:45,892 INFO L377 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 23 treesize of output 11 [2019-11-20 04:06:45,892 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:45,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:45,909 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:45,910 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:78, output treesize:33 [2019-11-20 04:06:45,989 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:45,989 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 111 [2019-11-20 04:06:45,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:45,991 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:46,054 INFO L567 ElimStorePlain]: treesize reduction 26, result has 79.4 percent of original size [2019-11-20 04:06:46,058 INFO L377 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 63 [2019-11-20 04:06:46,059 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:46,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:46,082 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:46,082 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:108, output treesize:103 [2019-11-20 04:06:46,152 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_47|], 6=[|v_#memory_$Pointer$.base_37|, |v_#memory_$Pointer$.offset_32|]} [2019-11-20 04:06:46,158 INFO L377 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 53 treesize of output 35 [2019-11-20 04:06:46,158 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:46,192 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:46,262 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:46,263 INFO L377 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 271 treesize of output 250 [2019-11-20 04:06:46,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:06:46,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:06:46,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:06:46,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:46,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:46,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:46,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:46,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:46,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:46,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:06:46,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:46,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:46,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:46,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:46,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:46,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:46,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:06:46,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:46,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:46,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:46,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:46,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:46,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:46,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:06:46,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:06:46,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:46,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:46,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:46,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:46,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:46,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:46,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:06:46,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:46,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:46,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:46,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:46,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:46,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:46,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:06:46,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:46,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:46,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:46,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:46,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:46,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:46,308 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 10 xjuncts. [2019-11-20 04:06:46,540 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 37 [2019-11-20 04:06:46,541 INFO L567 ElimStorePlain]: treesize reduction 3955, result has 4.6 percent of original size [2019-11-20 04:06:46,579 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:46,580 INFO L377 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 5 new quantified variables, introduced 2 case distinctions, treesize of input 186 treesize of output 209 [2019-11-20 04:06:46,581 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:46,613 INFO L567 ElimStorePlain]: treesize reduction 100, result has 47.4 percent of original size [2019-11-20 04:06:46,613 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:46,613 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:292, output treesize:90 [2019-11-20 04:06:46,793 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:46,793 INFO L377 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 121 treesize of output 70 [2019-11-20 04:06:46,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:06:46,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:06:46,796 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 04:06:46,838 INFO L567 ElimStorePlain]: treesize reduction 22, result has 69.0 percent of original size [2019-11-20 04:06:46,843 INFO L377 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 12 [2019-11-20 04:06:46,843 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:46,855 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:46,855 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 04:06:46,856 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:128, output treesize:18 [2019-11-20 04:06:46,920 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:46,921 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2019-11-20 04:06:46,921 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:46,926 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:46,927 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:46,927 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-11-20 04:06:46,937 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:06:46,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:06:46,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2019-11-20 04:06:46,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572434918] [2019-11-20 04:06:46,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-20 04:06:46,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:06:46,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-20 04:06:46,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-11-20 04:06:46,940 INFO L87 Difference]: Start difference. First operand 82 states and 97 transitions. Second operand 21 states. [2019-11-20 04:06:48,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:06:48,564 INFO L93 Difference]: Finished difference Result 116 states and 135 transitions. [2019-11-20 04:06:48,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-20 04:06:48,565 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2019-11-20 04:06:48,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:06:48,566 INFO L225 Difference]: With dead ends: 116 [2019-11-20 04:06:48,566 INFO L226 Difference]: Without dead ends: 110 [2019-11-20 04:06:48,566 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=139, Invalid=983, Unknown=0, NotChecked=0, Total=1122 [2019-11-20 04:06:48,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-20 04:06:48,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 92. [2019-11-20 04:06:48,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-20 04:06:48,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 109 transitions. [2019-11-20 04:06:48,575 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 109 transitions. Word has length 28 [2019-11-20 04:06:48,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:06:48,576 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 109 transitions. [2019-11-20 04:06:48,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-20 04:06:48,576 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 109 transitions. [2019-11-20 04:06:48,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-20 04:06:48,577 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:06:48,577 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:06:48,781 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:06:48,781 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:06:48,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:48,781 INFO L82 PathProgramCache]: Analyzing trace with hash 2035331126, now seen corresponding path program 2 times [2019-11-20 04:06:48,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:48,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824340179] [2019-11-20 04:06:48,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:48,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:49,045 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:06:49,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824340179] [2019-11-20 04:06:49,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589554442] [2019-11-20 04:06:49,046 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a297b9fc-36a3-4538-85df-6dc29540f570/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:06:49,103 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 04:06:49,103 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 04:06:49,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 52 conjunts are in the unsatisfiable core [2019-11-20 04:06:49,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:49,118 INFO L377 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-11-20 04:06:49,118 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:49,124 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:49,124 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:49,124 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 04:06:49,156 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:49,156 INFO L377 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-11-20 04:06:49,157 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:49,203 INFO L567 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2019-11-20 04:06:49,209 INFO L377 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 11 treesize of output 7 [2019-11-20 04:06:49,209 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:49,222 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:49,222 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:49,223 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2019-11-20 04:06:49,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:06:49,270 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-20 04:06:49,271 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:49,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:49,280 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:49,280 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-11-20 04:06:49,320 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:49,320 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-20 04:06:49,321 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:49,339 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:49,347 INFO L377 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 19 treesize of output 18 [2019-11-20 04:06:49,348 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:49,367 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:49,367 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:49,367 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2019-11-20 04:06:49,421 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-20 04:06:49,422 INFO L377 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 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-20 04:06:49,422 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:49,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:49,441 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 04:06:49,442 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2019-11-20 04:06:49,487 INFO L377 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 26 treesize of output 28 [2019-11-20 04:06:49,488 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:49,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:49,514 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 04:06:49,514 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:40 [2019-11-20 04:06:49,596 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-20 04:06:49,596 INFO L377 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 41 treesize of output 31 [2019-11-20 04:06:49,597 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:49,621 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:49,621 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-20 04:06:49,622 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:59, output treesize:40 [2019-11-20 04:06:49,761 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:49,761 INFO L377 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 3 case distinctions, treesize of input 33 treesize of output 102 [2019-11-20 04:06:49,762 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:49,885 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2019-11-20 04:06:49,886 INFO L567 ElimStorePlain]: treesize reduction 44, result has 59.3 percent of original size [2019-11-20 04:06:49,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:49,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:49,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:49,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:49,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:49,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:49,892 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-20 04:06:49,892 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:48, output treesize:64 [2019-11-20 04:06:49,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:49,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:49,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:49,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:49,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:49,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:49,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:49,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:49,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:49,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:49,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:49,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:50,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:50,278 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-20 04:06:50,279 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:50,291 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:50,292 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:50,292 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2019-11-20 04:06:50,302 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:06:50,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:06:50,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2019-11-20 04:06:50,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136724649] [2019-11-20 04:06:50,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-20 04:06:50,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:06:50,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-20 04:06:50,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2019-11-20 04:06:50,304 INFO L87 Difference]: Start difference. First operand 92 states and 109 transitions. Second operand 23 states. [2019-11-20 04:06:50,870 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2019-11-20 04:06:51,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:06:51,976 INFO L93 Difference]: Finished difference Result 138 states and 163 transitions. [2019-11-20 04:06:51,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-20 04:06:51,977 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 28 [2019-11-20 04:06:51,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:06:51,978 INFO L225 Difference]: With dead ends: 138 [2019-11-20 04:06:51,978 INFO L226 Difference]: Without dead ends: 130 [2019-11-20 04:06:51,979 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=234, Invalid=1026, Unknown=0, NotChecked=0, Total=1260 [2019-11-20 04:06:51,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-20 04:06:51,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 88. [2019-11-20 04:06:51,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-20 04:06:51,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 103 transitions. [2019-11-20 04:06:51,988 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 103 transitions. Word has length 28 [2019-11-20 04:06:51,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:06:51,988 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 103 transitions. [2019-11-20 04:06:51,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-20 04:06:51,988 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 103 transitions. [2019-11-20 04:06:51,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-20 04:06:51,990 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:06:51,991 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:06:52,195 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:06:52,195 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:06:52,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:52,195 INFO L82 PathProgramCache]: Analyzing trace with hash -555581952, now seen corresponding path program 5 times [2019-11-20 04:06:52,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:52,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437281039] [2019-11-20 04:06:52,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:52,638 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:06:52,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437281039] [2019-11-20 04:06:52,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230386151] [2019-11-20 04:06:52,639 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a297b9fc-36a3-4538-85df-6dc29540f570/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:06:52,703 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-11-20 04:06:52,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 04:06:52,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 61 conjunts are in the unsatisfiable core [2019-11-20 04:06:52,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:52,719 INFO L377 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-11-20 04:06:52,720 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:52,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:52,730 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:52,730 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 04:06:52,760 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:52,760 INFO L377 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-11-20 04:06:52,761 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:52,803 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-11-20 04:06:52,803 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:52,804 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-11-20 04:06:52,854 INFO L377 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 11 treesize of output 7 [2019-11-20 04:06:52,855 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:52,877 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:52,881 INFO L377 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 11 treesize of output 7 [2019-11-20 04:06:52,882 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:52,906 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:52,907 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:52,907 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:40 [2019-11-20 04:06:52,981 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:52,981 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 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-11-20 04:06:52,982 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:53,019 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:53,026 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:06:53,028 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-20 04:06:53,028 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:53,058 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:53,081 INFO L343 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-11-20 04:06:53,081 INFO L377 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 1 case distinctions, treesize of input 39 treesize of output 27 [2019-11-20 04:06:53,082 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:53,109 INFO L567 ElimStorePlain]: treesize reduction 8, result has 80.5 percent of original size [2019-11-20 04:06:53,110 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:53,110 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:78, output treesize:33 [2019-11-20 04:06:53,167 INFO L377 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 71 [2019-11-20 04:06:53,168 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:53,188 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:53,219 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:53,220 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 107 [2019-11-20 04:06:53,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:53,221 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:53,271 INFO L567 ElimStorePlain]: treesize reduction 26, result has 78.0 percent of original size [2019-11-20 04:06:53,271 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:53,271 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:108, output treesize:103 [2019-11-20 04:06:53,344 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_55|], 6=[|v_#memory_$Pointer$.offset_37|, |v_#memory_$Pointer$.base_43|]} [2019-11-20 04:06:53,354 INFO L377 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 53 treesize of output 35 [2019-11-20 04:06:53,354 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:53,393 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:53,457 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:53,457 INFO L377 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 5 new quantified variables, introduced 2 case distinctions, treesize of input 263 treesize of output 246 [2019-11-20 04:06:53,459 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:53,520 INFO L567 ElimStorePlain]: treesize reduction 100, result has 59.5 percent of original size [2019-11-20 04:06:53,565 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:53,565 INFO L377 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 144 treesize of output 134 [2019-11-20 04:06:53,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:06:53,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:53,568 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:53,624 INFO L567 ElimStorePlain]: treesize reduction 217, result has 29.5 percent of original size [2019-11-20 04:06:53,625 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:53,625 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:292, output treesize:90 [2019-11-20 04:06:53,913 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:53,913 INFO L377 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 121 treesize of output 70 [2019-11-20 04:06:53,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:06:53,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:06:53,915 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 04:06:53,965 INFO L567 ElimStorePlain]: treesize reduction 22, result has 69.0 percent of original size [2019-11-20 04:06:53,969 INFO L377 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 12 [2019-11-20 04:06:53,969 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:53,981 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:53,982 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 04:06:53,982 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:128, output treesize:18 [2019-11-20 04:06:54,040 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:54,041 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2019-11-20 04:06:54,041 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:54,057 INFO L567 ElimStorePlain]: treesize reduction 4, result has 66.7 percent of original size [2019-11-20 04:06:54,057 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:54,058 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-11-20 04:06:54,066 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:06:54,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:06:54,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2019-11-20 04:06:54,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717471775] [2019-11-20 04:06:54,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-20 04:06:54,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:06:54,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-20 04:06:54,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-11-20 04:06:54,068 INFO L87 Difference]: Start difference. First operand 88 states and 103 transitions. Second operand 21 states. [2019-11-20 04:06:55,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:06:55,243 INFO L93 Difference]: Finished difference Result 112 states and 129 transitions. [2019-11-20 04:06:55,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-20 04:06:55,244 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2019-11-20 04:06:55,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:06:55,245 INFO L225 Difference]: With dead ends: 112 [2019-11-20 04:06:55,245 INFO L226 Difference]: Without dead ends: 92 [2019-11-20 04:06:55,245 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=131, Invalid=925, Unknown=0, NotChecked=0, Total=1056 [2019-11-20 04:06:55,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-20 04:06:55,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 68. [2019-11-20 04:06:55,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-20 04:06:55,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2019-11-20 04:06:55,252 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 30 [2019-11-20 04:06:55,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:06:55,252 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2019-11-20 04:06:55,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-20 04:06:55,253 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2019-11-20 04:06:55,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-20 04:06:55,253 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:06:55,253 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:06:55,454 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:06:55,454 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:06:55,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:55,455 INFO L82 PathProgramCache]: Analyzing trace with hash 464137216, now seen corresponding path program 2 times [2019-11-20 04:06:55,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:55,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326168010] [2019-11-20 04:06:55,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:55,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:55,644 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 04:06:55,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326168010] [2019-11-20 04:06:55,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820261715] [2019-11-20 04:06:55,644 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a297b9fc-36a3-4538-85df-6dc29540f570/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:06:55,703 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 04:06:55,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 04:06:55,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-20 04:06:55,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:55,710 INFO L377 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-11-20 04:06:55,711 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:55,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:55,715 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:55,715 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 04:06:55,736 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:55,737 INFO L377 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-11-20 04:06:55,737 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:55,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:55,750 INFO L377 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 11 treesize of output 7 [2019-11-20 04:06:55,750 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:55,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:55,767 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:55,767 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2019-11-20 04:06:55,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:06:55,779 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-20 04:06:55,779 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:55,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:55,787 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:55,787 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-11-20 04:06:55,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:06:55,806 INFO L377 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 19 treesize of output 18 [2019-11-20 04:06:55,806 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:55,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:55,816 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:55,816 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2019-11-20 04:06:55,859 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-20 04:06:55,859 INFO L377 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 34 treesize of output 21 [2019-11-20 04:06:55,860 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:55,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:55,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 04:06:55,873 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2019-11-20 04:06:55,938 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:55,939 INFO L377 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 2 case distinctions, treesize of input 26 treesize of output 68 [2019-11-20 04:06:55,939 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:56,005 INFO L567 ElimStorePlain]: treesize reduction 28, result has 59.4 percent of original size [2019-11-20 04:06:56,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:56,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:56,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:56,007 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-11-20 04:06:56,007 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:41 [2019-11-20 04:06:56,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:56,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:56,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:56,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:56,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:56,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:56,047 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2019-11-20 04:06:56,048 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:56,054 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2019-11-20 04:06:56,055 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:56,076 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:56,076 INFO L377 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 37 [2019-11-20 04:06:56,076 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:56,099 INFO L567 ElimStorePlain]: treesize reduction 25, result has 40.5 percent of original size [2019-11-20 04:06:56,100 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-20 04:06:56,100 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:86, output treesize:7 [2019-11-20 04:06:56,105 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 04:06:56,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:06:56,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2019-11-20 04:06:56,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860697994] [2019-11-20 04:06:56,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 04:06:56,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:06:56,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 04:06:56,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-11-20 04:06:56,107 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand 13 states. [2019-11-20 04:06:56,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:06:56,617 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2019-11-20 04:06:56,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-20 04:06:56,618 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2019-11-20 04:06:56,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:06:56,619 INFO L225 Difference]: With dead ends: 95 [2019-11-20 04:06:56,619 INFO L226 Difference]: Without dead ends: 80 [2019-11-20 04:06:56,620 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=459, Unknown=0, NotChecked=0, Total=600 [2019-11-20 04:06:56,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-20 04:06:56,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 68. [2019-11-20 04:06:56,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-20 04:06:56,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2019-11-20 04:06:56,626 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 30 [2019-11-20 04:06:56,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:06:56,626 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2019-11-20 04:06:56,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 04:06:56,626 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2019-11-20 04:06:56,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-20 04:06:56,627 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:06:56,627 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:06:56,830 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:06:56,831 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:06:56,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:06:56,831 INFO L82 PathProgramCache]: Analyzing trace with hash 2095788465, now seen corresponding path program 6 times [2019-11-20 04:06:56,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:06:56,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935400695] [2019-11-20 04:06:56,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:06:56,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:06:57,251 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:06:57,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935400695] [2019-11-20 04:06:57,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968761132] [2019-11-20 04:06:57,251 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a297b9fc-36a3-4538-85df-6dc29540f570/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:06:57,333 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-11-20 04:06:57,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 04:06:57,335 WARN L253 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 79 conjunts are in the unsatisfiable core [2019-11-20 04:06:57,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:06:57,346 INFO L377 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-11-20 04:06:57,346 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:57,351 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:57,351 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:57,351 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-20 04:06:57,374 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:57,375 INFO L377 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-11-20 04:06:57,375 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:57,404 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-20 04:06:57,404 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:57,404 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-20 04:06:57,412 INFO L377 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 11 treesize of output 7 [2019-11-20 04:06:57,413 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:57,429 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:57,439 INFO L377 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 11 treesize of output 7 [2019-11-20 04:06:57,440 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:57,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:57,455 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:57,456 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-11-20 04:06:57,479 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:57,479 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-20 04:06:57,480 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:57,509 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:57,510 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_61|], 2=[|v_#memory_$Pointer$.base_46|, |v_#memory_$Pointer$.offset_40|]} [2019-11-20 04:06:57,515 INFO L377 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 11 treesize of output 7 [2019-11-20 04:06:57,515 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:57,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:57,548 INFO L377 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 23 treesize of output 11 [2019-11-20 04:06:57,548 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:57,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:57,588 INFO L377 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 30 treesize of output 14 [2019-11-20 04:06:57,588 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:57,614 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:57,615 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:57,615 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:88, output treesize:47 [2019-11-20 04:06:57,665 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-20 04:06:57,691 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:57,692 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 129 [2019-11-20 04:06:57,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:57,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:57,694 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:57,765 INFO L567 ElimStorePlain]: treesize reduction 8, result has 95.0 percent of original size [2019-11-20 04:06:57,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:06:57,770 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2019-11-20 04:06:57,770 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:57,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:57,811 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:57,811 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 109 [2019-11-20 04:06:57,812 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:57,853 INFO L567 ElimStorePlain]: treesize reduction 24, result has 76.5 percent of original size [2019-11-20 04:06:57,853 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:57,854 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:169, output treesize:83 [2019-11-20 04:06:57,895 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_63|], 5=[|v_#memory_$Pointer$.base_48|, |v_#memory_$Pointer$.offset_42|]} [2019-11-20 04:06:57,901 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:06:57,901 INFO L377 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 23 treesize of output 22 [2019-11-20 04:06:57,902 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:57,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:57,982 INFO L343 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2019-11-20 04:06:57,983 INFO L377 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 88 treesize of output 74 [2019-11-20 04:06:57,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:57,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:57,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:57,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:57,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:57,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:57,986 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 04:06:58,049 INFO L567 ElimStorePlain]: treesize reduction 24, result has 76.7 percent of original size [2019-11-20 04:06:58,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:06:58,054 INFO L377 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 37 treesize of output 24 [2019-11-20 04:06:58,054 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:58,076 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:58,077 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:58,077 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:127, output treesize:69 [2019-11-20 04:06:58,128 INFO L392 ElimStorePlain]: Different costs {5=[|v_#memory_$Pointer$.base_49|, |v_#memory_$Pointer$.offset_43|], 6=[|v_#memory_int_64|]} [2019-11-20 04:06:58,187 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:58,188 INFO L377 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 257 treesize of output 196 [2019-11-20 04:06:58,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:58,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:58,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:58,191 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:58,271 INFO L567 ElimStorePlain]: treesize reduction 84, result has 75.2 percent of original size [2019-11-20 04:06:58,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:06:58,275 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 213 treesize of output 154 [2019-11-20 04:06:58,276 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:58,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:58,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:06:58,320 INFO L377 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 94 treesize of output 41 [2019-11-20 04:06:58,321 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:58,347 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:58,347 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:58,348 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:267, output treesize:159 [2019-11-20 04:06:58,404 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_int_65|], 11=[|v_#memory_$Pointer$.offset_44|, |v_#memory_$Pointer$.base_50|]} [2019-11-20 04:06:58,436 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:58,437 INFO L377 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 2 case distinctions, treesize of input 112 treesize of output 256 [2019-11-20 04:06:58,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:58,544 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-11-20 04:06:58,545 INFO L567 ElimStorePlain]: treesize reduction 100, result has 82.6 percent of original size [2019-11-20 04:06:58,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:06:58,604 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:58,604 INFO L377 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 6 new quantified variables, introduced 3 case distinctions, treesize of input 443 treesize of output 407 [2019-11-20 04:06:58,606 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:58,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:58,653 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:58,654 INFO L377 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 6 new quantified variables, introduced 3 case distinctions, treesize of input 195 treesize of output 117 [2019-11-20 04:06:58,655 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:58,717 INFO L567 ElimStorePlain]: treesize reduction 96, result has 61.6 percent of original size [2019-11-20 04:06:58,717 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:58,717 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:436, output treesize:154 [2019-11-20 04:06:58,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:58,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:58,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:58,904 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:58,905 INFO L377 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 144 treesize of output 90 [2019-11-20 04:06:58,906 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:58,940 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:58,941 INFO L377 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 128 treesize of output 98 [2019-11-20 04:06:58,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:58,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:58,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:58,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:58,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:58,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:58,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:58,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:58,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:58,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:58,948 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 04:06:58,992 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:58,992 INFO L377 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 136 treesize of output 94 [2019-11-20 04:06:58,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:58,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:58,995 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 04:06:59,021 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:59,021 INFO L377 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 136 treesize of output 94 [2019-11-20 04:06:59,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:59,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:59,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:59,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:59,024 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 04:06:59,182 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-11-20 04:06:59,182 INFO L567 ElimStorePlain]: treesize reduction 52, result has 77.4 percent of original size [2019-11-20 04:06:59,200 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 53 [2019-11-20 04:06:59,201 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:59,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:06:59,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:06:59,210 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 38 [2019-11-20 04:06:59,211 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:59,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:06:59,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:06:59,226 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 38 [2019-11-20 04:06:59,227 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:59,275 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:59,277 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2019-11-20 04:06:59,277 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:545, output treesize:103 [2019-11-20 04:06:59,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:06:59,571 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:59,571 INFO L377 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 29 [2019-11-20 04:06:59,572 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:06:59,585 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:06:59,586 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:06:59,586 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:3 [2019-11-20 04:06:59,597 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 04:06:59,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:06:59,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 25 [2019-11-20 04:06:59,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19154862] [2019-11-20 04:06:59,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-20 04:06:59,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:06:59,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-20 04:06:59,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2019-11-20 04:06:59,599 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand 25 states. [2019-11-20 04:07:00,584 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-11-20 04:07:00,833 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-11-20 04:07:01,016 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2019-11-20 04:07:01,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:07:01,582 INFO L93 Difference]: Finished difference Result 110 states and 125 transitions. [2019-11-20 04:07:01,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-20 04:07:01,582 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 30 [2019-11-20 04:07:01,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:07:01,583 INFO L225 Difference]: With dead ends: 110 [2019-11-20 04:07:01,583 INFO L226 Difference]: Without dead ends: 102 [2019-11-20 04:07:01,584 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=288, Invalid=1782, Unknown=0, NotChecked=0, Total=2070 [2019-11-20 04:07:01,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-20 04:07:01,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 83. [2019-11-20 04:07:01,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-20 04:07:01,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 95 transitions. [2019-11-20 04:07:01,593 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 95 transitions. Word has length 30 [2019-11-20 04:07:01,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:07:01,593 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 95 transitions. [2019-11-20 04:07:01,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-20 04:07:01,594 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2019-11-20 04:07:01,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-20 04:07:01,594 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 04:07:01,594 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 04:07:01,795 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:07:01,795 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 04:07:01,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 04:07:01,796 INFO L82 PathProgramCache]: Analyzing trace with hash 160117440, now seen corresponding path program 1 times [2019-11-20 04:07:01,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 04:07:01,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728535968] [2019-11-20 04:07:01,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 04:07:01,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:07:02,057 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 04:07:02,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728535968] [2019-11-20 04:07:02,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708823951] [2019-11-20 04:07:02,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a297b9fc-36a3-4538-85df-6dc29540f570/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:07:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 04:07:02,117 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 45 conjunts are in the unsatisfiable core [2019-11-20 04:07:02,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 04:07:02,122 INFO L377 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-11-20 04:07:02,123 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:07:02,125 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:07:02,125 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:07:02,125 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-20 04:07:02,210 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:07:02,211 INFO L377 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-11-20 04:07:02,211 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:07:02,233 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-11-20 04:07:02,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:07:02,233 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-11-20 04:07:02,272 INFO L377 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 13 treesize of output 9 [2019-11-20 04:07:02,272 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:07:02,290 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:07:02,293 INFO L377 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 13 treesize of output 9 [2019-11-20 04:07:02,293 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:07:02,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:07:02,307 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:07:02,308 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:59, output treesize:45 [2019-11-20 04:07:02,353 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:07:02,354 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2019-11-20 04:07:02,354 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:07:02,379 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:07:02,380 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_66|], 2=[|v_#memory_$Pointer$.offset_46|, |v_#memory_$Pointer$.base_52|]} [2019-11-20 04:07:02,384 INFO L377 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 11 treesize of output 7 [2019-11-20 04:07:02,385 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:07:02,404 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:07:02,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:07:02,410 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-20 04:07:02,410 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 04:07:02,426 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:07:02,449 INFO L343 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-11-20 04:07:02,450 INFO L377 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 1 case distinctions, treesize of input 45 treesize of output 31 [2019-11-20 04:07:02,450 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 04:07:02,476 INFO L567 ElimStorePlain]: treesize reduction 10, result has 79.2 percent of original size [2019-11-20 04:07:02,476 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:07:02,476 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:91, output treesize:38 [2019-11-20 04:07:02,527 INFO L377 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 118 [2019-11-20 04:07:02,527 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:07:02,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:07:02,563 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 04:07:02,566 INFO L377 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 69 treesize of output 23 [2019-11-20 04:07:02,566 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:07:02,585 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:07:02,605 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:07:02,605 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 125 [2019-11-20 04:07:02,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:07:02,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,607 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-11-20 04:07:02,653 INFO L567 ElimStorePlain]: treesize reduction 118, result has 47.8 percent of original size [2019-11-20 04:07:02,655 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:07:02,655 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:176, output treesize:51 [2019-11-20 04:07:02,689 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_48|, |v_#memory_int_68|], 6=[|v_#memory_$Pointer$.base_54|]} [2019-11-20 04:07:02,711 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:07:02,711 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 205 treesize of output 193 [2019-11-20 04:07:02,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:07:02,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:07:02,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,716 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 04:07:02,762 INFO L567 ElimStorePlain]: treesize reduction 48, result has 74.6 percent of original size [2019-11-20 04:07:02,786 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:07:02,787 INFO L377 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 1 case distinctions, treesize of input 49 treesize of output 102 [2019-11-20 04:07:02,787 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:07:02,845 INFO L567 ElimStorePlain]: treesize reduction 40, result has 79.1 percent of original size [2019-11-20 04:07:02,890 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:07:02,890 INFO L377 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 151 treesize of output 165 [2019-11-20 04:07:02,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:07:02,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:07:02,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:07:02,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:07:02,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:07:02,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:07:02,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:07:02,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:07:02,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:07:02,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:07:02,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:07:02,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:07:02,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:07:02,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:02,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:07:02,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:07:03,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:07:03,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:07:03,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:07:03,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:07:03,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:07:03,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:07:03,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:07:03,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:07:03,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:07:03,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:07:03,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,059 INFO L496 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2019-11-20 04:07:03,388 WARN L191 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 71 [2019-11-20 04:07:03,389 INFO L567 ElimStorePlain]: treesize reduction 583, result has 33.7 percent of original size [2019-11-20 04:07:03,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2019-11-20 04:07:03,394 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:215, output treesize:316 [2019-11-20 04:07:03,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:07:03,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:03,711 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 12=[|#memory_$Pointer$.base|]} [2019-11-20 04:07:03,720 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 55 [2019-11-20 04:07:03,720 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:07:03,731 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 70 [2019-11-20 04:07:03,731 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:07:03,738 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 57 [2019-11-20 04:07:03,739 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 04:07:03,746 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 47 [2019-11-20 04:07:03,747 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 04:07:03,754 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 51 [2019-11-20 04:07:03,754 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 04:07:03,834 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:07:03,847 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:07:03,848 INFO L377 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 44 treesize of output 39 [2019-11-20 04:07:03,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:07:03,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:07:03,849 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 04:07:03,854 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 24 [2019-11-20 04:07:03,855 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-20 04:07:03,869 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:07:03,869 INFO L377 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 54 treesize of output 37 [2019-11-20 04:07:03,869 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-20 04:07:03,883 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:07:03,883 INFO L377 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 67 treesize of output 44 [2019-11-20 04:07:03,884 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-20 04:07:03,894 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:07:03,894 INFO L377 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 52 treesize of output 41 [2019-11-20 04:07:03,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:07:03,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:07:03,895 INFO L496 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 04:07:03,964 INFO L567 ElimStorePlain]: treesize reduction 30, result has 75.2 percent of original size [2019-11-20 04:07:03,964 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 5 xjuncts. [2019-11-20 04:07:03,965 INFO L221 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:363, output treesize:74 [2019-11-20 04:07:04,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 04:07:04,048 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-20 04:07:04,049 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 04:07:04,056 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:07:04,056 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2019-11-20 04:07:04,056 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 04:07:04,071 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 04:07:04,071 INFO L377 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 38 [2019-11-20 04:07:04,071 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 04:07:04,113 INFO L567 ElimStorePlain]: treesize reduction 7, result has 84.4 percent of original size [2019-11-20 04:07:04,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 04:07:04,114 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 04:07:04,114 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:64, output treesize:1 [2019-11-20 04:07:04,119 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 04:07:04,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 04:07:04,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2019-11-20 04:07:04,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289563598] [2019-11-20 04:07:04,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-20 04:07:04,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 04:07:04,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-20 04:07:04,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2019-11-20 04:07:04,121 INFO L87 Difference]: Start difference. First operand 83 states and 95 transitions. Second operand 20 states. [2019-11-20 04:07:04,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 04:07:04,984 INFO L93 Difference]: Finished difference Result 106 states and 122 transitions. [2019-11-20 04:07:04,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 04:07:04,985 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2019-11-20 04:07:04,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 04:07:04,985 INFO L225 Difference]: With dead ends: 106 [2019-11-20 04:07:04,985 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 04:07:04,986 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=132, Invalid=736, Unknown=2, NotChecked=0, Total=870 [2019-11-20 04:07:04,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 04:07:04,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 04:07:04,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 04:07:04,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 04:07:04,987 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2019-11-20 04:07:04,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 04:07:04,987 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 04:07:04,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-20 04:07:04,988 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 04:07:04,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 04:07:05,188 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 04:07:05,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 04:07:05,571 WARN L191 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 445 DAG size of output: 251 [2019-11-20 04:07:06,007 WARN L191 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 249 DAG size of output: 20 [2019-11-20 04:07:06,150 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-11-20 04:07:06,153 INFO L447 ceAbstractionStarter]: At program point L514-1(line 514) the Hoare annotation is: true [2019-11-20 04:07:06,154 INFO L447 ceAbstractionStarter]: At program point L514-2(line 514) the Hoare annotation is: true [2019-11-20 04:07:06,154 INFO L444 ceAbstractionStarter]: For program point L543(lines 543 544) no Hoare annotation was computed. [2019-11-20 04:07:06,154 INFO L444 ceAbstractionStarter]: For program point L543-2(lines 520 548) no Hoare annotation was computed. [2019-11-20 04:07:06,154 INFO L444 ceAbstractionStarter]: For program point L543-3(lines 543 544) no Hoare annotation was computed. [2019-11-20 04:07:06,154 INFO L444 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-11-20 04:07:06,154 INFO L444 ceAbstractionStarter]: For program point L535-1(line 535) no Hoare annotation was computed. [2019-11-20 04:07:06,154 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 04:07:06,154 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 04:07:06,154 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 04:07:06,154 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 546) no Hoare annotation was computed. [2019-11-20 04:07:06,155 INFO L444 ceAbstractionStarter]: For program point L532(lines 532 538) no Hoare annotation was computed. [2019-11-20 04:07:06,155 INFO L444 ceAbstractionStarter]: For program point L532-2(lines 520 548) no Hoare annotation was computed. [2019-11-20 04:07:06,155 INFO L444 ceAbstractionStarter]: For program point L532-3(lines 532 538) no Hoare annotation was computed. [2019-11-20 04:07:06,155 INFO L444 ceAbstractionStarter]: For program point L528(line 528) no Hoare annotation was computed. [2019-11-20 04:07:06,155 INFO L444 ceAbstractionStarter]: For program point L528-1(line 528) no Hoare annotation was computed. [2019-11-20 04:07:06,155 INFO L444 ceAbstractionStarter]: For program point L545(lines 545 546) no Hoare annotation was computed. [2019-11-20 04:07:06,155 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 04:07:06,155 INFO L444 ceAbstractionStarter]: For program point L545-2(lines 545 546) no Hoare annotation was computed. [2019-11-20 04:07:06,155 INFO L444 ceAbstractionStarter]: For program point L541-1(lines 541 542) no Hoare annotation was computed. [2019-11-20 04:07:06,155 INFO L440 ceAbstractionStarter]: At program point L541-3(lines 541 542) the Hoare annotation is: (or (and (= (select (select |#memory_int| ULTIMATE.start_main_~p~0.base) ULTIMATE.start_main_~p~0.offset) 3) (= ULTIMATE.start_main_~a~0.offset ULTIMATE.start_main_~p~0.offset) (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~p~0.base)) (and (= ULTIMATE.start_main_~a~0.offset 0) (= 1 (select |#valid| ULTIMATE.start_main_~a~0.base)))) [2019-11-20 04:07:06,156 INFO L444 ceAbstractionStarter]: For program point L525-1(lines 525 531) no Hoare annotation was computed. [2019-11-20 04:07:06,156 INFO L440 ceAbstractionStarter]: At program point L525-3(lines 525 531) the Hoare annotation is: (let ((.cse2 (not (= ULTIMATE.start_main_~t~0.base ULTIMATE.start_main_~a~0.base))) (.cse4 (select |#memory_int| ULTIMATE.start_main_~p~0.base)) (.cse5 (= 1 (select |#valid| ULTIMATE.start_main_~a~0.base))) (.cse0 (= ULTIMATE.start_main_~a~0.offset 0)) (.cse6 (= ULTIMATE.start_main_~a~0.base ULTIMATE.start_main_~p~0.base))) (or (let ((.cse1 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_main_~a~0.base) 4)) (.cse3 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~a~0.base) 4))) (and .cse0 (= 0 .cse1) .cse2 (= ULTIMATE.start_main_~p~0.offset .cse1) (= 1 (select |#valid| .cse3)) (= .cse3 ULTIMATE.start_main_~p~0.base) (= (select (select (store |#memory_int| ULTIMATE.start_main_~p~0.base (store .cse4 ULTIMATE.start_main_~p~0.offset 1)) ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset) 1) .cse5)) (and (= ULTIMATE.start_main_~a~0.offset ULTIMATE.start_main_~t~0.offset) .cse0 .cse2 (not .cse6) (= (select (select (store |#memory_int| ULTIMATE.start_main_~p~0.base (store .cse4 ULTIMATE.start_main_~p~0.offset 2)) ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset) 1) .cse5) (and .cse0 (= 1 (select |#valid| ULTIMATE.start_main_~p~0.base)) (= ULTIMATE.start_main_~a~0.offset ULTIMATE.start_main_~p~0.offset) .cse6))) [2019-11-20 04:07:06,156 INFO L444 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2019-11-20 04:07:06,156 INFO L444 ceAbstractionStarter]: For program point L522(line 522) no Hoare annotation was computed. [2019-11-20 04:07:06,156 INFO L444 ceAbstractionStarter]: For program point L522-1(line 522) no Hoare annotation was computed. [2019-11-20 04:07:06,156 INFO L447 ceAbstractionStarter]: At program point L547(lines 520 548) the Hoare annotation is: true [2019-11-20 04:07:06,156 INFO L447 ceAbstractionStarter]: At program point L514(line 514) the Hoare annotation is: true [2019-11-20 04:07:06,172 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 04:07:06,174 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 04:07:06,174 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 04:07:06,174 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 04:07:06,180 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 04:07:06,180 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 04:07:06,181 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 04:07:06,181 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 04:07:06,181 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 04:07:06,182 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 04:07:06,182 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 04:07:06,182 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 04:07:06,186 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 04:07:06,187 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 04:07:06,187 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 04:07:06,188 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 04:07:06,192 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 04:07:06,193 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 04:07:06,193 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 04:07:06,193 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 04:07:06,194 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 04:07:06,194 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 04:07:06,194 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 04:07:06,195 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 04:07:06,199 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 04:07:06,207 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 04:07:06,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 04:07:06 BoogieIcfgContainer [2019-11-20 04:07:06,210 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 04:07:06,210 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 04:07:06,211 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 04:07:06,211 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 04:07:06,211 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:06:26" (3/4) ... [2019-11-20 04:07:06,215 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 04:07:06,228 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-20 04:07:06,229 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-20 04:07:06,229 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-20 04:07:06,299 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a297b9fc-36a3-4538-85df-6dc29540f570/bin/uautomizer/witness.graphml [2019-11-20 04:07:06,300 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 04:07:06,301 INFO L168 Benchmark]: Toolchain (without parser) took 41436.29 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 333.4 MB). Free memory was 939.4 MB in the beginning and 892.0 MB in the end (delta: 47.3 MB). Peak memory consumption was 380.8 MB. Max. memory is 11.5 GB. [2019-11-20 04:07:06,301 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 04:07:06,302 INFO L168 Benchmark]: CACSL2BoogieTranslator took 738.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -169.4 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-20 04:07:06,302 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.61 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-11-20 04:07:06,303 INFO L168 Benchmark]: Boogie Preprocessor took 41.35 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 04:07:06,303 INFO L168 Benchmark]: RCFGBuilder took 499.76 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-20 04:07:06,303 INFO L168 Benchmark]: TraceAbstraction took 40011.03 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 201.9 MB). Free memory was 1.1 GB in the beginning and 895.3 MB in the end (delta: 185.8 MB). Peak memory consumption was 387.6 MB. Max. memory is 11.5 GB. [2019-11-20 04:07:06,304 INFO L168 Benchmark]: Witness Printer took 89.46 ms. Allocated memory is still 1.4 GB. Free memory was 895.3 MB in the beginning and 892.0 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2019-11-20 04:07:06,311 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 738.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -169.4 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.61 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 41.35 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 499.76 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 40011.03 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 201.9 MB). Free memory was 1.1 GB in the beginning and 895.3 MB in the end (delta: 185.8 MB). Peak memory consumption was 387.6 MB. Max. memory is 11.5 GB. * Witness Printer took 89.46 ms. Allocated memory is still 1.4 GB. Free memory was 895.3 MB in the beginning and 892.0 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 546]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 520]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 514]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 514]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 514]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 525]: Loop Invariant [2019-11-20 04:07:06,324 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 04:07:06,324 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 04:07:06,324 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 04:07:06,325 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 04:07:06,330 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 04:07:06,331 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 04:07:06,332 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 04:07:06,332 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 04:07:06,332 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 04:07:06,333 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 04:07:06,333 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 04:07:06,333 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 04:07:06,334 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 04:07:06,335 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-20 04:07:06,336 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 04:07:06,336 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-20 04:07:06,339 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 04:07:06,341 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 04:07:06,341 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 04:07:06,341 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-20 04:07:06,342 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 04:07:06,342 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 04:07:06,342 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 04:07:06,342 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((((a == 0 && 0 == #memory_$Pointer$[a][4]) && !(t == a)) && p == #memory_$Pointer$[a][4]) && 1 == \valid[#memory_$Pointer$[a][4]]) && #memory_$Pointer$[a][4] == p) && unknown-#memory_int-unknown[p := unknown-#memory_int-unknown[p][p := 1]][a][a] == 1) && 1 == \valid[a]) || (((((a == t && a == 0) && !(t == a)) && !(a == p)) && unknown-#memory_int-unknown[p := unknown-#memory_int-unknown[p][p := 2]][a][a] == 1) && 1 == \valid[a])) || (((a == 0 && 1 == \valid[p]) && a == p) && a == p) - InvariantResult [Line: 541]: Loop Invariant [2019-11-20 04:07:06,344 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-20 04:07:06,347 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((unknown-#memory_int-unknown[p][p] == 3 && a == p) && a == p) || (a == 0 && 1 == \valid[a]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 1 error locations. Result: SAFE, OverallTime: 39.9s, OverallIterations: 21, TraceHistogramMax: 4, AutomataDifference: 14.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, HoareTripleCheckerStatistics: 422 SDtfs, 1347 SDslu, 3019 SDs, 0 SdLazy, 4987 SolverSat, 672 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 809 GetRequests, 344 SyntacticMatches, 27 SemanticMatches, 438 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2313 ImplicationChecksByTransitivity, 15.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=16, 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, 21 MinimizatonAttempts, 335 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 27 NumberOfFragments, 137 HoareAnnotationTreeSize, 6 FomulaSimplifications, 19325326 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 6 FomulaSimplificationsInter, 12392 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 18.6s InterpolantComputationTime, 936 NumberOfCodeBlocks, 932 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 898 ConstructedInterpolants, 62 QuantifiedInterpolants, 475308 SizeOfPredicates, 231 NumberOfNonLiveVariables, 1798 ConjunctsInSsa, 737 ConjunctsInUnsatCore, 38 InterpolantComputations, 4 PerfectInterpolantSequences, 86/352 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 correct! Received shutdown request...