./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/verifythis/lcp.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_66685718-aa1b-449d-95b7-51029c9bfbc7/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_66685718-aa1b-449d-95b7-51029c9bfbc7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_66685718-aa1b-449d-95b7-51029c9bfbc7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_66685718-aa1b-449d-95b7-51029c9bfbc7/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/verifythis/lcp.c -s /tmp/vcloud-vcloud-master/worker/run_dir_66685718-aa1b-449d-95b7-51029c9bfbc7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_66685718-aa1b-449d-95b7-51029c9bfbc7/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 17e6e52dd20f9be422d05cd630fd9252ae3011a2 .................................................................................................................................................................................................................................................................................... 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_66685718-aa1b-449d-95b7-51029c9bfbc7/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_66685718-aa1b-449d-95b7-51029c9bfbc7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_66685718-aa1b-449d-95b7-51029c9bfbc7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_66685718-aa1b-449d-95b7-51029c9bfbc7/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/verifythis/lcp.c -s /tmp/vcloud-vcloud-master/worker/run_dir_66685718-aa1b-449d-95b7-51029c9bfbc7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_66685718-aa1b-449d-95b7-51029c9bfbc7/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 17e6e52dd20f9be422d05cd630fd9252ae3011a2 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 18:46:50,240 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:46:50,242 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:46:50,252 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:46:50,252 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:46:50,253 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:46:50,254 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:46:50,256 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:46:50,258 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:46:50,259 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:46:50,259 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:46:50,260 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:46:50,260 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:46:50,261 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:46:50,262 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:46:50,263 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:46:50,263 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:46:50,264 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:46:50,266 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:46:50,268 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:46:50,269 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:46:50,270 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:46:50,271 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:46:50,271 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:46:50,273 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:46:50,274 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:46:50,274 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:46:50,274 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:46:50,275 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:46:50,276 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:46:50,276 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:46:50,276 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:46:50,277 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:46:50,278 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:46:50,278 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:46:50,279 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:46:50,279 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:46:50,279 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:46:50,280 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:46:50,280 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:46:50,281 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:46:50,282 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_66685718-aa1b-449d-95b7-51029c9bfbc7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:46:50,291 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:46:50,291 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:46:50,292 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:46:50,292 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:46:50,292 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:46:50,292 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:46:50,292 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:46:50,292 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:46:50,293 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:46:50,293 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:46:50,293 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:46:50,293 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:46:50,293 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:46:50,293 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:46:50,293 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:46:50,294 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:46:50,294 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:46:50,294 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:46:50,294 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:46:50,294 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:46:50,294 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:46:50,294 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:46:50,295 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:46:50,295 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:46:50,295 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:46:50,295 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:46:50,295 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:46:50,295 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:46:50,295 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:46:50,295 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_66685718-aa1b-449d-95b7-51029c9bfbc7/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 -> 17e6e52dd20f9be422d05cd630fd9252ae3011a2 [2019-12-07 18:46:50,407 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:46:50,418 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:46:50,421 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:46:50,422 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:46:50,423 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:46:50,423 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_66685718-aa1b-449d-95b7-51029c9bfbc7/bin/uautomizer/../../sv-benchmarks/c/verifythis/lcp.c [2019-12-07 18:46:50,468 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_66685718-aa1b-449d-95b7-51029c9bfbc7/bin/uautomizer/data/cff46be86/c2c739b4c54246cc8e9dbdd354428daa/FLAG9689588bb [2019-12-07 18:46:50,911 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:46:50,911 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_66685718-aa1b-449d-95b7-51029c9bfbc7/sv-benchmarks/c/verifythis/lcp.c [2019-12-07 18:46:50,915 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_66685718-aa1b-449d-95b7-51029c9bfbc7/bin/uautomizer/data/cff46be86/c2c739b4c54246cc8e9dbdd354428daa/FLAG9689588bb [2019-12-07 18:46:50,924 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_66685718-aa1b-449d-95b7-51029c9bfbc7/bin/uautomizer/data/cff46be86/c2c739b4c54246cc8e9dbdd354428daa [2019-12-07 18:46:50,926 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:46:50,927 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:46:50,928 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:46:50,928 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:46:50,930 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:46:50,930 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:46:50" (1/1) ... [2019-12-07 18:46:50,932 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c5a9c49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:46:50, skipping insertion in model container [2019-12-07 18:46:50,932 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:46:50" (1/1) ... [2019-12-07 18:46:50,937 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:46:50,948 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:46:51,081 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:46:51,090 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:46:51,104 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:46:51,115 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:46:51,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:46:51 WrapperNode [2019-12-07 18:46:51,115 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:46:51,116 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:46:51,116 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:46:51,116 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:46:51,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:46:51" (1/1) ... [2019-12-07 18:46:51,127 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:46:51" (1/1) ... [2019-12-07 18:46:51,143 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:46:51,143 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:46:51,143 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:46:51,143 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:46:51,150 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:46:51" (1/1) ... [2019-12-07 18:46:51,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:46:51" (1/1) ... [2019-12-07 18:46:51,151 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:46:51" (1/1) ... [2019-12-07 18:46:51,151 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:46:51" (1/1) ... [2019-12-07 18:46:51,155 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:46:51" (1/1) ... [2019-12-07 18:46:51,158 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:46:51" (1/1) ... [2019-12-07 18:46:51,159 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:46:51" (1/1) ... [2019-12-07 18:46:51,160 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:46:51,161 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:46:51,161 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:46:51,161 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:46:51,161 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:46:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_66685718-aa1b-449d-95b7-51029c9bfbc7/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-12-07 18:46:51,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 18:46:51,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:46:51,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:46:51,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 18:46:51,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:46:51,353 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:46:51,353 INFO L287 CfgBuilder]: Removed 15 assume(true) statements. [2019-12-07 18:46:51,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:46:51 BoogieIcfgContainer [2019-12-07 18:46:51,354 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:46:51,355 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:46:51,355 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:46:51,357 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:46:51,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:46:50" (1/3) ... [2019-12-07 18:46:51,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4440f1df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:46:51, skipping insertion in model container [2019-12-07 18:46:51,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:46:51" (2/3) ... [2019-12-07 18:46:51,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4440f1df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:46:51, skipping insertion in model container [2019-12-07 18:46:51,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:46:51" (3/3) ... [2019-12-07 18:46:51,359 INFO L109 eAbstractionObserver]: Analyzing ICFG lcp.c [2019-12-07 18:46:51,365 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:46:51,369 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 18:46:51,376 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-12-07 18:46:51,392 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:46:51,392 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:46:51,392 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:46:51,392 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:46:51,392 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:46:51,393 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:46:51,393 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:46:51,393 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:46:51,403 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-12-07 18:46:51,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 18:46:51,407 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:46:51,407 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:46:51,407 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:46:51,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:46:51,411 INFO L82 PathProgramCache]: Analyzing trace with hash 103127864, now seen corresponding path program 1 times [2019-12-07 18:46:51,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:46:51,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237526250] [2019-12-07 18:46:51,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:46:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:46:51,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:46:51,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237526250] [2019-12-07 18:46:51,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:46:51,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:46:51,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548000977] [2019-12-07 18:46:51,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 18:46:51,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:46:51,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 18:46:51,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 18:46:51,527 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-12-07 18:46:51,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:46:51,537 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2019-12-07 18:46:51,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 18:46:51,538 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-12-07 18:46:51,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:46:51,544 INFO L225 Difference]: With dead ends: 36 [2019-12-07 18:46:51,544 INFO L226 Difference]: Without dead ends: 16 [2019-12-07 18:46:51,546 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 18:46:51,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-12-07 18:46:51,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-12-07 18:46:51,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-12-07 18:46:51,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-12-07 18:46:51,567 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 8 [2019-12-07 18:46:51,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:46:51,567 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-12-07 18:46:51,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 18:46:51,567 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-12-07 18:46:51,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 18:46:51,568 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:46:51,568 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:46:51,568 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:46:51,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:46:51,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1317893681, now seen corresponding path program 1 times [2019-12-07 18:46:51,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:46:51,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758391389] [2019-12-07 18:46:51,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:46:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:46:51,617 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (const Int) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:478) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:250) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:250) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.termWithLocalSimplification(SmtUtils.java:1315) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.termWithLocalSimplification(SmtUtils.java:1196) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.TermTransferrer.convertApplicationTerm(TermTransferrer.java:182) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:339) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:573) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:171) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:300) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:202) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.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.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) 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.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) 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-12-07 18:46:51,621 INFO L168 Benchmark]: Toolchain (without parser) took 693.37 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 77.6 MB). Free memory was 940.3 MB in the beginning and 1.0 GB in the end (delta: -81.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:46:51,621 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 957.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:46:51,622 INFO L168 Benchmark]: CACSL2BoogieTranslator took 188.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 77.6 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -134.2 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:46:51,622 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:46:51,623 INFO L168 Benchmark]: Boogie Preprocessor took 17.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:46:51,623 INFO L168 Benchmark]: RCFGBuilder took 193.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. [2019-12-07 18:46:51,624 INFO L168 Benchmark]: TraceAbstraction took 264.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. [2019-12-07 18:46:51,626 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 957.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 188.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 77.6 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -134.2 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 193.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 264.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 28.0 MB). Peak memory consumption was 28.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Undeclared function symbol (const Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Undeclared function symbol (const Int): de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:478) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 18:46:52,968 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:46:52,970 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:46:52,978 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:46:52,978 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:46:52,979 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:46:52,980 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:46:52,981 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:46:52,982 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:46:52,983 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:46:52,983 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:46:52,984 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:46:52,984 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:46:52,985 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:46:52,986 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:46:52,987 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:46:52,987 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:46:52,988 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:46:52,989 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:46:52,990 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:46:52,992 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:46:52,992 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:46:52,993 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:46:52,994 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:46:52,996 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:46:52,996 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:46:52,996 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:46:52,997 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:46:52,997 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:46:52,998 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:46:52,998 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:46:52,998 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:46:52,999 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:46:52,999 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:46:53,000 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:46:53,000 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:46:53,000 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:46:53,001 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:46:53,001 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:46:53,001 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:46:53,002 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:46:53,002 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_66685718-aa1b-449d-95b7-51029c9bfbc7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-12-07 18:46:53,012 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:46:53,012 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:46:53,013 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:46:53,013 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:46:53,013 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:46:53,014 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:46:53,014 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:46:53,014 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:46:53,014 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:46:53,014 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:46:53,014 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:46:53,014 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:46:53,015 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 18:46:53,015 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 18:46:53,015 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:46:53,015 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:46:53,015 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:46:53,015 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:46:53,015 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:46:53,015 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:46:53,016 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:46:53,016 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:46:53,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:46:53,016 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:46:53,016 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:46:53,016 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:46:53,016 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 18:46:53,016 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 18:46:53,017 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:46:53,017 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:46:53,017 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 18:46:53,017 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_66685718-aa1b-449d-95b7-51029c9bfbc7/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 -> 17e6e52dd20f9be422d05cd630fd9252ae3011a2 [2019-12-07 18:46:53,177 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:46:53,188 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:46:53,191 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:46:53,192 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:46:53,193 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:46:53,193 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_66685718-aa1b-449d-95b7-51029c9bfbc7/bin/uautomizer/../../sv-benchmarks/c/verifythis/lcp.c [2019-12-07 18:46:53,241 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_66685718-aa1b-449d-95b7-51029c9bfbc7/bin/uautomizer/data/d7c0a30c3/a675c85735e34288a621dab4d6e63e8e/FLAG5fc7882be [2019-12-07 18:46:53,575 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:46:53,575 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_66685718-aa1b-449d-95b7-51029c9bfbc7/sv-benchmarks/c/verifythis/lcp.c [2019-12-07 18:46:53,579 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_66685718-aa1b-449d-95b7-51029c9bfbc7/bin/uautomizer/data/d7c0a30c3/a675c85735e34288a621dab4d6e63e8e/FLAG5fc7882be [2019-12-07 18:46:53,588 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_66685718-aa1b-449d-95b7-51029c9bfbc7/bin/uautomizer/data/d7c0a30c3/a675c85735e34288a621dab4d6e63e8e [2019-12-07 18:46:53,590 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:46:53,590 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:46:53,591 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:46:53,591 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:46:53,593 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:46:53,594 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:46:53" (1/1) ... [2019-12-07 18:46:53,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@562a36d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:46:53, skipping insertion in model container [2019-12-07 18:46:53,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:46:53" (1/1) ... [2019-12-07 18:46:53,600 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:46:53,611 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:46:53,718 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:46:53,727 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:46:53,741 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:46:53,753 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:46:53,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:46:53 WrapperNode [2019-12-07 18:46:53,753 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:46:53,753 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:46:53,754 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:46:53,754 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:46:53,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:46:53" (1/1) ... [2019-12-07 18:46:53,795 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:46:53" (1/1) ... [2019-12-07 18:46:53,810 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:46:53,810 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:46:53,810 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:46:53,810 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:46:53,816 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:46:53" (1/1) ... [2019-12-07 18:46:53,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:46:53" (1/1) ... [2019-12-07 18:46:53,819 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:46:53" (1/1) ... [2019-12-07 18:46:53,819 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:46:53" (1/1) ... [2019-12-07 18:46:53,823 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:46:53" (1/1) ... [2019-12-07 18:46:53,826 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:46:53" (1/1) ... [2019-12-07 18:46:53,827 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:46:53" (1/1) ... [2019-12-07 18:46:53,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:46:53,829 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:46:53,829 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:46:53,829 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:46:53,830 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:46:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_66685718-aa1b-449d-95b7-51029c9bfbc7/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-12-07 18:46:53,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 18:46:53,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 18:46:53,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:46:53,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:46:53,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:46:54,058 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:46:54,059 INFO L287 CfgBuilder]: Removed 15 assume(true) statements. [2019-12-07 18:46:54,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:46:54 BoogieIcfgContainer [2019-12-07 18:46:54,059 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:46:54,060 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:46:54,060 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:46:54,062 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:46:54,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:46:53" (1/3) ... [2019-12-07 18:46:54,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c35f56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:46:54, skipping insertion in model container [2019-12-07 18:46:54,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:46:53" (2/3) ... [2019-12-07 18:46:54,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c35f56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:46:54, skipping insertion in model container [2019-12-07 18:46:54,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:46:54" (3/3) ... [2019-12-07 18:46:54,064 INFO L109 eAbstractionObserver]: Analyzing ICFG lcp.c [2019-12-07 18:46:54,070 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:46:54,075 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 18:46:54,082 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-12-07 18:46:54,097 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:46:54,097 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:46:54,097 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:46:54,097 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:46:54,097 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:46:54,097 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:46:54,097 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:46:54,097 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:46:54,107 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-12-07 18:46:54,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 18:46:54,111 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:46:54,112 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:46:54,112 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:46:54,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:46:54,116 INFO L82 PathProgramCache]: Analyzing trace with hash 103127864, now seen corresponding path program 1 times [2019-12-07 18:46:54,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:46:54,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [102711473] [2019-12-07 18:46:54,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_66685718-aa1b-449d-95b7-51029c9bfbc7/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 18:46:54,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:46:54,191 INFO L264 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 1 conjunts are in the unsatisfiable core [2019-12-07 18:46:54,195 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:46:54,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:46:54,204 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:46:54,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:46:54,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [102711473] [2019-12-07 18:46:54,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:46:54,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 18:46:54,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018025276] [2019-12-07 18:46:54,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 18:46:54,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:46:54,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 18:46:54,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 18:46:54,222 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-12-07 18:46:54,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:46:54,233 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2019-12-07 18:46:54,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 18:46:54,234 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-12-07 18:46:54,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:46:54,240 INFO L225 Difference]: With dead ends: 36 [2019-12-07 18:46:54,240 INFO L226 Difference]: Without dead ends: 16 [2019-12-07 18:46:54,242 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 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-12-07 18:46:54,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-12-07 18:46:54,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-12-07 18:46:54,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-12-07 18:46:54,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-12-07 18:46:54,264 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 8 [2019-12-07 18:46:54,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:46:54,265 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-12-07 18:46:54,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 18:46:54,265 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-12-07 18:46:54,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 18:46:54,265 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:46:54,265 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:46:54,466 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 18:46:54,466 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:46:54,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:46:54,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1317893681, now seen corresponding path program 1 times [2019-12-07 18:46:54,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:46:54,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1058224580] [2019-12-07 18:46:54,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_66685718-aa1b-449d-95b7-51029c9bfbc7/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 18:46:54,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:46:54,566 INFO L264 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 18:46:54,569 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:46:54,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:46:54,618 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:46:54,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:46:54,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1058224580] [2019-12-07 18:46:54,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:46:54,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 18:46:54,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11976900] [2019-12-07 18:46:54,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:46:54,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:46:54,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:46:54,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:46:54,663 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 6 states. [2019-12-07 18:46:54,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:46:54,718 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2019-12-07 18:46:54,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:46:54,719 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-12-07 18:46:54,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:46:54,720 INFO L225 Difference]: With dead ends: 29 [2019-12-07 18:46:54,720 INFO L226 Difference]: Without dead ends: 19 [2019-12-07 18:46:54,721 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:46:54,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-12-07 18:46:54,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-12-07 18:46:54,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-12-07 18:46:54,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-12-07 18:46:54,724 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 10 [2019-12-07 18:46:54,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:46:54,724 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-12-07 18:46:54,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:46:54,724 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-12-07 18:46:54,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 18:46:54,725 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:46:54,725 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:46:54,925 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 18:46:54,926 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:46:54,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:46:54,926 INFO L82 PathProgramCache]: Analyzing trace with hash -573521694, now seen corresponding path program 1 times [2019-12-07 18:46:54,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:46:54,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [15831991] [2019-12-07 18:46:54,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_66685718-aa1b-449d-95b7-51029c9bfbc7/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 18:46:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:46:55,050 INFO L264 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-07 18:46:55,052 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:46:55,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:46:59,365 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:46:59,366 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 104 [2019-12-07 18:46:59,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:46:59,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:46:59,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:46:59,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:46:59,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:46:59,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:46:59,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:46:59,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:46:59,374 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:46:59,391 INFO L614 ElimStorePlain]: treesize reduction 104, result has 2.8 percent of original size [2019-12-07 18:46:59,392 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:46:59,392 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:53, output treesize:3 [2019-12-07 18:46:59,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:46:59,413 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:47:05,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:47:05,897 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-12-07 18:47:05,898 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:47:05,898 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 152 [2019-12-07 18:47:05,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:47:05,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:47:05,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:47:05,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:47:05,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:47:05,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:47:05,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:47:05,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:47:05,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:47:05,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:47:05,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:47:05,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:47:05,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:47:05,909 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-12-07 18:47:06,655 WARN L192 SmtUtils]: Spent 744.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2019-12-07 18:47:06,656 INFO L614 ElimStorePlain]: treesize reduction 983, result has 12.7 percent of original size [2019-12-07 18:47:06,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:47:06,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:47:06,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:47:06,659 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:47:06,659 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:143 [2019-12-07 18:47:06,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:47:06,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:47:06,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:47:07,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:47:07,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:47:07,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:47:07,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:47:07,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:47:07,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [15831991] [2019-12-07 18:47:07,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:47:07,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-12-07 18:47:07,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877989716] [2019-12-07 18:47:07,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 18:47:07,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:47:07,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 18:47:07,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=126, Unknown=3, NotChecked=0, Total=156 [2019-12-07 18:47:07,819 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 13 states. [2019-12-07 18:47:14,207 WARN L192 SmtUtils]: Spent 6.25 s on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-12-07 18:47:18,555 WARN L192 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2019-12-07 18:47:20,888 WARN L192 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-12-07 18:47:29,284 WARN L192 SmtUtils]: Spent 8.11 s on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-12-07 18:47:39,504 WARN L192 SmtUtils]: Spent 8.13 s on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2019-12-07 18:47:49,790 WARN L192 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 36 [2019-12-07 18:48:22,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:48:22,969 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2019-12-07 18:48:22,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 18:48:22,974 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-12-07 18:48:22,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:48:22,975 INFO L225 Difference]: With dead ends: 44 [2019-12-07 18:48:22,975 INFO L226 Difference]: Without dead ends: 42 [2019-12-07 18:48:22,976 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 67.6s TimeCoverageRelationStatistics Valid=132, Invalid=552, Unknown=18, NotChecked=0, Total=702 [2019-12-07 18:48:22,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-12-07 18:48:22,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 27. [2019-12-07 18:48:22,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 18:48:22,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2019-12-07 18:48:22,980 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 13 [2019-12-07 18:48:22,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:48:22,980 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-12-07 18:48:22,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 18:48:22,980 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2019-12-07 18:48:22,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:48:22,981 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:48:22,981 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:48:23,181 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 18:48:23,182 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:48:23,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:48:23,183 INFO L82 PathProgramCache]: Analyzing trace with hash -401001596, now seen corresponding path program 1 times [2019-12-07 18:48:23,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:48:23,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1186829721] [2019-12-07 18:48:23,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_66685718-aa1b-449d-95b7-51029c9bfbc7/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 18:48:23,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:48:23,302 WARN L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 45 conjunts are in the unsatisfiable core [2019-12-07 18:48:23,304 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:48:23,856 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-12-07 18:48:24,339 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2019-12-07 18:48:24,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:48:24,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:48:24,403 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:48:25,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:48:25,253 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-12-07 18:48:25,253 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:48:25,254 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 152 [2019-12-07 18:48:25,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:48:25,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:48:25,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:48:25,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:48:25,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:48:25,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:48:25,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:48:25,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:48:25,258 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:48:25,831 WARN L192 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-12-07 18:48:25,832 INFO L614 ElimStorePlain]: treesize reduction 251, result has 30.1 percent of original size [2019-12-07 18:48:25,832 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:48:25,833 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:108 [2019-12-07 18:48:26,160 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-12-07 18:48:26,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:48:26,773 WARN L192 SmtUtils]: Spent 383.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-12-07 18:48:27,446 WARN L192 SmtUtils]: Spent 353.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-12-07 18:48:28,135 WARN L192 SmtUtils]: Spent 380.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-12-07 18:48:28,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:48:28,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:48:29,184 WARN L192 SmtUtils]: Spent 628.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-12-07 18:48:29,191 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:48:29,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1186829721] [2019-12-07 18:48:29,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:48:29,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2019-12-07 18:48:29,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832966739] [2019-12-07 18:48:29,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 18:48:29,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:48:29,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 18:48:29,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2019-12-07 18:48:29,194 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 23 states. [2019-12-07 18:48:30,354 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-12-07 18:48:30,744 WARN L192 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2019-12-07 18:48:31,066 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-12-07 18:48:33,224 WARN L192 SmtUtils]: Spent 1.89 s on a formula simplification that was a NOOP. DAG size: 90 [2019-12-07 18:48:35,743 WARN L192 SmtUtils]: Spent 2.36 s on a formula simplification. DAG size of input: 68 DAG size of output: 49 [2019-12-07 18:48:38,500 WARN L192 SmtUtils]: Spent 2.61 s on a formula simplification. DAG size of input: 94 DAG size of output: 75 [2019-12-07 18:48:40,503 WARN L192 SmtUtils]: Spent 1.72 s on a formula simplification that was a NOOP. DAG size: 102 [2019-12-07 18:48:43,235 WARN L192 SmtUtils]: Spent 2.63 s on a formula simplification. DAG size of input: 97 DAG size of output: 78 [2019-12-07 18:48:44,822 WARN L192 SmtUtils]: Spent 1.27 s on a formula simplification that was a NOOP. DAG size: 96 [2019-12-07 18:48:46,223 WARN L192 SmtUtils]: Spent 351.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-12-07 18:48:47,692 WARN L192 SmtUtils]: Spent 1.23 s on a formula simplification that was a NOOP. DAG size: 84 [2019-12-07 18:48:49,941 WARN L192 SmtUtils]: Spent 1.79 s on a formula simplification that was a NOOP. DAG size: 112 [2019-12-07 18:48:50,690 WARN L192 SmtUtils]: Spent 471.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-12-07 18:48:53,463 WARN L192 SmtUtils]: Spent 2.68 s on a formula simplification. DAG size of input: 97 DAG size of output: 78 [2019-12-07 18:48:56,003 WARN L192 SmtUtils]: Spent 2.16 s on a formula simplification that was a NOOP. DAG size: 132 [2019-12-07 18:48:56,959 WARN L192 SmtUtils]: Spent 672.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-12-07 18:48:58,486 WARN L192 SmtUtils]: Spent 1.23 s on a formula simplification that was a NOOP. DAG size: 90 [2019-12-07 18:49:00,702 WARN L192 SmtUtils]: Spent 1.87 s on a formula simplification that was a NOOP. DAG size: 135 [2019-12-07 18:49:01,463 WARN L192 SmtUtils]: Spent 379.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-12-07 18:49:05,007 WARN L192 SmtUtils]: Spent 1.18 s on a formula simplification that was a NOOP. DAG size: 87 [2019-12-07 18:49:05,895 WARN L192 SmtUtils]: Spent 537.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-12-07 18:49:08,520 WARN L192 SmtUtils]: Spent 2.19 s on a formula simplification that was a NOOP. DAG size: 136 [2019-12-07 18:49:09,741 WARN L192 SmtUtils]: Spent 766.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-12-07 18:49:10,665 WARN L192 SmtUtils]: Spent 689.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-07 18:49:11,872 WARN L192 SmtUtils]: Spent 803.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-12-07 18:49:14,470 WARN L192 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-12-07 18:49:15,819 WARN L192 SmtUtils]: Spent 800.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-12-07 18:49:15,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:49:15,950 INFO L93 Difference]: Finished difference Result 112 states and 129 transitions. [2019-12-07 18:49:15,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-07 18:49:15,951 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 16 [2019-12-07 18:49:15,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:49:15,953 INFO L225 Difference]: With dead ends: 112 [2019-12-07 18:49:15,953 INFO L226 Difference]: Without dead ends: 92 [2019-12-07 18:49:15,954 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 45.0s TimeCoverageRelationStatistics Valid=641, Invalid=2439, Unknown=0, NotChecked=0, Total=3080 [2019-12-07 18:49:15,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-12-07 18:49:15,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 48. [2019-12-07 18:49:15,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-07 18:49:15,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2019-12-07 18:49:15,962 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 16 [2019-12-07 18:49:15,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:49:15,963 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2019-12-07 18:49:15,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 18:49:15,963 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2019-12-07 18:49:15,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:49:15,963 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:49:15,963 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:49:16,164 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 18:49:16,164 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:49:16,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:49:16,165 INFO L82 PathProgramCache]: Analyzing trace with hash -2053002095, now seen corresponding path program 2 times [2019-12-07 18:49:16,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:49:16,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1835305500] [2019-12-07 18:49:16,166 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_66685718-aa1b-449d-95b7-51029c9bfbc7/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 18:49:16,221 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-12-07 18:49:16,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:49:16,224 INFO L264 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 18:49:16,225 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:49:16,231 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2019-12-07 18:49:16,231 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:49:16,233 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:49:16,233 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:49:16,233 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:7, output treesize:6 [2019-12-07 18:49:16,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:16,255 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 18:49:16,256 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:49:16,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:22,321 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-07 18:49:22,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1835305500] [2019-12-07 18:49:22,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:49:22,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-12-07 18:49:22,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462381925] [2019-12-07 18:49:22,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:49:22,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:49:22,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:49:22,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=26, Unknown=3, NotChecked=0, Total=42 [2019-12-07 18:49:22,323 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand 7 states. [2019-12-07 18:49:24,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:49:24,401 INFO L93 Difference]: Finished difference Result 62 states and 77 transitions. [2019-12-07 18:49:24,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:49:24,402 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-12-07 18:49:24,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:49:24,403 INFO L225 Difference]: With dead ends: 62 [2019-12-07 18:49:24,403 INFO L226 Difference]: Without dead ends: 46 [2019-12-07 18:49:24,403 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=27, Invalid=41, Unknown=4, NotChecked=0, Total=72 [2019-12-07 18:49:24,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-12-07 18:49:24,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 26. [2019-12-07 18:49:24,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 18:49:24,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-12-07 18:49:24,407 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 16 [2019-12-07 18:49:24,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:49:24,408 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-12-07 18:49:24,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:49:24,408 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-12-07 18:49:24,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:49:24,408 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:49:24,408 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:49:24,609 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 18:49:24,609 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:49:24,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:49:24,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1995743793, now seen corresponding path program 1 times [2019-12-07 18:49:24,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:49:24,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1906724956] [2019-12-07 18:49:24,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_66685718-aa1b-449d-95b7-51029c9bfbc7/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 18:49:24,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:49:24,727 WARN L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 47 conjunts are in the unsatisfiable core [2019-12-07 18:49:24,728 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:49:25,021 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-12-07 18:49:25,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:25,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:38,073 WARN L192 SmtUtils]: Spent 12.66 s on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-12-07 18:49:38,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:38,350 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-12-07 18:49:38,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:49:42,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:49:42,918 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-12-07 18:49:42,919 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:49:42,919 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 59 treesize of output 223 [2019-12-07 18:49:42,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:49:42,965 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 18:49:43,226 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 3 [2019-12-07 18:49:43,226 INFO L614 ElimStorePlain]: treesize reduction 1342, result has 0.2 percent of original size [2019-12-07 18:49:43,226 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:49:43,226 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:97, output treesize:3 [2019-12-07 18:49:43,286 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:49:43,287 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:49:57,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:10,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:23,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,101 WARN L192 SmtUtils]: Spent 717.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 83 [2019-12-07 18:50:24,101 INFO L343 Elim1Store]: treesize reduction 46, result has 87.4 percent of original size [2019-12-07 18:50:24,102 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 80 treesize of output 330 [2019-12-07 18:50:24,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:50:24,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:24,152 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 5 xjuncts. [2019-12-07 18:50:32,293 WARN L192 SmtUtils]: Spent 8.14 s on a formula simplification. DAG size of input: 162 DAG size of output: 80 [2019-12-07 18:50:32,294 INFO L614 ElimStorePlain]: treesize reduction 57311, result has 1.7 percent of original size [2019-12-07 18:50:32,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:50:32,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:32,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:32,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:32,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:32,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:32,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:32,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:32,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:32,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:32,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:32,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:32,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:32,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:32,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:32,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:32,300 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:50:32,300 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:106, output treesize:975 [2019-12-07 18:50:32,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:50:32,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:32,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:32,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:32,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:32,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:32,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:32,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:32,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:32,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:32,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:32,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:32,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:32,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:32,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:32,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:33,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:33,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:50:33,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:33,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:33,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:33,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:33,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:33,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:33,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:33,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:33,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:33,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:33,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:33,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:33,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:33,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:50:33,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:51:08,129 WARN L192 SmtUtils]: Spent 33.71 s on a formula simplification. DAG size of input: 118 DAG size of output: 76 [2019-12-07 18:51:08,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:51:08,161 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:51:08,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1906724956] [2019-12-07 18:51:08,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:51:08,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2019-12-07 18:51:08,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621863164] [2019-12-07 18:51:08,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 18:51:08,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:51:08,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 18:51:08,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=349, Unknown=19, NotChecked=0, Total=420 [2019-12-07 18:51:08,162 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 21 states. [2019-12-07 18:51:51,371 WARN L192 SmtUtils]: Spent 16.29 s on a formula simplification that was a NOOP. DAG size: 80 [2019-12-07 18:52:52,835 WARN L192 SmtUtils]: Spent 1.02 m on a formula simplification. DAG size of input: 91 DAG size of output: 85 [2019-12-07 18:53:16,055 WARN L192 SmtUtils]: Spent 14.23 s on a formula simplification that was a NOOP. DAG size: 71 [2019-12-07 18:53:55,742 WARN L192 SmtUtils]: Spent 32.59 s on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-12-07 18:55:06,112 WARN L192 SmtUtils]: Spent 1.07 m on a formula simplification. DAG size of input: 87 DAG size of output: 86 [2019-12-07 18:56:30,337 WARN L192 SmtUtils]: Spent 1.35 m on a formula simplification. DAG size of input: 91 DAG size of output: 80 [2019-12-07 18:57:14,528 WARN L192 SmtUtils]: Spent 20.82 s on a formula simplification. DAG size of input: 102 DAG size of output: 77 [2019-12-07 18:58:38,371 WARN L192 SmtUtils]: Spent 1.23 m on a formula simplification. DAG size of input: 153 DAG size of output: 152 [2019-12-07 18:59:33,063 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-12-07 18:59:33,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 18:59:33,264 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 18:59:33,265 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:621) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:118) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:182) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:163) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:133) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:698) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 52 more [2019-12-07 18:59:33,272 INFO L168 Benchmark]: Toolchain (without parser) took 759680.92 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 952.4 MB in the beginning and 829.9 MB in the end (delta: 122.5 MB). Peak memory consumption was 225.2 MB. Max. memory is 11.5 GB. [2019-12-07 18:59:33,273 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:59:33,274 INFO L168 Benchmark]: CACSL2BoogieTranslator took 162.30 ms. Allocated memory is still 1.0 GB. Free memory was 952.4 MB in the beginning and 941.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:59:33,275 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -176.2 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. [2019-12-07 18:59:33,276 INFO L168 Benchmark]: Boogie Preprocessor took 18.79 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-12-07 18:59:33,277 INFO L168 Benchmark]: RCFGBuilder took 230.41 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: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 18:59:33,278 INFO L168 Benchmark]: TraceAbstraction took 759209.97 ms. Allocated memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: -26.2 MB). Free memory was 1.1 GB in the beginning and 829.9 MB in the end (delta: 269.4 MB). Peak memory consumption was 243.2 MB. Max. memory is 11.5 GB. [2019-12-07 18:59:33,283 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 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 162.30 ms. Allocated memory is still 1.0 GB. Free memory was 952.4 MB in the beginning and 941.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -176.2 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.79 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 230.41 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: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 759209.97 ms. Allocated memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: -26.2 MB). Free memory was 1.1 GB in the beginning and 829.9 MB in the end (delta: 269.4 MB). Peak memory consumption was 243.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...