./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/eqn5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a648aee0-dc33-496c-b354-4a4d268abfad/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a648aee0-dc33-496c-b354-4a4d268abfad/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a648aee0-dc33-496c-b354-4a4d268abfad/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a648aee0-dc33-496c-b354-4a4d268abfad/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/eqn5.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a648aee0-dc33-496c-b354-4a4d268abfad/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a648aee0-dc33-496c-b354-4a4d268abfad/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 8f1919726cc43e8993ebe9d65d5d8d40e06595e6 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_a648aee0-dc33-496c-b354-4a4d268abfad/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a648aee0-dc33-496c-b354-4a4d268abfad/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a648aee0-dc33-496c-b354-4a4d268abfad/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a648aee0-dc33-496c-b354-4a4d268abfad/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/eqn5.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a648aee0-dc33-496c-b354-4a4d268abfad/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a648aee0-dc33-496c-b354-4a4d268abfad/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 8f1919726cc43e8993ebe9d65d5d8d40e06595e6 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:38:13,117 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:38:13,119 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:38:13,134 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:38:13,134 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:38:13,136 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:38:13,138 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:38:13,150 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:38:13,154 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:38:13,159 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:38:13,160 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:38:13,161 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:38:13,161 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:38:13,163 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:38:13,165 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:38:13,166 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:38:13,167 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:38:13,167 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:38:13,169 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:38:13,173 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:38:13,176 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:38:13,179 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:38:13,182 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:38:13,183 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:38:13,186 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:38:13,186 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:38:13,186 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:38:13,188 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:38:13,188 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:38:13,189 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:38:13,189 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:38:13,190 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:38:13,190 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:38:13,191 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:38:13,192 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:38:13,193 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:38:13,193 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:38:13,193 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:38:13,194 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:38:13,194 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:38:13,195 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:38:13,196 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a648aee0-dc33-496c-b354-4a4d268abfad/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:38:13,221 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:38:13,221 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:38:13,222 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:38:13,223 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:38:13,223 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:38:13,223 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:38:13,223 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:38:13,224 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:38:13,224 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:38:13,224 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:38:13,224 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:38:13,224 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:38:13,225 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:38:13,225 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:38:13,225 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:38:13,225 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:38:13,225 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:38:13,226 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:38:13,226 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:38:13,226 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:38:13,226 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:38:13,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:38:13,227 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:38:13,227 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:38:13,227 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:38:13,227 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:38:13,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:38:13,228 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:38:13,228 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_a648aee0-dc33-496c-b354-4a4d268abfad/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 -> 8f1919726cc43e8993ebe9d65d5d8d40e06595e6 [2019-11-16 00:38:13,273 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:38:13,287 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:38:13,290 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:38:13,292 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:38:13,292 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:38:13,293 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a648aee0-dc33-496c-b354-4a4d268abfad/bin/uautomizer/../../sv-benchmarks/c/array-fpi/eqn5.c [2019-11-16 00:38:13,346 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a648aee0-dc33-496c-b354-4a4d268abfad/bin/uautomizer/data/c6f6adf16/bfd58071af554b7f9d375747af301d6e/FLAG0614c0472 [2019-11-16 00:38:13,775 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:38:13,775 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a648aee0-dc33-496c-b354-4a4d268abfad/sv-benchmarks/c/array-fpi/eqn5.c [2019-11-16 00:38:13,779 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a648aee0-dc33-496c-b354-4a4d268abfad/bin/uautomizer/data/c6f6adf16/bfd58071af554b7f9d375747af301d6e/FLAG0614c0472 [2019-11-16 00:38:13,791 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a648aee0-dc33-496c-b354-4a4d268abfad/bin/uautomizer/data/c6f6adf16/bfd58071af554b7f9d375747af301d6e [2019-11-16 00:38:13,793 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:38:13,794 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:38:13,795 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:38:13,795 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:38:13,798 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:38:13,799 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:38:13" (1/1) ... [2019-11-16 00:38:13,801 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42e4af96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:13, skipping insertion in model container [2019-11-16 00:38:13,801 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:38:13" (1/1) ... [2019-11-16 00:38:13,808 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:38:13,823 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:38:14,042 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:38:14,051 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:38:14,069 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:38:14,084 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:38:14,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:14 WrapperNode [2019-11-16 00:38:14,085 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:38:14,086 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:38:14,086 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:38:14,086 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:38:14,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:14" (1/1) ... [2019-11-16 00:38:14,102 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:14" (1/1) ... [2019-11-16 00:38:14,128 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:38:14,130 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:38:14,130 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:38:14,130 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:38:14,139 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:14" (1/1) ... [2019-11-16 00:38:14,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:14" (1/1) ... [2019-11-16 00:38:14,152 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:14" (1/1) ... [2019-11-16 00:38:14,152 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:14" (1/1) ... [2019-11-16 00:38:14,157 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:14" (1/1) ... [2019-11-16 00:38:14,160 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:14" (1/1) ... [2019-11-16 00:38:14,161 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:14" (1/1) ... [2019-11-16 00:38:14,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:38:14,164 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:38:14,164 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:38:14,164 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:38:14,165 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a648aee0-dc33-496c-b354-4a4d268abfad/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:38:14,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:38:14,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:38:14,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:38:14,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:38:14,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:38:14,535 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:38:14,536 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-16 00:38:14,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:38:14 BoogieIcfgContainer [2019-11-16 00:38:14,537 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:38:14,537 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:38:14,537 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:38:14,540 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:38:14,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:38:13" (1/3) ... [2019-11-16 00:38:14,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c9482b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:38:14, skipping insertion in model container [2019-11-16 00:38:14,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:38:14" (2/3) ... [2019-11-16 00:38:14,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c9482b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:38:14, skipping insertion in model container [2019-11-16 00:38:14,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:38:14" (3/3) ... [2019-11-16 00:38:14,543 INFO L109 eAbstractionObserver]: Analyzing ICFG eqn5.c [2019-11-16 00:38:14,561 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:38:14,570 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:38:14,587 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:38:14,613 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:38:14,623 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:38:14,623 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:38:14,623 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:38:14,623 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:38:14,624 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:38:14,624 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:38:14,624 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:38:14,638 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-11-16 00:38:14,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-16 00:38:14,645 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:14,646 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:14,648 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:14,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:14,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1486647931, now seen corresponding path program 1 times [2019-11-16 00:38:14,660 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:14,661 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580426142] [2019-11-16 00:38:14,661 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:14,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:14,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:14,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:38:14,764 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580426142] [2019-11-16 00:38:14,765 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:14,773 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:38:14,774 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409706749] [2019-11-16 00:38:14,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-16 00:38:14,778 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:14,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-16 00:38:14,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-16 00:38:14,788 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-11-16 00:38:14,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:14,803 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2019-11-16 00:38:14,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-16 00:38:14,804 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-16 00:38:14,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:14,812 INFO L225 Difference]: With dead ends: 33 [2019-11-16 00:38:14,812 INFO L226 Difference]: Without dead ends: 15 [2019-11-16 00:38:14,814 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-16 00:38:14,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-11-16 00:38:14,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-16 00:38:14,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-16 00:38:14,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-11-16 00:38:14,841 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 10 [2019-11-16 00:38:14,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:14,842 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-11-16 00:38:14,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-16 00:38:14,842 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-11-16 00:38:14,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-16 00:38:14,843 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:14,843 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:14,843 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:14,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:14,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1772723449, now seen corresponding path program 1 times [2019-11-16 00:38:14,844 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:14,844 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024800471] [2019-11-16 00:38:14,845 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:14,845 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:14,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:14,863 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:38:14,864 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [70039413] [2019-11-16 00:38:14,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a648aee0-dc33-496c-b354-4a4d268abfad/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:38:14,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:14,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:38:14,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:38:15,020 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:15,021 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 39 [2019-11-16 00:38:15,022 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:15,054 INFO L567 ElimStorePlain]: treesize reduction 16, result has 59.0 percent of original size [2019-11-16 00:38:15,056 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:38:15,056 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:7 [2019-11-16 00:38:15,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:15,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:38:15,101 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024800471] [2019-11-16 00:38:15,101 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-16 00:38:15,101 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70039413] [2019-11-16 00:38:15,102 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:15,102 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:38:15,102 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923237355] [2019-11-16 00:38:15,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:38:15,104 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:15,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:38:15,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:15,105 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 5 states. [2019-11-16 00:38:15,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:15,198 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-11-16 00:38:15,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:38:15,199 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-16 00:38:15,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:15,199 INFO L225 Difference]: With dead ends: 32 [2019-11-16 00:38:15,200 INFO L226 Difference]: Without dead ends: 30 [2019-11-16 00:38:15,200 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:38:15,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-16 00:38:15,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 21. [2019-11-16 00:38:15,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-16 00:38:15,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-11-16 00:38:15,206 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 10 [2019-11-16 00:38:15,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:15,206 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-11-16 00:38:15,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:38:15,207 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-11-16 00:38:15,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-16 00:38:15,207 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:15,208 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:15,421 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:38:15,422 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:15,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:15,422 INFO L82 PathProgramCache]: Analyzing trace with hash 130601367, now seen corresponding path program 1 times [2019-11-16 00:38:15,422 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:15,423 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770604035] [2019-11-16 00:38:15,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:15,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:15,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:15,446 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:38:15,447 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [147078568] [2019-11-16 00:38:15,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a648aee0-dc33-496c-b354-4a4d268abfad/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:38:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:15,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:38:15,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:38:15,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:38:15,544 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770604035] [2019-11-16 00:38:15,544 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-16 00:38:15,544 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147078568] [2019-11-16 00:38:15,544 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:15,544 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:38:15,545 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022615173] [2019-11-16 00:38:15,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:38:15,545 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:15,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:38:15,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:15,546 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2019-11-16 00:38:15,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:15,651 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2019-11-16 00:38:15,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:38:15,652 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-16 00:38:15,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:15,653 INFO L225 Difference]: With dead ends: 47 [2019-11-16 00:38:15,653 INFO L226 Difference]: Without dead ends: 38 [2019-11-16 00:38:15,654 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:38:15,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-16 00:38:15,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 21. [2019-11-16 00:38:15,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-16 00:38:15,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2019-11-16 00:38:15,661 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 12 [2019-11-16 00:38:15,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:15,662 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2019-11-16 00:38:15,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:38:15,662 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2019-11-16 00:38:15,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-16 00:38:15,663 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:15,663 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:15,866 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:38:15,867 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:15,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:15,867 INFO L82 PathProgramCache]: Analyzing trace with hash 827904471, now seen corresponding path program 1 times [2019-11-16 00:38:15,867 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:15,868 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705222595] [2019-11-16 00:38:15,868 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:15,868 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:15,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:15,895 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:38:15,895 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [233256047] [2019-11-16 00:38:15,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a648aee0-dc33-496c-b354-4a4d268abfad/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:38:15,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:15,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:38:15,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:38:15,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:38:15,968 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705222595] [2019-11-16 00:38:15,969 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-16 00:38:15,969 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233256047] [2019-11-16 00:38:15,969 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:38:15,969 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-11-16 00:38:15,969 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020030631] [2019-11-16 00:38:15,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:38:15,970 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:15,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:38:15,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:38:15,970 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 5 states. [2019-11-16 00:38:16,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:16,076 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-11-16 00:38:16,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:38:16,077 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-16 00:38:16,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:16,077 INFO L225 Difference]: With dead ends: 42 [2019-11-16 00:38:16,078 INFO L226 Difference]: Without dead ends: 35 [2019-11-16 00:38:16,078 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:38:16,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-16 00:38:16,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 22. [2019-11-16 00:38:16,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-16 00:38:16,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-11-16 00:38:16,083 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 12 [2019-11-16 00:38:16,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:16,083 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-11-16 00:38:16,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:38:16,083 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-11-16 00:38:16,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-16 00:38:16,084 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:16,084 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:16,289 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:38:16,289 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:16,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:16,290 INFO L82 PathProgramCache]: Analyzing trace with hash 437833903, now seen corresponding path program 1 times [2019-11-16 00:38:16,290 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:16,290 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904756196] [2019-11-16 00:38:16,290 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:16,290 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:16,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:16,301 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:38:16,301 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1575597532] [2019-11-16 00:38:16,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a648aee0-dc33-496c-b354-4a4d268abfad/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:38:16,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:16,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:38:16,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:38:16,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:38:16,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904756196] [2019-11-16 00:38:16,374 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-16 00:38:16,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575597532] [2019-11-16 00:38:16,375 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:38:16,375 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:38:16,375 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940308644] [2019-11-16 00:38:16,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:38:16,376 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:16,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:38:16,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:38:16,376 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 6 states. [2019-11-16 00:38:16,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:16,460 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2019-11-16 00:38:16,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:38:16,463 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-16 00:38:16,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:16,464 INFO L225 Difference]: With dead ends: 39 [2019-11-16 00:38:16,464 INFO L226 Difference]: Without dead ends: 25 [2019-11-16 00:38:16,465 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:38:16,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-16 00:38:16,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2019-11-16 00:38:16,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-16 00:38:16,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-11-16 00:38:16,468 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2019-11-16 00:38:16,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:16,468 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-16 00:38:16,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:38:16,468 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-11-16 00:38:16,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-16 00:38:16,469 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:16,469 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:16,670 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:38:16,670 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:16,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:16,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1602337035, now seen corresponding path program 1 times [2019-11-16 00:38:16,673 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:16,673 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130823791] [2019-11-16 00:38:16,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:16,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:16,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:16,685 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:38:16,687 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [68566436] [2019-11-16 00:38:16,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a648aee0-dc33-496c-b354-4a4d268abfad/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:38:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:16,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-16 00:38:16,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:38:16,764 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-16 00:38:16,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:16,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:16,779 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-16 00:38:16,779 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:16,790 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:16,790 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:38:16,790 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:19 [2019-11-16 00:38:16,868 INFO L341 Elim1Store]: treesize reduction 54, result has 46.0 percent of original size [2019-11-16 00:38:16,869 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 72 [2019-11-16 00:38:16,870 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:16,910 INFO L567 ElimStorePlain]: treesize reduction 27, result has 64.5 percent of original size [2019-11-16 00:38:16,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:16,912 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:38:16,913 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:49 [2019-11-16 00:38:16,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:16,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:16,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:16,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:17,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:17,047 INFO L392 ElimStorePlain]: Different costs {12=[|v_#memory_int_12|], 20=[v_prenex_4]} [2019-11-16 00:38:17,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:17,063 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-16 00:38:17,063 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 47 [2019-11-16 00:38:17,065 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:17,107 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:17,114 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:17,147 INFO L341 Elim1Store]: treesize reduction 17, result has 60.5 percent of original size [2019-11-16 00:38:17,148 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 89 [2019-11-16 00:38:17,150 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:17,216 INFO L567 ElimStorePlain]: treesize reduction 59, result has 65.7 percent of original size [2019-11-16 00:38:17,218 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-11-16 00:38:17,219 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:115, output treesize:113 [2019-11-16 00:38:17,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:17,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:38:17,391 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130823791] [2019-11-16 00:38:17,392 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-16 00:38:17,392 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68566436] [2019-11-16 00:38:17,392 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:38:17,392 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-11-16 00:38:17,392 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5499790] [2019-11-16 00:38:17,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:38:17,393 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:17,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:38:17,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:38:17,394 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 8 states. [2019-11-16 00:38:17,748 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2019-11-16 00:38:18,079 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 68 [2019-11-16 00:38:18,269 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 70 [2019-11-16 00:38:18,491 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2019-11-16 00:38:18,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:18,529 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-11-16 00:38:18,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:38:18,530 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-11-16 00:38:18,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:18,531 INFO L225 Difference]: With dead ends: 42 [2019-11-16 00:38:18,531 INFO L226 Difference]: Without dead ends: 40 [2019-11-16 00:38:18,532 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:38:18,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-16 00:38:18,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 26. [2019-11-16 00:38:18,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-16 00:38:18,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-11-16 00:38:18,541 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 14 [2019-11-16 00:38:18,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:18,542 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-11-16 00:38:18,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:38:18,543 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-11-16 00:38:18,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-16 00:38:18,544 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:18,544 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:18,745 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:38:18,745 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:18,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:18,745 INFO L82 PathProgramCache]: Analyzing trace with hash -602215277, now seen corresponding path program 2 times [2019-11-16 00:38:18,745 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:18,745 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513302891] [2019-11-16 00:38:18,746 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:18,746 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:18,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:18,754 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:38:18,754 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [662334239] [2019-11-16 00:38:18,754 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a648aee0-dc33-496c-b354-4a4d268abfad/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:38:18,793 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:38:18,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:38:18,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:38:18,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:38:18,848 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:38:18,848 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513302891] [2019-11-16 00:38:18,848 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-16 00:38:18,848 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662334239] [2019-11-16 00:38:18,849 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:38:18,849 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-11-16 00:38:18,849 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385158497] [2019-11-16 00:38:18,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:38:18,849 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:18,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:38:18,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:38:18,850 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 7 states. [2019-11-16 00:38:18,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:18,974 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2019-11-16 00:38:18,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:38:18,976 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-11-16 00:38:18,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:18,977 INFO L225 Difference]: With dead ends: 59 [2019-11-16 00:38:18,977 INFO L226 Difference]: Without dead ends: 50 [2019-11-16 00:38:18,977 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:38:18,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-16 00:38:18,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 26. [2019-11-16 00:38:18,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-16 00:38:18,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2019-11-16 00:38:18,983 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 16 [2019-11-16 00:38:18,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:18,983 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-11-16 00:38:18,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:38:18,983 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2019-11-16 00:38:18,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-16 00:38:18,987 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:18,988 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:19,190 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:38:19,191 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:19,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:19,191 INFO L82 PathProgramCache]: Analyzing trace with hash -508830509, now seen corresponding path program 3 times [2019-11-16 00:38:19,191 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:19,191 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832286865] [2019-11-16 00:38:19,191 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:19,191 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:19,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:19,204 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:38:19,205 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1491265424] [2019-11-16 00:38:19,205 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a648aee0-dc33-496c-b354-4a4d268abfad/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:38:19,256 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-16 00:38:19,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:38:19,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:38:19,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:38:19,357 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:38:19,358 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832286865] [2019-11-16 00:38:19,358 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-16 00:38:19,358 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491265424] [2019-11-16 00:38:19,358 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:38:19,358 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-11-16 00:38:19,358 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118288523] [2019-11-16 00:38:19,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:38:19,359 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:19,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:38:19,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:38:19,359 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 7 states. [2019-11-16 00:38:19,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:19,467 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2019-11-16 00:38:19,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:38:19,468 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-11-16 00:38:19,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:19,469 INFO L225 Difference]: With dead ends: 54 [2019-11-16 00:38:19,469 INFO L226 Difference]: Without dead ends: 47 [2019-11-16 00:38:19,469 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:38:19,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-16 00:38:19,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 28. [2019-11-16 00:38:19,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-16 00:38:19,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-11-16 00:38:19,477 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 16 [2019-11-16 00:38:19,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:19,478 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-11-16 00:38:19,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:38:19,478 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-11-16 00:38:19,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-16 00:38:19,478 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:19,478 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:19,679 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:38:19,679 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:19,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:19,679 INFO L82 PathProgramCache]: Analyzing trace with hash 575675563, now seen corresponding path program 1 times [2019-11-16 00:38:19,679 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:19,680 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722349057] [2019-11-16 00:38:19,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:19,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:19,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:19,691 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:38:19,691 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [767205951] [2019-11-16 00:38:19,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a648aee0-dc33-496c-b354-4a4d268abfad/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:38:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:38:19,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-16 00:38:19,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:38:19,748 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-16 00:38:19,749 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:19,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:19,763 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-16 00:38:19,764 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:19,772 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:19,772 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:38:19,773 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:22 [2019-11-16 00:38:19,804 INFO L341 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2019-11-16 00:38:19,805 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 32 [2019-11-16 00:38:19,805 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:19,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:19,816 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:38:19,816 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:36 [2019-11-16 00:38:19,866 INFO L341 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2019-11-16 00:38:19,867 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 46 [2019-11-16 00:38:19,867 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:19,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:19,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:38:19,877 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:59, output treesize:55 [2019-11-16 00:38:20,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:20,082 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:38:20,082 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722349057] [2019-11-16 00:38:20,083 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-16 00:38:20,083 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767205951] [2019-11-16 00:38:20,083 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:38:20,083 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-11-16 00:38:20,083 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631025394] [2019-11-16 00:38:20,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:38:20,084 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:20,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:38:20,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:38:20,084 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 10 states. [2019-11-16 00:38:20,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:20,641 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-11-16 00:38:20,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:38:20,642 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-11-16 00:38:20,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:20,643 INFO L225 Difference]: With dead ends: 43 [2019-11-16 00:38:20,643 INFO L226 Difference]: Without dead ends: 41 [2019-11-16 00:38:20,643 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:38:20,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-16 00:38:20,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2019-11-16 00:38:20,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-16 00:38:20,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2019-11-16 00:38:20,650 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 18 [2019-11-16 00:38:20,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:20,650 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2019-11-16 00:38:20,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:38:20,651 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2019-11-16 00:38:20,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-16 00:38:20,651 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:20,652 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:20,855 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:38:20,855 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:20,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:20,856 INFO L82 PathProgramCache]: Analyzing trace with hash -2009431311, now seen corresponding path program 4 times [2019-11-16 00:38:20,856 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:20,856 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382154644] [2019-11-16 00:38:20,856 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:20,856 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:20,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:20,875 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:38:20,875 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1027261285] [2019-11-16 00:38:20,875 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a648aee0-dc33-496c-b354-4a4d268abfad/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:38:20,925 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-16 00:38:20,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:38:20,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-16 00:38:20,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:38:20,951 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:20,952 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-11-16 00:38:20,952 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:20,980 INFO L567 ElimStorePlain]: treesize reduction 12, result has 70.0 percent of original size [2019-11-16 00:38:20,980 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:38:20,981 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:28 [2019-11-16 00:38:20,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:21,010 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:21,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:21,030 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:21,031 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 87 [2019-11-16 00:38:21,032 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:21,044 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:21,089 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:21,089 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 50 treesize of output 153 [2019-11-16 00:38:21,090 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:21,179 INFO L567 ElimStorePlain]: treesize reduction 165, result has 38.9 percent of original size [2019-11-16 00:38:21,180 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-16 00:38:21,180 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:97, output treesize:105 [2019-11-16 00:38:21,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:21,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:21,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:21,464 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-11-16 00:38:21,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:38:21,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:21,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:21,509 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:21,559 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:21,559 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 81 treesize of output 240 [2019-11-16 00:38:21,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:21,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:21,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:21,563 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:21,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:21,601 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:21,634 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:21,813 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-11-16 00:38:21,814 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:21,814 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 77 treesize of output 358 [2019-11-16 00:38:21,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:21,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:21,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:21,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:21,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:21,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:21,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:21,824 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:21,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:21,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:21,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:21,957 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:21,957 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 73 treesize of output 259 [2019-11-16 00:38:21,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:21,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:21,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:21,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:21,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:21,964 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:21,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:21,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:22,067 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:22,068 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 61 treesize of output 214 [2019-11-16 00:38:22,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:22,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:22,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:22,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:22,076 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:22,854 WARN L191 SmtUtils]: Spent 777.00 ms on a formula simplification. DAG size of input: 313 DAG size of output: 85 [2019-11-16 00:38:22,854 INFO L567 ElimStorePlain]: treesize reduction 2196, result has 13.9 percent of original size [2019-11-16 00:38:22,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:22,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:22,856 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-11-16 00:38:22,856 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:293, output treesize:275 [2019-11-16 00:38:23,005 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-16 00:38:23,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:38:23,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:23,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:23,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:23,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:23,339 WARN L191 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 76 [2019-11-16 00:38:23,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-16 00:38:23,614 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 107 [2019-11-16 00:38:23,780 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-11-16 00:38:23,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-16 00:38:23,797 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:23,803 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:23,804 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:23,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:23,806 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:23,823 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:23,889 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:23,890 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 89 treesize of output 270 [2019-11-16 00:38:23,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:23,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:23,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:23,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:23,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:23,895 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:23,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:23,907 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:23,913 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:23,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:23,917 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:23,920 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:23,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:23,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:23,929 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:23,959 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:23,962 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:24,012 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:24,012 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 117 treesize of output 221 [2019-11-16 00:38:24,013 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:24,024 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:24,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:24,028 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:24,029 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:24,030 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:24,044 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:24,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:24,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:24,055 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:24,056 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:24,060 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:24,060 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 84 [2019-11-16 00:38:24,061 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:24,081 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:24,085 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:24,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:24,099 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:24,108 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:24,116 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:24,182 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:24,183 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 85 treesize of output 191 [2019-11-16 00:38:24,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:24,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:24,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:24,185 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:24,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:24,218 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:24,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:24,223 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:24,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:24,241 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:24,250 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:24,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:24,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:24,319 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:24,319 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 17 case distinctions, treesize of input 97 treesize of output 261 [2019-11-16 00:38:24,321 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:24,335 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:24,336 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:24,337 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:24,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:24,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:24,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:24,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:24,344 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 85 [2019-11-16 00:38:24,345 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:24,846 WARN L191 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 265 DAG size of output: 123 [2019-11-16 00:38:24,846 INFO L567 ElimStorePlain]: treesize reduction 1327, result has 29.3 percent of original size [2019-11-16 00:38:24,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:24,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:24,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:24,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:24,851 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2019-11-16 00:38:24,851 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:550, output treesize:548 [2019-11-16 00:38:24,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:24,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:24,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:25,042 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-11-16 00:38:25,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-11-16 00:38:25,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:25,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:25,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:25,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:25,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:25,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:25,502 WARN L191 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 113 [2019-11-16 00:38:25,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-16 00:38:25,536 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:25,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:25,542 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:25,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:25,546 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:25,547 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:25,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:25,562 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:25,562 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:25,566 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 54 [2019-11-16 00:38:25,566 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:25,572 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-16 00:38:25,572 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:25,577 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-16 00:38:25,578 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:25,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:25,587 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:25,588 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:25,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:25,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:25,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:25,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:25,598 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:25,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:25,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:25,605 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:25,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:25,634 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:25,690 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:25,691 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 82 treesize of output 201 [2019-11-16 00:38:25,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:25,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:25,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:25,694 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:25,700 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-16 00:38:25,700 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:25,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:25,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:25,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:25,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:25,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:25,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:25,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:25,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:25,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:25,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:25,739 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:25,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:25,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:25,744 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:25,820 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:25,820 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 95 treesize of output 298 [2019-11-16 00:38:25,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:25,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:25,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:25,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:25,826 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:25,843 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-16 00:38:25,843 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:26,144 WARN L191 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 73 [2019-11-16 00:38:26,144 INFO L567 ElimStorePlain]: treesize reduction 879, result has 20.7 percent of original size [2019-11-16 00:38:26,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:26,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:26,148 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2019-11-16 00:38:26,148 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:610, output treesize:229 [2019-11-16 00:38:26,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:26,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:26,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:26,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:38:26,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:26,616 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:38:26,616 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382154644] [2019-11-16 00:38:26,616 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-16 00:38:26,616 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027261285] [2019-11-16 00:38:26,617 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:38:26,617 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-11-16 00:38:26,617 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217982828] [2019-11-16 00:38:26,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-16 00:38:26,617 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:26,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-16 00:38:26,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:38:26,618 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 14 states. [2019-11-16 00:38:27,003 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 104 [2019-11-16 00:38:27,669 WARN L191 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 120 [2019-11-16 00:38:28,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:28,398 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2019-11-16 00:38:28,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-16 00:38:28,399 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2019-11-16 00:38:28,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:28,400 INFO L225 Difference]: With dead ends: 54 [2019-11-16 00:38:28,400 INFO L226 Difference]: Without dead ends: 52 [2019-11-16 00:38:28,400 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2019-11-16 00:38:28,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-16 00:38:28,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 41. [2019-11-16 00:38:28,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-16 00:38:28,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2019-11-16 00:38:28,408 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 18 [2019-11-16 00:38:28,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:28,409 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2019-11-16 00:38:28,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-16 00:38:28,409 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2019-11-16 00:38:28,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-16 00:38:28,410 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:28,410 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:28,613 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:38:28,613 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:28,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:28,618 INFO L82 PathProgramCache]: Analyzing trace with hash -977790577, now seen corresponding path program 5 times [2019-11-16 00:38:28,618 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:28,618 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789425431] [2019-11-16 00:38:28,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:28,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:28,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:28,631 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:38:28,631 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1811131443] [2019-11-16 00:38:28,632 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a648aee0-dc33-496c-b354-4a4d268abfad/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:38:28,687 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-11-16 00:38:28,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:38:28,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:38:28,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:38:28,746 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:38:28,747 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789425431] [2019-11-16 00:38:28,747 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-16 00:38:28,747 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811131443] [2019-11-16 00:38:28,747 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:38:28,747 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-11-16 00:38:28,747 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114126372] [2019-11-16 00:38:28,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:38:28,748 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:28,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:38:28,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:38:28,748 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 9 states. [2019-11-16 00:38:28,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:28,920 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2019-11-16 00:38:28,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:38:28,920 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-11-16 00:38:28,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:28,921 INFO L225 Difference]: With dead ends: 88 [2019-11-16 00:38:28,921 INFO L226 Difference]: Without dead ends: 79 [2019-11-16 00:38:28,922 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:38:28,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-16 00:38:28,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 41. [2019-11-16 00:38:28,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-16 00:38:28,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-11-16 00:38:28,942 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 20 [2019-11-16 00:38:28,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:28,942 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-11-16 00:38:28,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:38:28,943 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-11-16 00:38:28,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-16 00:38:28,943 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:28,944 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:29,148 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:38:29,148 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:29,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:29,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1429341745, now seen corresponding path program 6 times [2019-11-16 00:38:29,149 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:29,149 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960408647] [2019-11-16 00:38:29,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:29,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:29,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:29,163 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:38:29,163 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [733391135] [2019-11-16 00:38:29,163 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a648aee0-dc33-496c-b354-4a4d268abfad/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:38:29,211 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-11-16 00:38:29,211 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:38:29,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-16 00:38:29,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:38:29,255 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:38:29,256 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960408647] [2019-11-16 00:38:29,256 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-16 00:38:29,256 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733391135] [2019-11-16 00:38:29,256 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:38:29,256 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-11-16 00:38:29,256 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795360315] [2019-11-16 00:38:29,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:38:29,257 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:29,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:38:29,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:38:29,257 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 9 states. [2019-11-16 00:38:29,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:29,403 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2019-11-16 00:38:29,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:38:29,403 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-11-16 00:38:29,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:29,404 INFO L225 Difference]: With dead ends: 75 [2019-11-16 00:38:29,404 INFO L226 Difference]: Without dead ends: 68 [2019-11-16 00:38:29,404 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:38:29,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-16 00:38:29,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 43. [2019-11-16 00:38:29,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-16 00:38:29,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-11-16 00:38:29,412 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 20 [2019-11-16 00:38:29,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:29,413 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-11-16 00:38:29,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:38:29,413 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-11-16 00:38:29,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-16 00:38:29,414 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:29,414 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:29,617 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:38:29,617 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:29,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:29,617 INFO L82 PathProgramCache]: Analyzing trace with hash 389293921, now seen corresponding path program 2 times [2019-11-16 00:38:29,617 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:29,618 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004312162] [2019-11-16 00:38:29,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:29,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:29,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:29,625 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:38:29,625 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1261569292] [2019-11-16 00:38:29,626 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a648aee0-dc33-496c-b354-4a4d268abfad/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:38:29,665 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:38:29,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:38:29,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-16 00:38:29,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:38:29,697 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:38:29,698 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004312162] [2019-11-16 00:38:29,698 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-16 00:38:29,698 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261569292] [2019-11-16 00:38:29,698 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:38:29,698 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-11-16 00:38:29,698 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204729678] [2019-11-16 00:38:29,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:38:29,698 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:29,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:38:29,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:38:29,699 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 8 states. [2019-11-16 00:38:29,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:29,797 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2019-11-16 00:38:29,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:38:29,797 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-11-16 00:38:29,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:29,798 INFO L225 Difference]: With dead ends: 66 [2019-11-16 00:38:29,798 INFO L226 Difference]: Without dead ends: 46 [2019-11-16 00:38:29,798 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:38:29,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-16 00:38:29,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2019-11-16 00:38:29,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-16 00:38:29,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2019-11-16 00:38:29,803 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 22 [2019-11-16 00:38:29,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:29,803 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2019-11-16 00:38:29,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:38:29,803 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2019-11-16 00:38:29,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-16 00:38:29,804 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:29,804 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:30,012 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:38:30,013 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:30,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:30,013 INFO L82 PathProgramCache]: Analyzing trace with hash 425065127, now seen corresponding path program 3 times [2019-11-16 00:38:30,013 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:30,013 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895267665] [2019-11-16 00:38:30,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:30,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:30,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:30,023 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:38:30,023 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [826018407] [2019-11-16 00:38:30,023 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a648aee0-dc33-496c-b354-4a4d268abfad/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:38:30,086 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-16 00:38:30,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:38:30,088 WARN L254 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 47 conjunts are in the unsatisfiable core [2019-11-16 00:38:30,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:38:30,101 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-16 00:38:30,101 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:30,115 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:30,119 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-16 00:38:30,119 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:30,140 INFO L567 ElimStorePlain]: treesize reduction 4, result has 87.1 percent of original size [2019-11-16 00:38:30,140 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:38:30,141 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:27 [2019-11-16 00:38:30,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:30,157 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:30,158 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:30,169 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-11-16 00:38:30,170 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 57 [2019-11-16 00:38:30,170 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:30,193 INFO L567 ElimStorePlain]: treesize reduction 16, result has 70.4 percent of original size [2019-11-16 00:38:30,193 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:38:30,193 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:38 [2019-11-16 00:38:30,226 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:30,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:30,230 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:30,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:30,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:30,240 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:30,240 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 81 [2019-11-16 00:38:30,241 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:30,274 INFO L567 ElimStorePlain]: treesize reduction 41, result has 59.8 percent of original size [2019-11-16 00:38:30,274 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:38:30,274 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:61 [2019-11-16 00:38:30,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:30,336 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:30,337 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:30,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:30,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:30,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:30,381 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:30,382 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 69 treesize of output 160 [2019-11-16 00:38:30,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:30,435 INFO L567 ElimStorePlain]: treesize reduction 110, result has 40.9 percent of original size [2019-11-16 00:38:30,435 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:38:30,435 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:84, output treesize:76 [2019-11-16 00:38:30,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:30,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:30,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:30,494 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:30,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:31,014 WARN L191 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 125 [2019-11-16 00:38:31,014 INFO L341 Elim1Store]: treesize reduction 164, result has 74.0 percent of original size [2019-11-16 00:38:31,014 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 5 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 90 treesize of output 498 [2019-11-16 00:38:31,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:31,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:31,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:31,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:31,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:31,021 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:31,155 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 50 [2019-11-16 00:38:31,155 INFO L567 ElimStorePlain]: treesize reduction 969, result has 9.4 percent of original size [2019-11-16 00:38:31,156 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:38:31,156 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:102, output treesize:101 [2019-11-16 00:38:31,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:31,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:31,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:31,574 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:38:31,574 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895267665] [2019-11-16 00:38:31,575 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-16 00:38:31,575 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826018407] [2019-11-16 00:38:31,575 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:38:31,575 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-11-16 00:38:31,575 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476483375] [2019-11-16 00:38:31,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-16 00:38:31,576 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:38:31,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-16 00:38:31,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:38:31,576 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 15 states. [2019-11-16 00:38:32,128 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 91 [2019-11-16 00:38:32,307 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 74 [2019-11-16 00:38:32,850 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 93 [2019-11-16 00:38:32,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:38:32,987 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2019-11-16 00:38:32,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-16 00:38:32,987 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-11-16 00:38:32,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:38:32,988 INFO L225 Difference]: With dead ends: 50 [2019-11-16 00:38:32,988 INFO L226 Difference]: Without dead ends: 48 [2019-11-16 00:38:32,988 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2019-11-16 00:38:32,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-16 00:38:32,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2019-11-16 00:38:32,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-16 00:38:32,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2019-11-16 00:38:32,995 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 22 [2019-11-16 00:38:32,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:38:32,995 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2019-11-16 00:38:32,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-16 00:38:32,996 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2019-11-16 00:38:32,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-16 00:38:32,997 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:38:32,997 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:38:33,206 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:38:33,206 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:38:33,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:38:33,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1004709725, now seen corresponding path program 4 times [2019-11-16 00:38:33,207 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:38:33,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842750050] [2019-11-16 00:38:33,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:33,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:38:33,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:38:33,223 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-16 00:38:33,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [940181428] [2019-11-16 00:38:33,232 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a648aee0-dc33-496c-b354-4a4d268abfad/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:38:33,282 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-16 00:38:33,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:38:33,283 WARN L254 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-16 00:38:33,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:38:33,298 INFO L341 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2019-11-16 00:38:33,298 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2019-11-16 00:38:33,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:33,300 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:33,300 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:38:33,301 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-16 00:38:33,326 INFO L341 Elim1Store]: treesize reduction 100, result has 20.0 percent of original size [2019-11-16 00:38:33,326 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 43 [2019-11-16 00:38:33,327 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:33,333 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:33,333 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:38:33,333 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:49 [2019-11-16 00:38:33,620 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 75 [2019-11-16 00:38:33,620 INFO L341 Elim1Store]: treesize reduction 180, result has 63.0 percent of original size [2019-11-16 00:38:33,620 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 81 treesize of output 329 [2019-11-16 00:38:33,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:33,627 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:34,034 WARN L191 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 88 [2019-11-16 00:38:34,035 INFO L567 ElimStorePlain]: treesize reduction 519, result has 50.0 percent of original size [2019-11-16 00:38:34,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:34,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:34,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:34,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:34,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:34,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:34,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:34,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:34,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:34,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:34,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:34,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:34,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:34,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:34,048 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:38:34,048 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:92, output treesize:517 [2019-11-16 00:38:34,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:34,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:34,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:34,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:34,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:34,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:34,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:34,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:34,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:34,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:34,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:34,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:34,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:34,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:34,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:34,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:34,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:34,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:34,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:34,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:34,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:34,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:34,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:34,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:34,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:34,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:34,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:34,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:36,365 WARN L191 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 212 DAG size of output: 139 [2019-11-16 00:38:36,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 11 terms [2019-11-16 00:38:36,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:36,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:36,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:36,458 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:36,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:36,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:36,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:36,499 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:36,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:36,513 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:36,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:36,530 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:36,672 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:36,765 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:36,777 INFO L235 Elim1Store]: Index analysis took 351 ms [2019-11-16 00:38:36,779 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 66 [2019-11-16 00:38:36,779 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:36,796 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-16 00:38:36,796 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:36,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:36,885 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:36,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:36,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:36,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:36,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:36,944 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:36,950 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:36,955 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:36,955 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:36,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:36,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:37,312 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:37,414 INFO L235 Elim1Store]: Index analysis took 599 ms [2019-11-16 00:38:37,837 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2019-11-16 00:38:37,837 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:37,838 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 10 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 23 case distinctions, treesize of input 150 treesize of output 594 [2019-11-16 00:38:37,841 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:37,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:37,881 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:37,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:37,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:37,917 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:37,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:37,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:37,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:37,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:38,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:38,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:38,024 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:38,025 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:38,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:38,813 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:38,850 INFO L235 Elim1Store]: Index analysis took 980 ms [2019-11-16 00:38:39,344 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-11-16 00:38:39,344 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:39,344 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 12 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 131 treesize of output 562 [2019-11-16 00:38:39,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:39,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:39,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:39,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:39,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:39,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:39,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:39,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:39,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:39,358 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:39,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:39,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:39,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:39,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:39,631 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:39,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:39,651 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:39,664 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:39,671 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:39,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:39,706 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:39,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:39,715 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:39,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:40,819 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:40,862 INFO L235 Elim1Store]: Index analysis took 1417 ms [2019-11-16 00:38:41,401 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-11-16 00:38:41,401 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:41,402 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 12 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 155 treesize of output 564 [2019-11-16 00:38:41,405 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:41,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:41,511 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:41,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:41,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:41,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:41,578 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:41,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:41,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:41,605 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:41,632 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:41,644 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:41,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:41,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:41,680 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:41,693 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:41,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:41,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:41,745 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:42,019 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:42,072 INFO L235 Elim1Store]: Index analysis took 593 ms [2019-11-16 00:38:42,100 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:42,101 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 137 treesize of output 205 [2019-11-16 00:38:42,102 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:42,129 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-16 00:38:42,130 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:42,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:42,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:42,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:42,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:42,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:42,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:42,285 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:42,293 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:42,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:42,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:42,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:42,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:42,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:42,367 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:42,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:42,403 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:42,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:42,434 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:42,869 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:42,878 INFO L235 Elim1Store]: Index analysis took 692 ms [2019-11-16 00:38:42,905 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:42,906 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 136 treesize of output 172 [2019-11-16 00:38:42,907 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:42,966 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:43,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:43,013 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:43,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:43,026 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:43,034 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:43,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:43,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:43,056 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:43,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:43,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:43,067 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:43,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:43,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:43,413 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:43,484 INFO L235 Elim1Store]: Index analysis took 530 ms [2019-11-16 00:38:43,845 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-11-16 00:38:43,846 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:43,846 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 12 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 148 treesize of output 561 [2019-11-16 00:38:43,849 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:43,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:43,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:43,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:43,906 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:43,913 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:43,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:43,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:43,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:43,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:44,055 INFO L235 Elim1Store]: Index analysis took 173 ms [2019-11-16 00:38:44,071 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:44,071 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 112 treesize of output 161 [2019-11-16 00:38:44,072 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:44,112 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:44,122 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:44,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:44,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:44,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:44,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:44,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:44,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:44,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:44,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:44,175 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:44,189 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:44,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:38:44,199 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:44,214 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:38:44,214 INFO L235 Elim1Store]: Index analysis took 104 ms [2019-11-16 00:38:44,250 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:38:44,250 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 7 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 136 treesize of output 187 [2019-11-16 00:38:44,251 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-16 00:38:48,383 WARN L191 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 624 DAG size of output: 258 [2019-11-16 00:38:48,384 INFO L567 ElimStorePlain]: treesize reduction 4565, result has 27.5 percent of original size [2019-11-16 00:38:48,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,452 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 16 dim-0 vars, and 9 xjuncts. [2019-11-16 00:38:48,453 INFO L221 ElimStorePlain]: Needed 12 recursive calls to eliminate 8 variables, input treesize:1364, output treesize:1727 [2019-11-16 00:38:48,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:38:48,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,243 WARN L191 SmtUtils]: Spent 49.57 s on a formula simplification. DAG size of input: 356 DAG size of output: 258 [2019-11-16 00:39:38,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-11-16 00:39:38,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:38,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:39:58,373 WARN L191 SmtUtils]: Spent 17.64 s on a formula simplification. DAG size of input: 370 DAG size of output: 264 [2019-11-16 00:39:58,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 13 terms [2019-11-16 00:39:59,181 WARN L191 SmtUtils]: Spent 525.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 116 [2019-11-16 00:39:59,823 WARN L191 SmtUtils]: Spent 553.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2019-11-16 00:40:05,153 WARN L191 SmtUtils]: Spent 5.23 s on a formula simplification that was a NOOP. DAG size: 140 [2019-11-16 00:40:05,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 10 terms [2019-11-16 00:40:07,829 WARN L191 SmtUtils]: Spent 2.56 s on a formula simplification that was a NOOP. DAG size: 131 [2019-11-16 00:40:09,640 WARN L191 SmtUtils]: Spent 1.66 s on a formula simplification that was a NOOP. DAG size: 137 [2019-11-16 00:40:19,597 WARN L191 SmtUtils]: Spent 8.45 s on a formula simplification. DAG size of input: 151 DAG size of output: 149 [2019-11-16 00:40:19,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 8 terms [2019-11-16 00:40:20,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:40:20,111 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:40:20,111 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842750050] [2019-11-16 00:40:20,112 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-16 00:40:20,112 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940181428] [2019-11-16 00:40:20,112 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:40:20,112 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-11-16 00:40:20,112 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529920588] [2019-11-16 00:40:20,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-16 00:40:20,113 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:40:20,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-16 00:40:20,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=365, Unknown=1, NotChecked=0, Total=420 [2019-11-16 00:40:20,113 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 21 states. [2019-11-16 00:40:40,841 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-11-16 00:40:41,042 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:40:41,042 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) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:100) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.pop(ManagedScript.java:130) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:660) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:264) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:279) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.ProtectiveHoareTripleChecker.releaseLock(ProtectiveHoareTripleChecker.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.releaseLock(EfficientHoareTripleChecker.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:684) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:597) 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.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.io.IOException: Broken pipe at java.io.FileOutputStream.writeBytes(Native Method) at java.io.FileOutputStream.write(FileOutputStream.java:326) at java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:82) at java.io.BufferedOutputStream.flush(BufferedOutputStream.java:140) at sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:297) at sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:141) at java.io.OutputStreamWriter.flush(OutputStreamWriter.java:229) at java.io.BufferedWriter.flush(BufferedWriter.java:254) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:120) ... 30 more [2019-11-16 00:40:41,046 INFO L168 Benchmark]: Toolchain (without parser) took 147251.92 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 233.8 MB). Free memory was 950.1 MB in the beginning and 1.0 GB in the end (delta: -84.3 MB). Peak memory consumption was 149.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:40:41,046 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:40:41,046 INFO L168 Benchmark]: CACSL2BoogieTranslator took 290.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -197.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:40:41,046 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.76 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:40:41,047 INFO L168 Benchmark]: Boogie Preprocessor took 33.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:40:41,047 INFO L168 Benchmark]: RCFGBuilder took 373.03 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.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:40:41,047 INFO L168 Benchmark]: TraceAbstraction took 146507.34 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 80.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 89.9 MB). Peak memory consumption was 170.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:40:41,049 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 290.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -197.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.76 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 373.03 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.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 146507.34 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 80.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 89.9 MB). Peak memory consumption was 170.6 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) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-16 00:40:43,045 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:40:43,047 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:40:43,068 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:40:43,069 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:40:43,070 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:40:43,073 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:40:43,085 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:40:43,088 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:40:43,091 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:40:43,093 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:40:43,095 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:40:43,096 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:40:43,099 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:40:43,100 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:40:43,102 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:40:43,104 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:40:43,108 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:40:43,111 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:40:43,114 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:40:43,118 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:40:43,120 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:40:43,122 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:40:43,125 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:40:43,127 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:40:43,129 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:40:43,130 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:40:43,131 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:40:43,132 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:40:43,133 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:40:43,133 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:40:43,136 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:40:43,137 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:40:43,138 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:40:43,139 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:40:43,140 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:40:43,141 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:40:43,141 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:40:43,141 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:40:43,142 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:40:43,143 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:40:43,144 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a648aee0-dc33-496c-b354-4a4d268abfad/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-16 00:40:43,175 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:40:43,185 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:40:43,186 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:40:43,186 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:40:43,186 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:40:43,187 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:40:43,187 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:40:43,187 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:40:43,187 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:40:43,188 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:40:43,188 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:40:43,188 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:40:43,188 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-16 00:40:43,189 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-16 00:40:43,189 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:40:43,189 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:40:43,189 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:40:43,190 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:40:43,190 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:40:43,190 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:40:43,191 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:40:43,191 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:40:43,191 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:40:43,191 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:40:43,192 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:40:43,192 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:40:43,192 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-16 00:40:43,192 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-16 00:40:43,193 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:40:43,193 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-16 00:40:43,194 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_a648aee0-dc33-496c-b354-4a4d268abfad/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 -> 8f1919726cc43e8993ebe9d65d5d8d40e06595e6 [2019-11-16 00:40:43,228 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:40:43,237 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:40:43,240 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:40:43,242 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:40:43,242 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:40:43,243 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a648aee0-dc33-496c-b354-4a4d268abfad/bin/uautomizer/../../sv-benchmarks/c/array-fpi/eqn5.c [2019-11-16 00:40:43,299 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a648aee0-dc33-496c-b354-4a4d268abfad/bin/uautomizer/data/cde4d5463/1a9dc83479c74335bffc7d0afa117c0f/FLAG1d81b19f1 [2019-11-16 00:40:43,645 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:40:43,646 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a648aee0-dc33-496c-b354-4a4d268abfad/sv-benchmarks/c/array-fpi/eqn5.c [2019-11-16 00:40:43,654 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a648aee0-dc33-496c-b354-4a4d268abfad/bin/uautomizer/data/cde4d5463/1a9dc83479c74335bffc7d0afa117c0f/FLAG1d81b19f1 [2019-11-16 00:40:44,055 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a648aee0-dc33-496c-b354-4a4d268abfad/bin/uautomizer/data/cde4d5463/1a9dc83479c74335bffc7d0afa117c0f [2019-11-16 00:40:44,057 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:40:44,059 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:40:44,074 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:40:44,074 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:40:44,078 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:40:44,079 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:40:44" (1/1) ... [2019-11-16 00:40:44,082 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@247ce604 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:44, skipping insertion in model container [2019-11-16 00:40:44,082 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:40:44" (1/1) ... [2019-11-16 00:40:44,091 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:40:44,116 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:40:44,348 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:40:44,367 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:40:44,405 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:40:44,488 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:40:44,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:44 WrapperNode [2019-11-16 00:40:44,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:40:44,490 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:40:44,490 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:40:44,490 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:40:44,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:44" (1/1) ... [2019-11-16 00:40:44,509 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:44" (1/1) ... [2019-11-16 00:40:44,529 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:40:44,530 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:40:44,530 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:40:44,530 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:40:44,539 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:44" (1/1) ... [2019-11-16 00:40:44,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:44" (1/1) ... [2019-11-16 00:40:44,543 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:44" (1/1) ... [2019-11-16 00:40:44,544 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:44" (1/1) ... [2019-11-16 00:40:44,551 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:44" (1/1) ... [2019-11-16 00:40:44,555 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:44" (1/1) ... [2019-11-16 00:40:44,556 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:44" (1/1) ... [2019-11-16 00:40:44,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:40:44,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:40:44,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:40:44,560 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:40:44,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a648aee0-dc33-496c-b354-4a4d268abfad/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:40:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2019-11-16 00:40:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:40:44,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:40:44,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:40:44,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2019-11-16 00:40:44,947 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:40:44,948 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-16 00:40:44,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:40:44 BoogieIcfgContainer [2019-11-16 00:40:44,949 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:40:44,950 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:40:44,951 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:40:44,953 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:40:44,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:40:44" (1/3) ... [2019-11-16 00:40:44,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e0c96dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:40:44, skipping insertion in model container [2019-11-16 00:40:44,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:40:44" (2/3) ... [2019-11-16 00:40:44,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e0c96dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:40:44, skipping insertion in model container [2019-11-16 00:40:44,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:40:44" (3/3) ... [2019-11-16 00:40:44,957 INFO L109 eAbstractionObserver]: Analyzing ICFG eqn5.c [2019-11-16 00:40:44,964 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:40:44,971 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:40:44,983 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:40:45,005 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:40:45,005 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:40:45,005 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:40:45,005 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:40:45,006 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:40:45,006 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:40:45,006 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:40:45,006 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:40:45,019 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-11-16 00:40:45,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-16 00:40:45,024 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:45,025 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:45,026 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:45,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:45,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1486647931, now seen corresponding path program 1 times [2019-11-16 00:40:45,039 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:40:45,040 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [581821227] [2019-11-16 00:40:45,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a648aee0-dc33-496c-b354-4a4d268abfad/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:45,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-16 00:40:45,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:45,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:40:45,148 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:40:45,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:40:45,153 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [581821227] [2019-11-16 00:40:45,154 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:45,155 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-16 00:40:45,155 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062827242] [2019-11-16 00:40:45,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-16 00:40:45,160 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:40:45,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-16 00:40:45,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-16 00:40:45,175 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-11-16 00:40:45,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:45,189 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2019-11-16 00:40:45,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-16 00:40:45,191 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-16 00:40:45,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:45,200 INFO L225 Difference]: With dead ends: 33 [2019-11-16 00:40:45,200 INFO L226 Difference]: Without dead ends: 15 [2019-11-16 00:40:45,204 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-16 00:40:45,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-11-16 00:40:45,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-11-16 00:40:45,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-16 00:40:45,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-11-16 00:40:45,238 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 10 [2019-11-16 00:40:45,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:45,238 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-11-16 00:40:45,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-16 00:40:45,239 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-11-16 00:40:45,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-16 00:40:45,240 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:45,240 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:45,442 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:45,442 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:45,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:45,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1772723449, now seen corresponding path program 1 times [2019-11-16 00:40:45,443 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:40:45,443 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1993267449] [2019-11-16 00:40:45,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a648aee0-dc33-496c-b354-4a4d268abfad/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:45,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-16 00:40:45,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:45,661 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:45,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:45,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:45,783 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 22 [2019-11-16 00:40:45,784 INFO L341 Elim1Store]: treesize reduction 45, result has 40.0 percent of original size [2019-11-16 00:40:45,784 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 50 [2019-11-16 00:40:45,786 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:45,834 INFO L567 ElimStorePlain]: treesize reduction 20, result has 62.3 percent of original size [2019-11-16 00:40:45,835 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:40:45,836 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:33 [2019-11-16 00:40:45,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:40:45,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:40:45,970 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:40:46,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:40:46,204 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1993267449] [2019-11-16 00:40:46,204 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:40:46,204 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-16 00:40:46,204 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787791829] [2019-11-16 00:40:46,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:40:46,206 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:40:46,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:40:46,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:40:46,212 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 8 states. [2019-11-16 00:40:46,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:46,871 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-11-16 00:40:46,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:40:46,874 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-11-16 00:40:46,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:46,875 INFO L225 Difference]: With dead ends: 22 [2019-11-16 00:40:46,875 INFO L226 Difference]: Without dead ends: 20 [2019-11-16 00:40:46,876 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:40:46,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-16 00:40:46,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-11-16 00:40:46,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-16 00:40:46,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-11-16 00:40:46,882 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 10 [2019-11-16 00:40:46,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:46,883 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-16 00:40:46,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:40:46,883 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-11-16 00:40:46,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-16 00:40:46,884 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:46,884 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:47,085 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:47,085 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:47,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:47,085 INFO L82 PathProgramCache]: Analyzing trace with hash 437833903, now seen corresponding path program 1 times [2019-11-16 00:40:47,086 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:40:47,086 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1500647844] [2019-11-16 00:40:47,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a648aee0-dc33-496c-b354-4a4d268abfad/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:47,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:47,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:40:47,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:47,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:40:47,316 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:40:47,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:40:47,405 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1500647844] [2019-11-16 00:40:47,405 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:40:47,406 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-16 00:40:47,406 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942117991] [2019-11-16 00:40:47,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:40:47,406 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:40:47,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:40:47,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:40:47,407 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 10 states. [2019-11-16 00:40:47,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:40:47,775 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2019-11-16 00:40:47,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:40:47,780 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2019-11-16 00:40:47,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:40:47,781 INFO L225 Difference]: With dead ends: 45 [2019-11-16 00:40:47,781 INFO L226 Difference]: Without dead ends: 20 [2019-11-16 00:40:47,782 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:40:47,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-16 00:40:47,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-11-16 00:40:47,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-16 00:40:47,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2019-11-16 00:40:47,800 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 14 [2019-11-16 00:40:47,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:40:47,800 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2019-11-16 00:40:47,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:40:47,801 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2019-11-16 00:40:47,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-16 00:40:47,802 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:40:47,803 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:40:48,014 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:48,014 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:40:48,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:40:48,015 INFO L82 PathProgramCache]: Analyzing trace with hash 575675563, now seen corresponding path program 1 times [2019-11-16 00:40:48,015 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:40:48,016 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1734122729] [2019-11-16 00:40:48,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a648aee0-dc33-496c-b354-4a4d268abfad/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:40:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:40:48,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-16 00:40:48,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:40:48,313 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:48,325 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-16 00:40:48,326 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:48,412 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:48,423 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:48,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:48,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:48,426 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:40:48,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:48,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:48,447 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:48,448 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 80 [2019-11-16 00:40:48,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:48,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:48,472 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 11 [2019-11-16 00:40:48,472 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:48,522 INFO L567 ElimStorePlain]: treesize reduction 23, result has 59.6 percent of original size [2019-11-16 00:40:48,522 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:40:48,556 INFO L567 ElimStorePlain]: treesize reduction 4, result has 90.7 percent of original size [2019-11-16 00:40:48,557 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:40:48,557 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:111, output treesize:39 [2019-11-16 00:40:48,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:48,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:48,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:48,620 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:48,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:48,622 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:40:48,645 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:48,646 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 79 [2019-11-16 00:40:48,647 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:48,701 INFO L567 ElimStorePlain]: treesize reduction 30, result has 66.3 percent of original size [2019-11-16 00:40:48,701 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:40:48,701 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:65, output treesize:59 [2019-11-16 00:40:48,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:48,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:48,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:48,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:48,797 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:48,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:48,799 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:40:48,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:40:48,806 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:40:48,860 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:40:48,861 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 125 treesize of output 142 [2019-11-16 00:40:48,865 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:40:48,925 INFO L567 ElimStorePlain]: treesize reduction 55, result has 65.4 percent of original size [2019-11-16 00:40:48,926 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:40:48,927 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:128, output treesize:104 [2019-11-16 00:40:49,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:40:49,127 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:40:49,128 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:40:52,154 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-16 00:40:53,523 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-16 00:40:53,542 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:40:53,543 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1734122729] [2019-11-16 00:40:53,543 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:40:53,543 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2019-11-16 00:40:53,543 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396293999] [2019-11-16 00:40:53,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-16 00:40:53,544 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:40:53,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-16 00:40:53,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=204, Unknown=1, NotChecked=0, Total=240 [2019-11-16 00:40:53,545 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 16 states. [2019-11-16 00:41:14,587 WARN L191 SmtUtils]: Spent 19.59 s on a formula simplification that was a NOOP. DAG size: 105 [2019-11-16 00:41:24,977 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-16 00:41:34,510 WARN L191 SmtUtils]: Spent 591.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-16 00:41:51,291 WARN L191 SmtUtils]: Spent 6.46 s on a formula simplification. DAG size of input: 86 DAG size of output: 57 [2019-11-16 00:42:05,979 WARN L191 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 115 DAG size of output: 60 [2019-11-16 00:42:08,322 WARN L191 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 130 DAG size of output: 62 [2019-11-16 00:42:10,946 WARN L191 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 137 DAG size of output: 77 [2019-11-16 00:42:13,008 WARN L191 SmtUtils]: Spent 981.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 74 [2019-11-16 00:42:15,633 WARN L191 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 122 DAG size of output: 64 [2019-11-16 00:42:18,668 WARN L191 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 121 DAG size of output: 66 [2019-11-16 00:42:19,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:42:19,302 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2019-11-16 00:42:19,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-16 00:42:19,302 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2019-11-16 00:42:19,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:42:19,303 INFO L225 Difference]: With dead ends: 63 [2019-11-16 00:42:19,303 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:42:19,304 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 65.2s TimeCoverageRelationStatistics Valid=276, Invalid=1047, Unknown=9, NotChecked=0, Total=1332 [2019-11-16 00:42:19,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:42:19,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:42:19,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:42:19,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:42:19,305 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2019-11-16 00:42:19,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:42:19,305 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:42:19,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-16 00:42:19,306 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:42:19,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:42:19,506 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:42:19,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:42:19,998 WARN L191 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-11-16 00:42:20,048 INFO L443 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2019-11-16 00:42:20,048 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-16 00:42:20,048 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:42:20,048 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:42:20,048 INFO L443 ceAbstractionStarter]: For program point L28-2(lines 28 31) no Hoare annotation was computed. [2019-11-16 00:42:20,049 INFO L439 ceAbstractionStarter]: At program point L28-3(lines 28 31) the Hoare annotation is: (let ((.cse0 ((_ sign_extend 32) (_ bv1 32))) (.cse1 (select |#memory_int| ULTIMATE.start_main_~b~0.base))) (and (= ((_ extract 31 0) .cse0) (select .cse1 ULTIMATE.start_main_~b~0.offset)) (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (exists ((ULTIMATE.start_main_~a~0.base (_ BitVec 32)) (ULTIMATE.start_main_~a~0.offset (_ BitVec 32))) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv10 32))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset))) (= ((_ extract 63 32) .cse0) (select .cse1 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv4 32)))))) [2019-11-16 00:42:20,049 INFO L443 ceAbstractionStarter]: For program point L28-4(lines 28 31) no Hoare annotation was computed. [2019-11-16 00:42:20,049 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2019-11-16 00:42:20,049 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:42:20,049 INFO L443 ceAbstractionStarter]: For program point L33-2(lines 33 36) no Hoare annotation was computed. [2019-11-16 00:42:20,049 INFO L439 ceAbstractionStarter]: At program point L33-3(lines 33 36) the Hoare annotation is: (let ((.cse0 ((_ sign_extend 32) (_ bv1 32))) (.cse1 (select |#memory_int| ULTIMATE.start_main_~b~0.base))) (and (= ((_ extract 31 0) .cse0) (select .cse1 ULTIMATE.start_main_~b~0.offset)) (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset) (exists ((ULTIMATE.start_main_~a~0.base (_ BitVec 32)) (ULTIMATE.start_main_~a~0.offset (_ BitVec 32))) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv10 32))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset))) (= ((_ extract 63 32) .cse0) (select .cse1 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv4 32)))))) [2019-11-16 00:42:20,050 INFO L443 ceAbstractionStarter]: For program point L33-4(lines 33 36) no Hoare annotation was computed. [2019-11-16 00:42:20,050 INFO L446 ceAbstractionStarter]: At program point L42(lines 16 43) the Hoare annotation is: true [2019-11-16 00:42:20,050 INFO L443 ceAbstractionStarter]: For program point L38-2(lines 38 41) no Hoare annotation was computed. [2019-11-16 00:42:20,050 INFO L439 ceAbstractionStarter]: At program point L38-3(lines 38 41) the Hoare annotation is: (let ((.cse5 ((_ sign_extend 32) (_ bv1 32))) (.cse6 (select |#memory_int| ULTIMATE.start_main_~b~0.base))) (let ((.cse0 (= ((_ extract 31 0) .cse5) (select .cse6 ULTIMATE.start_main_~b~0.offset))) (.cse1 (= (_ bv0 32) ULTIMATE.start_main_~b~0.offset)) (.cse2 (exists ((ULTIMATE.start_main_~a~0.base (_ BitVec 32)) (ULTIMATE.start_main_~a~0.offset (_ BitVec 32))) (= ((_ extract 31 0) ((_ sign_extend 32) (_ bv10 32))) (select (select |#memory_int| ULTIMATE.start_main_~a~0.base) ULTIMATE.start_main_~a~0.offset)))) (.cse3 (= ((_ extract 63 32) .cse5) (select .cse6 (bvadd ULTIMATE.start_main_~b~0.offset (_ bv4 32)))))) (let ((.cse4 (and .cse0 .cse1 .cse2 (not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32))) .cse3))) (or (and .cse0 .cse1 (= (_ bv0 32) ULTIMATE.start_main_~i~0) .cse2 .cse3) (and (not (bvslt (_ bv1 32) ~N~0)) (not (bvslt ULTIMATE.start_main_~i~0 ~N~0)) .cse4) (and (= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) .cse4))))) [2019-11-16 00:42:20,050 INFO L443 ceAbstractionStarter]: For program point L38-4(lines 38 41) no Hoare annotation was computed. [2019-11-16 00:42:20,050 INFO L443 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2019-11-16 00:42:20,051 INFO L443 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. [2019-11-16 00:42:20,051 INFO L443 ceAbstractionStarter]: For program point L10-3(line 10) no Hoare annotation was computed. [2019-11-16 00:42:20,067 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.base,QUANTIFIED] [2019-11-16 00:42:20,068 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.offset,QUANTIFIED] [2019-11-16 00:42:20,069 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.base,QUANTIFIED] [2019-11-16 00:42:20,069 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.offset,QUANTIFIED] [2019-11-16 00:42:20,069 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.base,QUANTIFIED] [2019-11-16 00:42:20,070 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.offset,QUANTIFIED] [2019-11-16 00:42:20,073 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,073 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,073 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,074 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,074 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,074 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,075 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,075 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,075 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,083 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.base,QUANTIFIED] [2019-11-16 00:42:20,083 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.offset,QUANTIFIED] [2019-11-16 00:42:20,085 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.base,QUANTIFIED] [2019-11-16 00:42:20,085 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.offset,QUANTIFIED] [2019-11-16 00:42:20,089 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.base,QUANTIFIED] [2019-11-16 00:42:20,089 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.offset,QUANTIFIED] [2019-11-16 00:42:20,096 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,096 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,096 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,097 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,097 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,097 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,098 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,099 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,100 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,111 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.base,QUANTIFIED] [2019-11-16 00:42:20,111 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.offset,QUANTIFIED] [2019-11-16 00:42:20,111 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,112 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,112 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,113 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.base,QUANTIFIED] [2019-11-16 00:42:20,114 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.offset,QUANTIFIED] [2019-11-16 00:42:20,114 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,115 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,115 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,115 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.base,QUANTIFIED] [2019-11-16 00:42:20,116 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.offset,QUANTIFIED] [2019-11-16 00:42:20,116 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,117 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,117 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,118 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.base,QUANTIFIED] [2019-11-16 00:42:20,118 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.offset,QUANTIFIED] [2019-11-16 00:42:20,118 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,119 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,120 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:42:20 BoogieIcfgContainer [2019-11-16 00:42:20,122 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:42:20,123 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:42:20,123 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:42:20,123 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:42:20,124 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:40:44" (3/4) ... [2019-11-16 00:42:20,127 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:42:20,142 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-16 00:42:20,142 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-16 00:42:20,166 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((~sign_extendFrom32To64(1bv32)[31:0] == unknown-#memory_int-unknown[b][b] && 0bv32 == b) && (\exists ULTIMATE.start_main_~a~0.base : bv32, ULTIMATE.start_main_~a~0.offset : bv32 :: ~sign_extendFrom32To64(10bv32)[31:0] == unknown-#memory_int-unknown[ULTIMATE.start_main_~a~0.base][ULTIMATE.start_main_~a~0.offset])) && ~sign_extendFrom32To64(1bv32)[63:32] == unknown-#memory_int-unknown[b][~bvadd16(b, 4bv32)] [2019-11-16 00:42:20,166 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((~sign_extendFrom32To64(1bv32)[31:0] == unknown-#memory_int-unknown[b][b] && 0bv32 == b) && (\exists ULTIMATE.start_main_~a~0.base : bv32, ULTIMATE.start_main_~a~0.offset : bv32 :: ~sign_extendFrom32To64(10bv32)[31:0] == unknown-#memory_int-unknown[ULTIMATE.start_main_~a~0.base][ULTIMATE.start_main_~a~0.offset])) && ~sign_extendFrom32To64(1bv32)[63:32] == unknown-#memory_int-unknown[b][~bvadd16(b, 4bv32)] [2019-11-16 00:42:20,166 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((~sign_extendFrom32To64(1bv32)[31:0] == unknown-#memory_int-unknown[b][b] && 0bv32 == b) && 0bv32 == i) && (\exists ULTIMATE.start_main_~a~0.base : bv32, ULTIMATE.start_main_~a~0.offset : bv32 :: ~sign_extendFrom32To64(10bv32)[31:0] == unknown-#memory_int-unknown[ULTIMATE.start_main_~a~0.base][ULTIMATE.start_main_~a~0.offset])) && ~sign_extendFrom32To64(1bv32)[63:32] == unknown-#memory_int-unknown[b][~bvadd16(b, 4bv32)]) || ((!~bvslt32(1bv32, N) && !~bvslt32(i, N)) && (((~sign_extendFrom32To64(1bv32)[31:0] == unknown-#memory_int-unknown[b][b] && 0bv32 == b) && (\exists ULTIMATE.start_main_~a~0.base : bv32, ULTIMATE.start_main_~a~0.offset : bv32 :: ~sign_extendFrom32To64(10bv32)[31:0] == unknown-#memory_int-unknown[ULTIMATE.start_main_~a~0.base][ULTIMATE.start_main_~a~0.offset])) && !(cond == 0bv32)) && ~sign_extendFrom32To64(1bv32)[63:32] == unknown-#memory_int-unknown[b][~bvadd16(b, 4bv32)])) || (~bvadd16(cond, 4294967295bv32) == 0bv32 && (((~sign_extendFrom32To64(1bv32)[31:0] == unknown-#memory_int-unknown[b][b] && 0bv32 == b) && (\exists ULTIMATE.start_main_~a~0.base : bv32, ULTIMATE.start_main_~a~0.offset : bv32 :: ~sign_extendFrom32To64(10bv32)[31:0] == unknown-#memory_int-unknown[ULTIMATE.start_main_~a~0.base][ULTIMATE.start_main_~a~0.offset])) && !(cond == 0bv32)) && ~sign_extendFrom32To64(1bv32)[63:32] == unknown-#memory_int-unknown[b][~bvadd16(b, 4bv32)]) [2019-11-16 00:42:20,195 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a648aee0-dc33-496c-b354-4a4d268abfad/bin/uautomizer/witness.graphml [2019-11-16 00:42:20,195 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:42:20,197 INFO L168 Benchmark]: Toolchain (without parser) took 96138.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Free memory was 947.0 MB in the beginning and 918.4 MB in the end (delta: 28.6 MB). Peak memory consumption was 229.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:42:20,197 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:42:20,198 INFO L168 Benchmark]: CACSL2BoogieTranslator took 415.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -194.2 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:42:20,199 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:42:20,199 INFO L168 Benchmark]: Boogie Preprocessor took 29.42 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:42:20,199 INFO L168 Benchmark]: RCFGBuilder took 390.07 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: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:42:20,200 INFO L168 Benchmark]: TraceAbstraction took 95171.90 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 55.6 MB). Free memory was 1.1 GB in the beginning and 918.4 MB in the end (delta: 192.3 MB). Peak memory consumption was 247.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:42:20,200 INFO L168 Benchmark]: Witness Printer took 72.87 ms. Allocated memory is still 1.2 GB. Free memory is still 918.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:42:20,203 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 415.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -194.2 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.42 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 390.07 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: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 95171.90 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 55.6 MB). Free memory was 1.1 GB in the beginning and 918.4 MB in the end (delta: 192.3 MB). Peak memory consumption was 247.9 MB. Max. memory is 11.5 GB. * Witness Printer took 72.87 ms. Allocated memory is still 1.2 GB. Free memory is still 918.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.offset,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 38]: Loop Invariant [2019-11-16 00:42:20,216 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.base,QUANTIFIED] [2019-11-16 00:42:20,217 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.offset,QUANTIFIED] [2019-11-16 00:42:20,217 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.base,QUANTIFIED] [2019-11-16 00:42:20,217 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.offset,QUANTIFIED] [2019-11-16 00:42:20,218 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.base,QUANTIFIED] [2019-11-16 00:42:20,218 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.offset,QUANTIFIED] [2019-11-16 00:42:20,219 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,219 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,219 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,219 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,220 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,220 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,220 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,220 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,221 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,221 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.base,QUANTIFIED] [2019-11-16 00:42:20,222 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.offset,QUANTIFIED] [2019-11-16 00:42:20,222 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.base,QUANTIFIED] [2019-11-16 00:42:20,222 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.offset,QUANTIFIED] [2019-11-16 00:42:20,223 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.base,QUANTIFIED] [2019-11-16 00:42:20,223 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.offset,QUANTIFIED] [2019-11-16 00:42:20,223 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,224 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,224 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,224 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,224 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,225 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,225 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,225 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,225 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((~sign_extendFrom32To64(1bv32)[31:0] == unknown-#memory_int-unknown[b][b] && 0bv32 == b) && 0bv32 == i) && (\exists ULTIMATE.start_main_~a~0.base : bv32, ULTIMATE.start_main_~a~0.offset : bv32 :: ~sign_extendFrom32To64(10bv32)[31:0] == unknown-#memory_int-unknown[ULTIMATE.start_main_~a~0.base][ULTIMATE.start_main_~a~0.offset])) && ~sign_extendFrom32To64(1bv32)[63:32] == unknown-#memory_int-unknown[b][~bvadd16(b, 4bv32)]) || ((!~bvslt32(1bv32, N) && !~bvslt32(i, N)) && (((~sign_extendFrom32To64(1bv32)[31:0] == unknown-#memory_int-unknown[b][b] && 0bv32 == b) && (\exists ULTIMATE.start_main_~a~0.base : bv32, ULTIMATE.start_main_~a~0.offset : bv32 :: ~sign_extendFrom32To64(10bv32)[31:0] == unknown-#memory_int-unknown[ULTIMATE.start_main_~a~0.base][ULTIMATE.start_main_~a~0.offset])) && !(cond == 0bv32)) && ~sign_extendFrom32To64(1bv32)[63:32] == unknown-#memory_int-unknown[b][~bvadd16(b, 4bv32)])) || (~bvadd16(cond, 4294967295bv32) == 0bv32 && (((~sign_extendFrom32To64(1bv32)[31:0] == unknown-#memory_int-unknown[b][b] && 0bv32 == b) && (\exists ULTIMATE.start_main_~a~0.base : bv32, ULTIMATE.start_main_~a~0.offset : bv32 :: ~sign_extendFrom32To64(10bv32)[31:0] == unknown-#memory_int-unknown[ULTIMATE.start_main_~a~0.base][ULTIMATE.start_main_~a~0.offset])) && !(cond == 0bv32)) && ~sign_extendFrom32To64(1bv32)[63:32] == unknown-#memory_int-unknown[b][~bvadd16(b, 4bv32)]) - InvariantResult [Line: 33]: Loop Invariant [2019-11-16 00:42:20,227 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.base,QUANTIFIED] [2019-11-16 00:42:20,227 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.offset,QUANTIFIED] [2019-11-16 00:42:20,227 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,227 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,228 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,228 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.base,QUANTIFIED] [2019-11-16 00:42:20,228 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.offset,QUANTIFIED] [2019-11-16 00:42:20,229 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,229 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,229 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((~sign_extendFrom32To64(1bv32)[31:0] == unknown-#memory_int-unknown[b][b] && 0bv32 == b) && (\exists ULTIMATE.start_main_~a~0.base : bv32, ULTIMATE.start_main_~a~0.offset : bv32 :: ~sign_extendFrom32To64(10bv32)[31:0] == unknown-#memory_int-unknown[ULTIMATE.start_main_~a~0.base][ULTIMATE.start_main_~a~0.offset])) && ~sign_extendFrom32To64(1bv32)[63:32] == unknown-#memory_int-unknown[b][~bvadd16(b, 4bv32)] - InvariantResult [Line: 28]: Loop Invariant [2019-11-16 00:42:20,230 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.base,QUANTIFIED] [2019-11-16 00:42:20,230 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.offset,QUANTIFIED] [2019-11-16 00:42:20,231 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,231 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,231 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,232 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.base,QUANTIFIED] [2019-11-16 00:42:20,232 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~a~0.offset,QUANTIFIED] [2019-11-16 00:42:20,232 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,232 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:42:20,233 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((~sign_extendFrom32To64(1bv32)[31:0] == unknown-#memory_int-unknown[b][b] && 0bv32 == b) && (\exists ULTIMATE.start_main_~a~0.base : bv32, ULTIMATE.start_main_~a~0.offset : bv32 :: ~sign_extendFrom32To64(10bv32)[31:0] == unknown-#memory_int-unknown[ULTIMATE.start_main_~a~0.base][ULTIMATE.start_main_~a~0.offset])) && ~sign_extendFrom32To64(1bv32)[63:32] == unknown-#memory_int-unknown[b][~bvadd16(b, 4bv32)] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. Result: SAFE, OverallTime: 95.0s, OverallIterations: 4, TraceHistogramMax: 2, AutomataDifference: 86.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, HoareTripleCheckerStatistics: 52 SDtfs, 148 SDslu, 126 SDs, 0 SdLazy, 333 SolverSat, 89 SolverUnsat, 10 SolverUnknown, 0 SolverNotchecked, 25.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 65.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 27 NumberOfFragments, 198 HoareAnnotationTreeSize, 4 FomulaSimplifications, 3721 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 4 FomulaSimplificationsInter, 180 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 52 NumberOfCodeBlocks, 52 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 96 ConstructedInterpolants, 13 QuantifiedInterpolants, 55180 SizeOfPredicates, 32 NumberOfNonLiveVariables, 170 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 2/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...