./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_016dd04a-f937-48de-8bd2-9ae43ff873a9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_016dd04a-f937-48de-8bd2-9ae43ff873a9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_016dd04a-f937-48de-8bd2-9ae43ff873a9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_016dd04a-f937-48de-8bd2-9ae43ff873a9/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_equal.i -s /tmp/vcloud-vcloud-master/worker/run_dir_016dd04a-f937-48de-8bd2-9ae43ff873a9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_016dd04a-f937-48de-8bd2-9ae43ff873a9/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 bf5697d8d4dca230b1a96a38440f1f7c3ecc8c95 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_016dd04a-f937-48de-8bd2-9ae43ff873a9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_016dd04a-f937-48de-8bd2-9ae43ff873a9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_016dd04a-f937-48de-8bd2-9ae43ff873a9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_016dd04a-f937-48de-8bd2-9ae43ff873a9/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_equal.i -s /tmp/vcloud-vcloud-master/worker/run_dir_016dd04a-f937-48de-8bd2-9ae43ff873a9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_016dd04a-f937-48de-8bd2-9ae43ff873a9/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 bf5697d8d4dca230b1a96a38440f1f7c3ecc8c95 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:37:44,420 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:37:44,422 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:37:44,432 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:37:44,432 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:37:44,433 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:37:44,434 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:37:44,436 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:37:44,438 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:37:44,439 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:37:44,439 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:37:44,441 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:37:44,441 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:37:44,442 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:37:44,442 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:37:44,443 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:37:44,444 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:37:44,445 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:37:44,447 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:37:44,448 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:37:44,450 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:37:44,451 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:37:44,452 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:37:44,452 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:37:44,455 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:37:44,455 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:37:44,455 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:37:44,456 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:37:44,456 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:37:44,457 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:37:44,457 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:37:44,458 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:37:44,458 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:37:44,459 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:37:44,460 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:37:44,460 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:37:44,460 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:37:44,461 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:37:44,461 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:37:44,462 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:37:44,462 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:37:44,463 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_016dd04a-f937-48de-8bd2-9ae43ff873a9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:37:44,475 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:37:44,475 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:37:44,476 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:37:44,476 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:37:44,476 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:37:44,477 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:37:44,477 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:37:44,477 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:37:44,477 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:37:44,478 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:37:44,478 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:37:44,478 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:37:44,478 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:37:44,478 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:37:44,479 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:37:44,479 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:37:44,479 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:37:44,479 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:37:44,479 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:37:44,480 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:37:44,480 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:37:44,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:37:44,480 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:37:44,480 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:37:44,481 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:37:44,481 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:37:44,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:37:44,481 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:37:44,482 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_016dd04a-f937-48de-8bd2-9ae43ff873a9/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 -> bf5697d8d4dca230b1a96a38440f1f7c3ecc8c95 [2019-11-16 00:37:44,506 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:37:44,516 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:37:44,518 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:37:44,520 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:37:44,520 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:37:44,521 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_016dd04a-f937-48de-8bd2-9ae43ff873a9/bin/uautomizer/../../sv-benchmarks/c/list-simple/sll2c_append_equal.i [2019-11-16 00:37:44,570 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_016dd04a-f937-48de-8bd2-9ae43ff873a9/bin/uautomizer/data/9b489cd39/355e3334f9a442eabf6eacd2ee0dd287/FLAG7c6173a60 [2019-11-16 00:37:45,076 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:37:45,080 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_016dd04a-f937-48de-8bd2-9ae43ff873a9/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2019-11-16 00:37:45,100 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_016dd04a-f937-48de-8bd2-9ae43ff873a9/bin/uautomizer/data/9b489cd39/355e3334f9a442eabf6eacd2ee0dd287/FLAG7c6173a60 [2019-11-16 00:37:45,588 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_016dd04a-f937-48de-8bd2-9ae43ff873a9/bin/uautomizer/data/9b489cd39/355e3334f9a442eabf6eacd2ee0dd287 [2019-11-16 00:37:45,591 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:37:45,592 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:37:45,593 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:37:45,593 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:37:45,596 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:37:45,596 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:37:45" (1/1) ... [2019-11-16 00:37:45,598 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ba2d5c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:45, skipping insertion in model container [2019-11-16 00:37:45,598 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:37:45" (1/1) ... [2019-11-16 00:37:45,604 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:37:45,649 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:37:46,122 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:37:46,135 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:37:46,190 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:37:46,239 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:37:46,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:46 WrapperNode [2019-11-16 00:37:46,239 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:37:46,240 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:37:46,240 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:37:46,241 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:37:46,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:46" (1/1) ... [2019-11-16 00:37:46,262 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:46" (1/1) ... [2019-11-16 00:37:46,289 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:37:46,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:37:46,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:37:46,289 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:37:46,298 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:46" (1/1) ... [2019-11-16 00:37:46,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:46" (1/1) ... [2019-11-16 00:37:46,302 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:46" (1/1) ... [2019-11-16 00:37:46,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:46" (1/1) ... [2019-11-16 00:37:46,315 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:46" (1/1) ... [2019-11-16 00:37:46,319 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:46" (1/1) ... [2019-11-16 00:37:46,321 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:46" (1/1) ... [2019-11-16 00:37:46,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:37:46,326 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:37:46,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:37:46,326 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:37:46,327 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_016dd04a-f937-48de-8bd2-9ae43ff873a9/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-16 00:37:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:37:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:37:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:37:46,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:37:46,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:37:46,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:37:46,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:37:46,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-16 00:37:46,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:37:46,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:37:46,816 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:37:46,817 INFO L284 CfgBuilder]: Removed 26 assume(true) statements. [2019-11-16 00:37:46,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:37:46 BoogieIcfgContainer [2019-11-16 00:37:46,818 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:37:46,819 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:37:46,819 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:37:46,822 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:37:46,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:37:45" (1/3) ... [2019-11-16 00:37:46,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60f6e931 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:37:46, skipping insertion in model container [2019-11-16 00:37:46,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:46" (2/3) ... [2019-11-16 00:37:46,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60f6e931 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:37:46, skipping insertion in model container [2019-11-16 00:37:46,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:37:46" (3/3) ... [2019-11-16 00:37:46,825 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2019-11-16 00:37:46,832 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:37:46,837 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:37:46,847 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:37:46,868 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:37:46,868 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:37:46,868 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:37:46,868 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:37:46,868 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:37:46,868 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:37:46,868 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:37:46,869 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:37:46,879 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-11-16 00:37:46,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-16 00:37:46,884 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:46,885 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:46,886 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:46,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:46,890 INFO L82 PathProgramCache]: Analyzing trace with hash -662039061, now seen corresponding path program 1 times [2019-11-16 00:37:46,896 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:46,896 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140225352] [2019-11-16 00:37:46,896 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:46,896 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:46,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:46,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:47,018 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-16 00:37:47,018 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140225352] [2019-11-16 00:37:47,019 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:47,019 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:37:47,020 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654899598] [2019-11-16 00:37:47,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-16 00:37:47,024 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:47,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-16 00:37:47,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-16 00:37:47,037 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2019-11-16 00:37:47,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:47,053 INFO L93 Difference]: Finished difference Result 61 states and 85 transitions. [2019-11-16 00:37:47,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-16 00:37:47,055 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-16 00:37:47,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:47,064 INFO L225 Difference]: With dead ends: 61 [2019-11-16 00:37:47,065 INFO L226 Difference]: Without dead ends: 26 [2019-11-16 00:37:47,067 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-16 00:37:47,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-16 00:37:47,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-16 00:37:47,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-16 00:37:47,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-11-16 00:37:47,100 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 16 [2019-11-16 00:37:47,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:47,100 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-11-16 00:37:47,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-16 00:37:47,101 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-11-16 00:37:47,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-16 00:37:47,102 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:47,102 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:47,102 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:47,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:47,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1274537730, now seen corresponding path program 1 times [2019-11-16 00:37:47,103 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:47,103 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081223925] [2019-11-16 00:37:47,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:47,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:47,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:47,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:47,168 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-16 00:37:47,168 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081223925] [2019-11-16 00:37:47,168 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:47,168 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:37:47,169 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046462899] [2019-11-16 00:37:47,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:37:47,170 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:47,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:37:47,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:37:47,171 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2019-11-16 00:37:47,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:47,192 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2019-11-16 00:37:47,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:37:47,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-16 00:37:47,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:47,194 INFO L225 Difference]: With dead ends: 47 [2019-11-16 00:37:47,194 INFO L226 Difference]: Without dead ends: 30 [2019-11-16 00:37:47,194 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:37:47,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-16 00:37:47,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2019-11-16 00:37:47,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-16 00:37:47,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-11-16 00:37:47,199 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 16 [2019-11-16 00:37:47,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:47,199 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-11-16 00:37:47,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:37:47,200 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-11-16 00:37:47,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-16 00:37:47,200 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:47,200 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:47,201 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:47,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:47,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1644449098, now seen corresponding path program 1 times [2019-11-16 00:37:47,201 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:47,201 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644540146] [2019-11-16 00:37:47,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:47,202 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:47,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:47,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:47,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:37:47,522 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644540146] [2019-11-16 00:37:47,522 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:47,522 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-16 00:37:47,522 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011971378] [2019-11-16 00:37:47,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-16 00:37:47,523 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:37:47,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-16 00:37:47,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:37:47,524 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 11 states. [2019-11-16 00:37:47,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:47,916 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-11-16 00:37:47,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:37:47,917 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-11-16 00:37:47,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:47,918 INFO L225 Difference]: With dead ends: 35 [2019-11-16 00:37:47,918 INFO L226 Difference]: Without dead ends: 27 [2019-11-16 00:37:47,919 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2019-11-16 00:37:47,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-16 00:37:47,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-16 00:37:47,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-16 00:37:47,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-11-16 00:37:47,924 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 20 [2019-11-16 00:37:47,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:47,925 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-11-16 00:37:47,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-16 00:37:47,925 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-11-16 00:37:47,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-16 00:37:47,926 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:47,926 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:47,926 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:47,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:47,927 INFO L82 PathProgramCache]: Analyzing trace with hash 573754173, now seen corresponding path program 1 times [2019-11-16 00:37:47,927 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:37:47,927 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653797692] [2019-11-16 00:37:47,928 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:47,928 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:37:47,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:37:47,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:48,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:37:48,633 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653797692] [2019-11-16 00:37:48,633 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252464479] [2019-11-16 00:37:48,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_016dd04a-f937-48de-8bd2-9ae43ff873a9/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-16 00:37:48,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:48,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 92 conjunts are in the unsatisfiable core [2019-11-16 00:37:48,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:37:48,883 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-16 00:37:48,884 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-16 00:37:48,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:37:48,898 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:48,899 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:37:48,899 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:23 [2019-11-16 00:37:49,064 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:37:49,085 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:49,085 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 55 [2019-11-16 00:37:49,086 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:37:49,155 INFO L567 ElimStorePlain]: treesize reduction 24, result has 61.3 percent of original size [2019-11-16 00:37:49,155 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:37:49,156 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:38 [2019-11-16 00:37:49,217 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:37:49,217 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:37:49,245 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:49,245 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:37:49,246 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:44 [2019-11-16 00:37:49,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:37:49,313 INFO L375 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-16 00:37:49,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:37:49,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:49,343 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:37:49,343 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:44 [2019-11-16 00:37:49,422 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-16 00:37:49,423 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:37:49,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:49,440 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:37:49,440 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:57, output treesize:42 [2019-11-16 00:37:49,532 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:37:49,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:37:49,545 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:49,546 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2019-11-16 00:37:49,547 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:37:49,573 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:49,573 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:37:49,573 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:64, output treesize:53 [2019-11-16 00:37:49,662 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_27|, |v_#memory_int_31|], 4=[|v_#memory_$Pointer$.base_31|, |v_#memory_$Pointer$.offset_31|]} [2019-11-16 00:37:49,668 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-16 00:37:49,711 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:49,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:37:49,721 INFO L375 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 28 treesize of output 31 [2019-11-16 00:37:49,721 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:37:49,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:49,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:37:49,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:37:49,771 INFO L375 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 51 treesize of output 31 [2019-11-16 00:37:49,772 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:37:49,805 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:49,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:37:49,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:37:49,813 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2019-11-16 00:37:49,814 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:37:49,854 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:49,856 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:37:49,856 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:125, output treesize:67 [2019-11-16 00:37:50,113 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_28|, |v_#memory_int_32|], 19=[|v_#memory_$Pointer$.offset_32|, |v_#memory_$Pointer$.base_32|]} [2019-11-16 00:37:50,117 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-16 00:37:50,192 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:50,216 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:37:50,219 INFO L375 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 59 treesize of output 26 [2019-11-16 00:37:50,220 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:37:50,275 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:50,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:37:50,295 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:37:50,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:37:50,308 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:50,308 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 58 [2019-11-16 00:37:50,309 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:37:50,382 INFO L567 ElimStorePlain]: treesize reduction 20, result has 89.1 percent of original size [2019-11-16 00:37:50,392 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:37:50,572 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-11-16 00:37:50,573 INFO L341 Elim1Store]: treesize reduction 78, result has 65.0 percent of original size [2019-11-16 00:37:50,573 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 174 treesize of output 219 [2019-11-16 00:37:50,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:50,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:50,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:50,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:50,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:50,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:50,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:50,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:50,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:50,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:50,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:50,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:50,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:50,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:50,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:50,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:50,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:50,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:50,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:50,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:50,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:50,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:50,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:50,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:50,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:50,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:50,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:50,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:50,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:37:50,941 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:37:50,942 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-16 00:37:50,945 INFO L168 Benchmark]: Toolchain (without parser) took 5352.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 940.7 MB in the beginning and 872.5 MB in the end (delta: 68.2 MB). Peak memory consumption was 215.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:37:50,945 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:37:50,946 INFO L168 Benchmark]: CACSL2BoogieTranslator took 646.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -183.1 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:37:50,946 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.64 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-16 00:37:50,947 INFO L168 Benchmark]: Boogie Preprocessor took 36.18 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-16 00:37:50,947 INFO L168 Benchmark]: RCFGBuilder took 493.05 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: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:37:50,947 INFO L168 Benchmark]: TraceAbstraction took 4124.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 872.5 MB in the end (delta: 212.8 MB). Peak memory consumption was 212.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:37:50,950 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 646.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -183.1 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.64 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. * Boogie Preprocessor took 36.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 493.05 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: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4124.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 872.5 MB in the end (delta: 212.8 MB). Peak memory consumption was 212.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-16 00:37:53,157 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:37:53,160 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:37:53,169 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:37:53,169 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:37:53,170 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:37:53,171 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:37:53,173 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:37:53,175 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:37:53,176 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:37:53,177 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:37:53,178 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:37:53,178 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:37:53,179 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:37:53,180 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:37:53,181 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:37:53,182 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:37:53,183 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:37:53,185 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:37:53,187 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:37:53,188 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:37:53,190 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:37:53,191 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:37:53,192 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:37:53,194 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:37:53,195 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:37:53,195 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:37:53,196 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:37:53,196 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:37:53,197 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:37:53,198 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:37:53,198 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:37:53,199 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:37:53,200 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:37:53,201 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:37:53,201 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:37:53,202 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:37:53,202 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:37:53,202 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:37:53,203 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:37:53,204 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:37:53,205 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_016dd04a-f937-48de-8bd2-9ae43ff873a9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-16 00:37:53,218 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:37:53,218 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:37:53,219 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:37:53,220 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:37:53,220 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:37:53,220 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:37:53,220 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:37:53,221 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:37:53,221 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:37:53,221 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:37:53,221 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:37:53,222 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:37:53,222 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-16 00:37:53,222 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-16 00:37:53,222 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:37:53,223 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:37:53,223 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:37:53,223 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:37:53,223 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:37:53,224 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:37:53,224 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:37:53,224 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:37:53,224 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:37:53,225 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:37:53,225 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:37:53,225 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:37:53,225 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-16 00:37:53,225 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-16 00:37:53,226 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:37:53,226 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-16 00:37:53,226 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_016dd04a-f937-48de-8bd2-9ae43ff873a9/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 -> bf5697d8d4dca230b1a96a38440f1f7c3ecc8c95 [2019-11-16 00:37:53,255 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:37:53,266 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:37:53,269 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:37:53,270 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:37:53,271 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:37:53,271 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_016dd04a-f937-48de-8bd2-9ae43ff873a9/bin/uautomizer/../../sv-benchmarks/c/list-simple/sll2c_append_equal.i [2019-11-16 00:37:53,321 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_016dd04a-f937-48de-8bd2-9ae43ff873a9/bin/uautomizer/data/6ccb109a5/18abc94788a94d1d8200fe0bfa4e0dcd/FLAG30dcae77e [2019-11-16 00:37:53,859 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:37:53,860 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_016dd04a-f937-48de-8bd2-9ae43ff873a9/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2019-11-16 00:37:53,879 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_016dd04a-f937-48de-8bd2-9ae43ff873a9/bin/uautomizer/data/6ccb109a5/18abc94788a94d1d8200fe0bfa4e0dcd/FLAG30dcae77e [2019-11-16 00:37:54,158 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_016dd04a-f937-48de-8bd2-9ae43ff873a9/bin/uautomizer/data/6ccb109a5/18abc94788a94d1d8200fe0bfa4e0dcd [2019-11-16 00:37:54,162 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:37:54,163 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:37:54,164 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:37:54,164 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:37:54,167 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:37:54,168 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:37:54" (1/1) ... [2019-11-16 00:37:54,170 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73a9510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:54, skipping insertion in model container [2019-11-16 00:37:54,171 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:37:54" (1/1) ... [2019-11-16 00:37:54,181 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:37:54,224 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:37:54,550 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:37:54,562 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:37:54,606 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:37:54,661 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:37:54,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:54 WrapperNode [2019-11-16 00:37:54,661 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:37:54,662 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:37:54,663 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:37:54,663 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:37:54,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:54" (1/1) ... [2019-11-16 00:37:54,694 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:54" (1/1) ... [2019-11-16 00:37:54,726 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:37:54,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:37:54,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:37:54,727 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:37:54,736 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:54" (1/1) ... [2019-11-16 00:37:54,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:54" (1/1) ... [2019-11-16 00:37:54,741 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:54" (1/1) ... [2019-11-16 00:37:54,742 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:54" (1/1) ... [2019-11-16 00:37:54,757 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:54" (1/1) ... [2019-11-16 00:37:54,762 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:54" (1/1) ... [2019-11-16 00:37:54,765 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:54" (1/1) ... [2019-11-16 00:37:54,773 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:37:54,774 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:37:54,774 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:37:54,774 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:37:54,775 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_016dd04a-f937-48de-8bd2-9ae43ff873a9/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-16 00:37:54,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-16 00:37:54,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:37:54,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:37:54,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:37:54,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:37:54,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:37:54,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-16 00:37:54,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-16 00:37:54,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:37:54,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:37:55,391 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:37:55,392 INFO L284 CfgBuilder]: Removed 26 assume(true) statements. [2019-11-16 00:37:55,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:37:55 BoogieIcfgContainer [2019-11-16 00:37:55,393 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:37:55,394 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:37:55,394 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:37:55,396 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:37:55,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:37:54" (1/3) ... [2019-11-16 00:37:55,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26a529da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:37:55, skipping insertion in model container [2019-11-16 00:37:55,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:37:54" (2/3) ... [2019-11-16 00:37:55,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26a529da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:37:55, skipping insertion in model container [2019-11-16 00:37:55,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:37:55" (3/3) ... [2019-11-16 00:37:55,400 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2019-11-16 00:37:55,412 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:37:55,417 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:37:55,427 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:37:55,449 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:37:55,449 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:37:55,450 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:37:55,450 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:37:55,450 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:37:55,450 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:37:55,451 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:37:55,451 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:37:55,465 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-11-16 00:37:55,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-16 00:37:55,471 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:55,472 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:55,474 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:55,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:55,479 INFO L82 PathProgramCache]: Analyzing trace with hash -662039061, now seen corresponding path program 1 times [2019-11-16 00:37:55,489 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:37:55,490 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1528422443] [2019-11-16 00:37:55,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_016dd04a-f937-48de-8bd2-9ae43ff873a9/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:37:55,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:55,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-16 00:37:55,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:37:55,673 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-16 00:37:55,673 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:37:55,688 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-16 00:37:55,691 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1528422443] [2019-11-16 00:37:55,692 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:55,693 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-16 00:37:55,693 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899069789] [2019-11-16 00:37:55,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-16 00:37:55,697 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:37:55,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-16 00:37:55,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-16 00:37:55,709 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2019-11-16 00:37:55,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:55,725 INFO L93 Difference]: Finished difference Result 61 states and 85 transitions. [2019-11-16 00:37:55,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-16 00:37:55,727 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-16 00:37:55,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:55,736 INFO L225 Difference]: With dead ends: 61 [2019-11-16 00:37:55,737 INFO L226 Difference]: Without dead ends: 26 [2019-11-16 00:37:55,740 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 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-16 00:37:55,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-16 00:37:55,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-16 00:37:55,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-16 00:37:55,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-11-16 00:37:55,774 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 16 [2019-11-16 00:37:55,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:55,774 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-11-16 00:37:55,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-16 00:37:55,775 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-11-16 00:37:55,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-16 00:37:55,775 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:55,776 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:55,978 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:37:55,978 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:55,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:55,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1274537730, now seen corresponding path program 1 times [2019-11-16 00:37:55,980 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:37:55,980 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1380260364] [2019-11-16 00:37:55,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_016dd04a-f937-48de-8bd2-9ae43ff873a9/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:37:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:56,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:37:56,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:37:56,155 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-16 00:37:56,159 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:37:56,176 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-16 00:37:56,176 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1380260364] [2019-11-16 00:37:56,177 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:37:56,177 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-16 00:37:56,177 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481880844] [2019-11-16 00:37:56,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:37:56,181 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:37:56,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:37:56,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:56,182 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 4 states. [2019-11-16 00:37:56,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:37:56,217 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2019-11-16 00:37:56,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:37:56,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-16 00:37:56,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:37:56,222 INFO L225 Difference]: With dead ends: 47 [2019-11-16 00:37:56,222 INFO L226 Difference]: Without dead ends: 30 [2019-11-16 00:37:56,223 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:37:56,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-16 00:37:56,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2019-11-16 00:37:56,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-16 00:37:56,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-11-16 00:37:56,228 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 16 [2019-11-16 00:37:56,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:37:56,229 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-11-16 00:37:56,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:37:56,229 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-11-16 00:37:56,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-16 00:37:56,234 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:37:56,234 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:37:56,445 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:37:56,445 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:37:56,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:37:56,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1644449098, now seen corresponding path program 1 times [2019-11-16 00:37:56,446 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:37:56,446 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [812457052] [2019-11-16 00:37:56,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_016dd04a-f937-48de-8bd2-9ae43ff873a9/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:37:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:37:56,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-16 00:37:56,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:37:56,869 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_30|], 4=[|v_#memory_$Pointer$.base_35|]} [2019-11-16 00:37:56,894 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:37:56,895 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:37:56,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:56,963 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:37:56,991 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:56,991 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2019-11-16 00:37:56,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:56,995 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:37:57,080 INFO L567 ElimStorePlain]: treesize reduction 12, result has 78.6 percent of original size [2019-11-16 00:37:57,081 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:37:57,082 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:44 [2019-11-16 00:37:57,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:57,247 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_32|, |v_#memory_$Pointer$.offset_35|], 2=[|v_#memory_int_31|], 9=[|v_#memory_$Pointer$.base_36|]} [2019-11-16 00:37:57,279 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-16 00:37:57,280 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:37:57,523 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-11-16 00:37:57,524 INFO L567 ElimStorePlain]: treesize reduction 7, result has 90.1 percent of original size [2019-11-16 00:37:57,538 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2019-11-16 00:37:57,538 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:37:57,610 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:57,619 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-16 00:37:57,619 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:37:57,649 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:57,660 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 11 [2019-11-16 00:37:57,661 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:37:57,684 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:57,685 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:37:57,685 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:86, output treesize:28 [2019-11-16 00:37:57,759 INFO L375 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-16 00:37:57,760 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:37:57,789 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:57,796 INFO L375 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-16 00:37:57,796 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:37:57,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:57,816 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-16 00:37:57,816 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:14 [2019-11-16 00:37:57,873 INFO L375 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-16 00:37:57,874 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:37:57,886 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:57,887 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:37:57,887 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-11-16 00:37:57,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:37:57,938 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:37:58,080 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-16 00:37:58,182 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-16 00:37:58,182 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:58,186 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-16 00:37:58,255 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:37:58,263 INFO L375 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 302 treesize of output 298 [2019-11-16 00:37:58,265 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-16 00:37:58,763 WARN L191 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-11-16 00:37:58,763 INFO L567 ElimStorePlain]: treesize reduction 79, result has 73.8 percent of original size [2019-11-16 00:37:58,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:58,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:58,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:58,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:58,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:58,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:58,772 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-16 00:37:58,772 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:102, output treesize:223 [2019-11-16 00:37:58,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:58,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:58,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:58,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:37:58,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:37:58,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:30,828 WARN L191 SmtUtils]: Spent 31.65 s on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-11-16 00:38:30,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-16 00:38:30,844 INFO L392 ElimStorePlain]: Different costs {8=[|v_#memory_$Pointer$.base_38|], 35=[|v_#memory_int_30|]} [2019-11-16 00:38:30,861 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-16 00:38:30,890 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-16 00:38:30,919 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-16 00:38:30,934 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-16 00:38:30,954 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:38:32,556 WARN L191 SmtUtils]: Spent 1.60 s on a formula simplification that was a NOOP. DAG size: 155 [2019-11-16 00:38:32,556 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:32,592 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:32,645 INFO L375 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 867 treesize of output 767 [2019-11-16 00:38:32,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:32,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:32,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:32,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:32,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:32,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:32,651 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:32,748 INFO L375 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 1833 treesize of output 1733 [2019-11-16 00:38:32,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:32,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:32,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:32,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:32,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:32,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:32,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:32,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:32,758 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:32,964 INFO L375 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 1841 treesize of output 1741 [2019-11-16 00:38:32,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:32,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:32,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:32,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:32,969 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:33,050 INFO L375 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 1829 treesize of output 1729 [2019-11-16 00:38:33,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:33,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,055 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:33,260 INFO L375 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 7677 treesize of output 7277 [2019-11-16 00:38:33,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:33,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:33,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:33,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:33,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:33,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:33,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:33,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:33,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:33,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:33,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:33,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:33,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:33,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:33,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:33,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:33,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:33,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:33,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:33,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:33,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:33,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:33,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:33,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:33,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:33,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:33,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:33,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:33,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:33,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,374 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:05,569 WARN L191 SmtUtils]: Spent 32.19 s on a formula simplification. DAG size of input: 356 DAG size of output: 192 [2019-11-16 00:39:05,570 INFO L567 ElimStorePlain]: treesize reduction 40338, result has 4.3 percent of original size [2019-11-16 00:39:05,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:39:05,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:39:05,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:39:05,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:39:05,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:39:05,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:39:05,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:39:05,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:39:05,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:39:05,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:05,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:39:05,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:39:05,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:39:05,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:39:05,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:39:05,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:05,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:05,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:39:05,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:05,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:05,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:39:05,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:39:05,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:39:05,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:05,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:05,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:05,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:39:05,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:05,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:39:05,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:05,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:05,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:05,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:39:05,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:05,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:05,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:39:05,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:05,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:39:05,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:39:05,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:39:05,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:39:05,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:05,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:05,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:05,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:05,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:39:05,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:39:05,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:05,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:39:05,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:39:05,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:05,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:05,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:39:05,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:05,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:05,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:05,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:05,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:05,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:05,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:39:05,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:05,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:05,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:05,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:05,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:05,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:05,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:39:05,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:05,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:05,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:05,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:05,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:39:05,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:39:05,663 INFO L496 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 2 dim-2 vars, End of recursive call: 34 dim-0 vars, and 7 xjuncts. [2019-11-16 00:39:05,663 INFO L221 ElimStorePlain]: Needed 11 recursive calls to eliminate 16 variables, input treesize:540, output treesize:2685 [2019-11-16 00:39:05,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:39:05,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:39:07,258 WARN L191 SmtUtils]: Spent 936.00 ms on a formula simplification. DAG size of input: 604 DAG size of output: 91 [2019-11-16 00:39:07,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:39:07,492 INFO L375 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 23 treesize of output 19 [2019-11-16 00:39:07,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:39:07,497 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:39:07,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:39:07,501 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2019-11-16 00:39:07,502 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:39:07,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:07,505 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:39:07,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:39:07,512 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-16 00:39:07,512 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:6 [2019-11-16 00:39:07,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:39:07,579 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [812457052] [2019-11-16 00:39:07,579 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:39:07,579 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13, 9] imperfect sequences [] total 20 [2019-11-16 00:39:07,580 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048827046] [2019-11-16 00:39:07,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-16 00:39:07,580 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:39:07,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-16 00:39:07,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2019-11-16 00:39:07,582 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 20 states. [2019-11-16 00:39:09,376 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 73 [2019-11-16 00:39:09,873 WARN L191 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 88 [2019-11-16 00:40:13,549 WARN L191 SmtUtils]: Spent 1.05 m on a formula simplification. DAG size of input: 195 DAG size of output: 176 [2019-11-16 00:40:13,939 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 118 [2019-11-16 00:41:13,035 WARN L191 SmtUtils]: Spent 56.98 s on a formula simplification. DAG size of input: 201 DAG size of output: 182 [2019-11-16 00:42:15,303 WARN L191 SmtUtils]: Spent 58.08 s on a formula simplification. DAG size of input: 203 DAG size of output: 184 [2019-11-16 00:43:15,516 WARN L191 SmtUtils]: Spent 57.97 s on a formula simplification. DAG size of input: 154 DAG size of output: 135 [2019-11-16 00:43:17,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:43:17,116 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2019-11-16 00:43:17,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-16 00:43:17,118 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-11-16 00:43:17,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:43:17,119 INFO L225 Difference]: With dead ends: 39 [2019-11-16 00:43:17,119 INFO L226 Difference]: Without dead ends: 37 [2019-11-16 00:43:17,120 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 278.7s TimeCoverageRelationStatistics Valid=231, Invalid=758, Unknown=3, NotChecked=0, Total=992 [2019-11-16 00:43:17,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-16 00:43:17,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2019-11-16 00:43:17,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-16 00:43:17,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-11-16 00:43:17,127 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2019-11-16 00:43:17,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:43:17,127 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-11-16 00:43:17,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-16 00:43:17,127 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-11-16 00:43:17,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-16 00:43:17,128 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:43:17,128 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:43:17,333 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:43:17,334 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:43:17,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:17,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1385214279, now seen corresponding path program 1 times [2019-11-16 00:43:17,334 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:43:17,334 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1809671703] [2019-11-16 00:43:17,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_016dd04a-f937-48de-8bd2-9ae43ff873a9/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:43:17,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:17,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-16 00:43:17,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:43:17,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:17,651 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-16 00:43:17,651 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 19 [2019-11-16 00:43:17,651 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:17,670 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:17,671 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-16 00:43:17,671 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:25 [2019-11-16 00:43:17,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:43:17,762 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:43:17,815 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-16 00:43:17,820 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:17,821 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:17,821 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:21 [2019-11-16 00:43:17,894 INFO L375 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 179 treesize of output 167 [2019-11-16 00:43:17,895 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-16 00:43:18,075 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2019-11-16 00:43:18,075 INFO L567 ElimStorePlain]: treesize reduction 122, result has 26.9 percent of original size [2019-11-16 00:43:18,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:18,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:18,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:18,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:18,077 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-11-16 00:43:18,078 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:26 [2019-11-16 00:43:18,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:18,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:43:18,455 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1809671703] [2019-11-16 00:43:18,455 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:43:18,455 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 18 [2019-11-16 00:43:18,455 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327986276] [2019-11-16 00:43:18,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-16 00:43:18,456 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:43:18,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-16 00:43:18,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2019-11-16 00:43:18,456 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 18 states. [2019-11-16 00:43:19,365 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-16 00:43:19,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:43:19,782 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2019-11-16 00:43:19,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:43:19,794 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 23 [2019-11-16 00:43:19,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:43:19,795 INFO L225 Difference]: With dead ends: 37 [2019-11-16 00:43:19,795 INFO L226 Difference]: Without dead ends: 27 [2019-11-16 00:43:19,795 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2019-11-16 00:43:19,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-16 00:43:19,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-16 00:43:19,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-16 00:43:19,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-11-16 00:43:19,801 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 23 [2019-11-16 00:43:19,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:43:19,801 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-11-16 00:43:19,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-16 00:43:19,804 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-11-16 00:43:19,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-16 00:43:19,805 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:43:19,805 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:43:20,014 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:43:20,014 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:43:20,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:43:20,014 INFO L82 PathProgramCache]: Analyzing trace with hash 573754173, now seen corresponding path program 1 times [2019-11-16 00:43:20,015 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:43:20,015 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1178898112] [2019-11-16 00:43:20,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_016dd04a-f937-48de-8bd2-9ae43ff873a9/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:43:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:43:20,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 57 conjunts are in the unsatisfiable core [2019-11-16 00:43:20,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:43:20,244 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-16 00:43:20,245 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2019-11-16 00:43:20,245 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:20,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:20,257 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:20,257 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:24 [2019-11-16 00:43:20,345 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:20,346 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2019-11-16 00:43:20,346 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:20,404 INFO L567 ElimStorePlain]: treesize reduction 28, result has 58.8 percent of original size [2019-11-16 00:43:20,405 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:20,405 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:40 [2019-11-16 00:43:20,446 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-16 00:43:20,446 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:20,471 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:20,472 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:20,472 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:50 [2019-11-16 00:43:20,519 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-16 00:43:20,519 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:20,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:20,542 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:20,542 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:48 [2019-11-16 00:43:20,590 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-16 00:43:20,590 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:20,612 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:20,613 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:43:20,613 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:61, output treesize:46 [2019-11-16 00:43:20,704 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:20,704 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 43 [2019-11-16 00:43:20,705 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:20,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:20,788 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:20,788 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:80, output treesize:54 [2019-11-16 00:43:20,894 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_46|, |v_#memory_int_50|], 4=[|v_#memory_$Pointer$.base_51|, |v_#memory_$Pointer$.offset_48|]} [2019-11-16 00:43:20,902 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-16 00:43:21,082 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-16 00:43:21,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:21,095 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2019-11-16 00:43:21,096 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:21,213 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-16 00:43:21,214 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:21,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:21,222 INFO L375 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 46 treesize of output 30 [2019-11-16 00:43:21,222 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:21,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:21,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:21,299 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2019-11-16 00:43:21,299 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:21,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:21,341 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:21,342 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:113, output treesize:65 [2019-11-16 00:43:21,630 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_51|, |v_#memory_int_47|], 19=[|v_#memory_$Pointer$.base_52|, |v_#memory_$Pointer$.offset_49|]} [2019-11-16 00:43:21,671 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 15 [2019-11-16 00:43:21,671 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:21,997 WARN L191 SmtUtils]: Spent 324.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-16 00:43:21,997 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:22,008 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-16 00:43:22,009 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:43:22,181 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-16 00:43:22,181 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:22,183 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:43:22,944 WARN L191 SmtUtils]: Spent 748.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-11-16 00:43:22,944 INFO L341 Elim1Store]: treesize reduction 53, result has 81.8 percent of original size [2019-11-16 00:43:22,945 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 242 treesize of output 344 [2019-11-16 00:43:22,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:22,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:22,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:22,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:22,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:22,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:22,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:22,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:22,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:22,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:22,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:22,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:22,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:22,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:22,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:22,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:22,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:22,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:22,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:22,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:22,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:22,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:22,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:22,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:22,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:22,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:22,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:22,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:22,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:22,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:22,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:22,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:22,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:22,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:22,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:22,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:22,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:22,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:22,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:22,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:22,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:22,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:22,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:22,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:22,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:22,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:22,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:22,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:22,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:22,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:22,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:22,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:22,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:22,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:22,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:22,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:22,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:22,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:22,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:22,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:22,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:22,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:22,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,035 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:43:23,037 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:43:23,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:23,080 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:23,080 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 95 [2019-11-16 00:43:23,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,082 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 5 xjuncts. [2019-11-16 00:43:23,315 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-11-16 00:43:23,315 INFO L567 ElimStorePlain]: treesize reduction 183, result has 45.4 percent of original size [2019-11-16 00:43:23,316 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:43:23,596 WARN L191 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-11-16 00:43:23,596 INFO L567 ElimStorePlain]: treesize reduction 8, result has 95.3 percent of original size [2019-11-16 00:43:23,700 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:43:23,700 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 170 treesize of output 213 [2019-11-16 00:43:23,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:23,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:23,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:24,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:24,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:24,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:24,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:24,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:24,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:24,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:24,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:24,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:24,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:24,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:24,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:24,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:24,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:24,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:24,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:24,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:43:24,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:43:24,026 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:24,028 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:43:24,241 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:43:24,242 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-16 00:43:24,246 INFO L168 Benchmark]: Toolchain (without parser) took 330083.49 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 244.8 MB). Free memory was 944.3 MB in the beginning and 853.4 MB in the end (delta: 90.9 MB). Peak memory consumption was 335.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:43:24,247 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:43:24,247 INFO L168 Benchmark]: CACSL2BoogieTranslator took 498.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 944.3 MB in the beginning and 1.1 GB in the end (delta: -181.2 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:43:24,247 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.09 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-16 00:43:24,248 INFO L168 Benchmark]: Boogie Preprocessor took 46.72 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:43:24,250 INFO L168 Benchmark]: RCFGBuilder took 619.27 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: 32.9 MB). Peak memory consumption was 32.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:43:24,252 INFO L168 Benchmark]: TraceAbstraction took 328851.19 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 89.1 MB). Free memory was 1.1 GB in the beginning and 853.4 MB in the end (delta: 232.7 MB). Peak memory consumption was 321.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:43:24,258 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 498.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 944.3 MB in the beginning and 1.1 GB in the end (delta: -181.2 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 64.09 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 46.72 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 619.27 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: 32.9 MB). Peak memory consumption was 32.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 328851.19 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 89.1 MB). Free memory was 1.1 GB in the beginning and 853.4 MB in the end (delta: 232.7 MB). Peak memory consumption was 321.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...