/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/float-newlib/float_req_bl_0860_true-unreach-call.c --full-output --architecture 32bit --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5eb3fea6 Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-newlib/float_req_bl_0860_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 ed0d812472493a6659106c4dd6f302d65ea2b65b --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false .......................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-newlib/float_req_bl_0860_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 ed0d812472493a6659106c4dd6f302d65ea2b65b --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken --- Real Ultimate output --- This is Ultimate 0.1.23-5eb3fea [2018-09-21 18:27:43,217 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-21 18:27:43,219 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-21 18:27:43,232 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-21 18:27:43,233 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-21 18:27:43,234 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-21 18:27:43,236 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-21 18:27:43,238 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-21 18:27:43,239 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-21 18:27:43,240 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-21 18:27:43,242 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-21 18:27:43,242 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-21 18:27:43,243 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-21 18:27:43,249 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-21 18:27:43,251 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-21 18:27:43,254 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-21 18:27:43,255 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-21 18:27:43,261 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-21 18:27:43,266 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-21 18:27:43,267 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-21 18:27:43,272 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-21 18:27:43,276 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-21 18:27:43,280 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-21 18:27:43,282 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-21 18:27:43,283 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-21 18:27:43,284 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-21 18:27:43,285 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-21 18:27:43,291 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-21 18:27:43,292 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-21 18:27:43,293 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-21 18:27:43,294 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-21 18:27:43,296 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-21 18:27:43,298 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-21 18:27:43,299 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-21 18:27:43,300 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-21 18:27:43,300 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-21 18:27:43,301 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-21 18:27:43,329 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-21 18:27:43,329 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-21 18:27:43,331 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-21 18:27:43,331 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-21 18:27:43,332 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-21 18:27:43,332 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-21 18:27:43,332 INFO L133 SettingsManager]: * Use SBE=true [2018-09-21 18:27:43,332 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-21 18:27:43,332 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-21 18:27:43,333 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-21 18:27:43,333 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-21 18:27:43,333 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-21 18:27:43,333 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-21 18:27:43,334 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-21 18:27:43,335 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-21 18:27:43,335 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-21 18:27:43,335 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-21 18:27:43,335 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-21 18:27:43,335 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-21 18:27:43,336 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-21 18:27:43,336 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-21 18:27:43,336 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-21 18:27:43,336 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-21 18:27:43,337 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-21 18:27:43,338 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-21 18:27:43,338 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-21 18:27:43,338 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-21 18:27:43,338 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-21 18:27:43,338 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-21 18:27:43,339 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> ed0d812472493a6659106c4dd6f302d65ea2b65b Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false [2018-09-21 18:27:43,394 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-21 18:27:43,415 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-21 18:27:43,419 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-21 18:27:43,421 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-21 18:27:43,422 INFO L276 PluginConnector]: CDTParser initialized [2018-09-21 18:27:43,424 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_0860_true-unreach-call.c [2018-09-21 18:27:43,778 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd1516258/d6cb7f1ea4644ab08f07d29b353f05b5/FLAGbfc1013ad [2018-09-21 18:27:44,000 INFO L277 CDTParser]: Found 1 translation units. [2018-09-21 18:27:44,001 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_0860_true-unreach-call.c [2018-09-21 18:27:44,019 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd1516258/d6cb7f1ea4644ab08f07d29b353f05b5/FLAGbfc1013ad [2018-09-21 18:27:44,039 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd1516258/d6cb7f1ea4644ab08f07d29b353f05b5 [2018-09-21 18:27:44,044 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-21 18:27:44,047 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-21 18:27:44,048 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-21 18:27:44,048 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-21 18:27:44,055 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-21 18:27:44,056 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 06:27:44" (1/1) ... [2018-09-21 18:27:44,059 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f022dd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:27:44, skipping insertion in model container [2018-09-21 18:27:44,059 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 06:27:44" (1/1) ... [2018-09-21 18:27:44,071 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-21 18:27:44,374 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.UnsupportedOperationException: createNanOrInfinity is unsupported in non-bitprecise translation at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.createNanOrInfinity(IntegerTranslation.java:882) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.StandardFunctionHandler.handleNaNOrInfinity(StandardFunctionHandler.java:968) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.StandardFunctionHandler.lambda$38(StandardFunctionHandler.java:261) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.StandardFunctionHandler.translateStandardFunction(StandardFunctionHandler.java:160) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1549) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:316) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleReturnStatement(FunctionHandler.java:513) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1928) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:242) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1748) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:278) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1191) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:281) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1725) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:278) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1191) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:281) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:339) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1573) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:204) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3980) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2445) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:600) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:183) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.preRun(MainDispatcher.java:348) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.Dispatcher.run(Dispatcher.java:220) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.doTranslation(CACSL2BoogieTranslatorObserver.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:152) 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) [2018-09-21 18:27:44,386 INFO L168 Benchmark]: Toolchain (without parser) took 342.00 ms. Allocated memory is still 1.0 GB. Free memory was 949.2 MB in the beginning and 933.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-09-21 18:27:44,391 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-21 18:27:44,391 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.10 ms. Allocated memory is still 1.0 GB. Free memory was 949.2 MB in the beginning and 933.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-09-21 18:27:44,396 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 337.10 ms. Allocated memory is still 1.0 GB. Free memory was 949.2 MB in the beginning and 933.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: UnsupportedOperationException: createNanOrInfinity is unsupported in non-bitprecise translation de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: UnsupportedOperationException: createNanOrInfinity is unsupported in non-bitprecise translation: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.createNanOrInfinity(IntegerTranslation.java:882) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-5eb3fea [2018-09-21 18:27:46,556 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-21 18:27:46,558 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-21 18:27:46,571 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-21 18:27:46,572 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-21 18:27:46,573 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-21 18:27:46,574 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-21 18:27:46,576 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-21 18:27:46,578 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-21 18:27:46,579 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-21 18:27:46,580 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-21 18:27:46,580 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-21 18:27:46,581 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-21 18:27:46,583 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-21 18:27:46,584 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-21 18:27:46,585 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-21 18:27:46,586 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-21 18:27:46,588 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-21 18:27:46,590 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-21 18:27:46,592 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-21 18:27:46,593 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-21 18:27:46,595 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-21 18:27:46,598 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-21 18:27:46,598 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-21 18:27:46,598 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-21 18:27:46,600 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-21 18:27:46,601 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-21 18:27:46,602 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-21 18:27:46,603 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-21 18:27:46,604 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-21 18:27:46,605 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-21 18:27:46,606 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-21 18:27:46,606 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-21 18:27:46,606 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-21 18:27:46,608 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-21 18:27:46,609 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-21 18:27:46,609 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-21 18:27:46,643 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-21 18:27:46,643 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-21 18:27:46,644 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-21 18:27:46,644 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-21 18:27:46,644 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-21 18:27:46,645 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-21 18:27:46,645 INFO L133 SettingsManager]: * Use SBE=true [2018-09-21 18:27:46,645 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-21 18:27:46,645 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-21 18:27:46,646 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-21 18:27:46,646 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-21 18:27:46,646 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-21 18:27:46,646 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-21 18:27:46,646 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-21 18:27:46,646 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-21 18:27:46,647 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-21 18:27:46,647 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-21 18:27:46,647 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-21 18:27:46,647 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-21 18:27:46,649 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-21 18:27:46,649 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-21 18:27:46,649 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-21 18:27:46,649 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-21 18:27:46,649 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-21 18:27:46,650 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-21 18:27:46,650 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-21 18:27:46,650 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-21 18:27:46,650 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-21 18:27:46,651 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-21 18:27:46,651 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-21 18:27:46,652 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-21 18:27:46,652 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> ed0d812472493a6659106c4dd6f302d65ea2b65b Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false [2018-09-21 18:27:46,720 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-21 18:27:46,734 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-21 18:27:46,738 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-21 18:27:46,739 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-21 18:27:46,740 INFO L276 PluginConnector]: CDTParser initialized [2018-09-21 18:27:46,741 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_0860_true-unreach-call.c [2018-09-21 18:27:47,131 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9ffaaac8/19bf873385624f5abfa93e292cbfc9a9/FLAGc5f8d99cd [2018-09-21 18:27:47,366 INFO L277 CDTParser]: Found 1 translation units. [2018-09-21 18:27:47,367 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_0860_true-unreach-call.c [2018-09-21 18:27:47,384 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9ffaaac8/19bf873385624f5abfa93e292cbfc9a9/FLAGc5f8d99cd [2018-09-21 18:27:47,412 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9ffaaac8/19bf873385624f5abfa93e292cbfc9a9 [2018-09-21 18:27:47,416 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-21 18:27:47,418 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-21 18:27:47,419 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-21 18:27:47,420 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-21 18:27:47,427 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-21 18:27:47,428 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 06:27:47" (1/1) ... [2018-09-21 18:27:47,431 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e47104f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:27:47, skipping insertion in model container [2018-09-21 18:27:47,431 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 06:27:47" (1/1) ... [2018-09-21 18:27:47,443 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-21 18:27:47,901 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-21 18:27:47,927 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-21 18:27:48,147 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-21 18:27:48,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:27:48 WrapperNode [2018-09-21 18:27:48,220 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-21 18:27:48,221 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-21 18:27:48,221 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-21 18:27:48,221 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-21 18:27:48,238 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:27:48" (1/1) ... [2018-09-21 18:27:48,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:27:48" (1/1) ... [2018-09-21 18:27:48,274 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:27:48" (1/1) ... [2018-09-21 18:27:48,275 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:27:48" (1/1) ... [2018-09-21 18:27:48,312 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:27:48" (1/1) ... [2018-09-21 18:27:48,332 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:27:48" (1/1) ... [2018-09-21 18:27:48,340 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:27:48" (1/1) ... [2018-09-21 18:27:48,350 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-21 18:27:48,351 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-21 18:27:48,351 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-21 18:27:48,351 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-21 18:27:48,500 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:27:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2018-09-21 18:27:48,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-21 18:27:48,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-21 18:27:48,597 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrtf [2018-09-21 18:27:48,597 INFO L138 BoogieDeclarations]: Found implementation of procedure copysign_float [2018-09-21 18:27:48,597 INFO L138 BoogieDeclarations]: Found implementation of procedure scalbn_float [2018-09-21 18:27:48,597 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_float [2018-09-21 18:27:48,598 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_powf [2018-09-21 18:27:48,598 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_float [2018-09-21 18:27:48,598 INFO L138 BoogieDeclarations]: Found implementation of procedure isfinite_float [2018-09-21 18:27:48,598 INFO L138 BoogieDeclarations]: Found implementation of procedure floor_float [2018-09-21 18:27:48,601 INFO L138 BoogieDeclarations]: Found implementation of procedure isinteger_float [2018-09-21 18:27:48,602 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2018-09-21 18:27:48,602 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-21 18:27:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-21 18:27:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2018-09-21 18:27:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrtf [2018-09-21 18:27:48,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-21 18:27:48,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-09-21 18:27:48,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-21 18:27:48,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-21 18:27:48,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-21 18:27:48,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2018-09-21 18:27:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure copysign_float [2018-09-21 18:27:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure scalbn_float [2018-09-21 18:27:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_float [2018-09-21 18:27:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_powf [2018-09-21 18:27:48,607 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_float [2018-09-21 18:27:48,608 INFO L130 BoogieDeclarations]: Found specification of procedure isfinite_float [2018-09-21 18:27:48,608 INFO L130 BoogieDeclarations]: Found specification of procedure floor_float [2018-09-21 18:27:48,608 INFO L130 BoogieDeclarations]: Found specification of procedure isinteger_float [2018-09-21 18:27:48,609 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2018-09-21 18:27:48,609 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-21 18:27:48,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-21 18:27:48,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-21 18:27:48,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4 [2018-09-21 18:27:48,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-21 18:27:48,997 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:27:49,045 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:27:49,288 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:27:49,330 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:27:49,418 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:27:49,440 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:27:49,568 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:27:49,609 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:27:49,658 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:27:49,677 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:27:53,845 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:27:53,855 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:27:54,088 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:27:54,128 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:27:56,304 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:27:56,317 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:27:58,558 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:27:58,565 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:28:00,798 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:28:00,803 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:28:02,915 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:28:02,925 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:28:03,278 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:28:03,283 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:28:05,139 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:28:05,146 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:28:10,475 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:28:10,480 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:28:12,818 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:28:12,826 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:28:13,038 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:28:13,064 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:28:15,204 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:28:15,211 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:28:15,576 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:28:15,626 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:28:15,761 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:28:15,768 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:28:15,957 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:28:15,969 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:28:16,722 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:28:16,737 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 18:28:17,544 INFO L373 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-21 18:28:17,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 06:28:17 BoogieIcfgContainer [2018-09-21 18:28:17,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-21 18:28:17,546 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-21 18:28:17,546 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-21 18:28:17,549 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-21 18:28:17,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 06:27:47" (1/3) ... [2018-09-21 18:28:17,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59093c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 06:28:17, skipping insertion in model container [2018-09-21 18:28:17,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 06:27:48" (2/3) ... [2018-09-21 18:28:17,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59093c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 06:28:17, skipping insertion in model container [2018-09-21 18:28:17,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 06:28:17" (3/3) ... [2018-09-21 18:28:17,553 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_0860_true-unreach-call.c [2018-09-21 18:28:17,564 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-21 18:28:17,575 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-21 18:28:17,629 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-21 18:28:17,630 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-21 18:28:17,630 INFO L382 AbstractCegarLoop]: Hoare is false [2018-09-21 18:28:17,630 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-21 18:28:17,630 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-21 18:28:17,631 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-21 18:28:17,631 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-21 18:28:17,631 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-21 18:28:17,631 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-21 18:28:17,669 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states. [2018-09-21 18:28:17,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-09-21 18:28:17,694 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:28:17,696 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:28:17,699 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:28:17,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1023226999, now seen corresponding path program 1 times [2018-09-21 18:28:17,711 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:28:17,712 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-09-21 18:28:17,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:28:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:28:17,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:28:17,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:28:17,920 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:28:17,941 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:28:17,941 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-21 18:28:17,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-21 18:28:17,965 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-21 18:28:17,966 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-21 18:28:17,968 INFO L87 Difference]: Start difference. First operand 554 states. Second operand 2 states. [2018-09-21 18:28:18,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:28:18,036 INFO L93 Difference]: Finished difference Result 554 states and 630 transitions. [2018-09-21 18:28:18,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-21 18:28:18,038 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-09-21 18:28:18,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:28:18,066 INFO L225 Difference]: With dead ends: 554 [2018-09-21 18:28:18,068 INFO L226 Difference]: Without dead ends: 549 [2018-09-21 18:28:18,071 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-21 18:28:18,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2018-09-21 18:28:18,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 549. [2018-09-21 18:28:18,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2018-09-21 18:28:18,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 624 transitions. [2018-09-21 18:28:18,169 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 624 transitions. Word has length 27 [2018-09-21 18:28:18,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:28:18,170 INFO L480 AbstractCegarLoop]: Abstraction has 549 states and 624 transitions. [2018-09-21 18:28:18,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-21 18:28:18,170 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 624 transitions. [2018-09-21 18:28:18,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-21 18:28:18,174 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:28:18,174 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:28:18,175 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:28:18,175 INFO L82 PathProgramCache]: Analyzing trace with hash -108711877, now seen corresponding path program 1 times [2018-09-21 18:28:18,176 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:28:18,176 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-21 18:28:18,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:28:18,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:28:18,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:28:18,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:28:18,403 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:28:18,422 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:28:18,422 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-21 18:28:18,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-21 18:28:18,424 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-21 18:28:18,424 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-21 18:28:18,424 INFO L87 Difference]: Start difference. First operand 549 states and 624 transitions. Second operand 5 states. [2018-09-21 18:28:18,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:28:18,669 INFO L93 Difference]: Finished difference Result 558 states and 630 transitions. [2018-09-21 18:28:18,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-21 18:28:18,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-09-21 18:28:18,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:28:18,679 INFO L225 Difference]: With dead ends: 558 [2018-09-21 18:28:18,679 INFO L226 Difference]: Without dead ends: 549 [2018-09-21 18:28:18,680 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-09-21 18:28:18,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2018-09-21 18:28:18,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 549. [2018-09-21 18:28:18,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2018-09-21 18:28:18,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 621 transitions. [2018-09-21 18:28:18,721 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 621 transitions. Word has length 45 [2018-09-21 18:28:18,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:28:18,721 INFO L480 AbstractCegarLoop]: Abstraction has 549 states and 621 transitions. [2018-09-21 18:28:18,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-21 18:28:18,721 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 621 transitions. [2018-09-21 18:28:18,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-21 18:28:18,726 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:28:18,727 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:28:18,727 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:28:18,727 INFO L82 PathProgramCache]: Analyzing trace with hash -915066688, now seen corresponding path program 1 times [2018-09-21 18:28:18,729 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:28:18,730 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-09-21 18:28:18,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:28:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:28:18,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:28:19,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:28:19,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:28:19,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:28:19,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:28:19,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:28:19,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:28:19,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:28:19,126 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:28:19,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:28:19,146 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:28:19,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:28:19,150 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:28:19,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:28:19,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:28:19,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:28:19,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:28:19,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:28:19,675 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:28:19,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:28:19,773 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:28:19,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:28:19,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:28:19,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:28:19,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:28:20,239 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-21 18:28:20,239 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:28:20,257 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:28:20,257 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-09-21 18:28:20,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-21 18:28:20,258 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-21 18:28:20,260 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-09-21 18:28:20,260 INFO L87 Difference]: Start difference. First operand 549 states and 621 transitions. Second operand 17 states. [2018-09-21 18:28:35,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:28:35,159 INFO L93 Difference]: Finished difference Result 582 states and 656 transitions. [2018-09-21 18:28:35,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-21 18:28:35,161 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 100 [2018-09-21 18:28:35,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:28:35,167 INFO L225 Difference]: With dead ends: 582 [2018-09-21 18:28:35,167 INFO L226 Difference]: Without dead ends: 582 [2018-09-21 18:28:35,168 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=135, Invalid=987, Unknown=0, NotChecked=0, Total=1122 [2018-09-21 18:28:35,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2018-09-21 18:28:35,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 559. [2018-09-21 18:28:35,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2018-09-21 18:28:35,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 632 transitions. [2018-09-21 18:28:35,188 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 632 transitions. Word has length 100 [2018-09-21 18:28:35,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:28:35,189 INFO L480 AbstractCegarLoop]: Abstraction has 559 states and 632 transitions. [2018-09-21 18:28:35,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-21 18:28:35,190 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 632 transitions. [2018-09-21 18:28:35,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-09-21 18:28:35,192 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:28:35,193 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:28:35,193 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:28:35,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1221432030, now seen corresponding path program 1 times [2018-09-21 18:28:35,194 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:28:35,194 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-09-21 18:28:35,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:28:35,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:28:35,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:28:35,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:28:35,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:28:35,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:28:35,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:28:35,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:28:35,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:28:35,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:28:35,561 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:28:35,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:28:35,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:28:35,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:28:35,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:28:35,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:28:35,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:28:35,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:28:35,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:28:35,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:28:35,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:28:36,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:28:36,033 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:28:36,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:28:36,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:28:36,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:28:36,042 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:28:36,454 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-21 18:28:36,455 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:28:36,471 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:28:36,471 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-09-21 18:28:36,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-21 18:28:36,472 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-21 18:28:36,476 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-09-21 18:28:36,476 INFO L87 Difference]: Start difference. First operand 559 states and 632 transitions. Second operand 17 states. [2018-09-21 18:28:52,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:28:52,250 INFO L93 Difference]: Finished difference Result 614 states and 690 transitions. [2018-09-21 18:28:52,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-21 18:28:52,253 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 101 [2018-09-21 18:28:52,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:28:52,258 INFO L225 Difference]: With dead ends: 614 [2018-09-21 18:28:52,258 INFO L226 Difference]: Without dead ends: 614 [2018-09-21 18:28:52,259 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=156, Invalid=1176, Unknown=0, NotChecked=0, Total=1332 [2018-09-21 18:28:52,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2018-09-21 18:28:52,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 570. [2018-09-21 18:28:52,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-09-21 18:28:52,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 643 transitions. [2018-09-21 18:28:52,280 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 643 transitions. Word has length 101 [2018-09-21 18:28:52,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:28:52,280 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 643 transitions. [2018-09-21 18:28:52,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-21 18:28:52,281 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 643 transitions. [2018-09-21 18:28:52,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-21 18:28:52,284 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:28:52,284 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:28:52,284 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:28:52,285 INFO L82 PathProgramCache]: Analyzing trace with hash -40018148, now seen corresponding path program 1 times [2018-09-21 18:28:52,285 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:28:52,285 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-09-21 18:28:52,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:28:52,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:28:52,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:28:52,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:28:52,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:28:52,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:28:52,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:28:52,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:28:52,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:28:52,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:28:52,604 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:28:52,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:28:52,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:28:52,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:28:52,633 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:28:53,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:28:53,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:28:53,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:28:53,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:28:53,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:28:53,316 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:28:53,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:28:53,418 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:28:53,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:28:53,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:28:53,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:28:53,427 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:28:53,891 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-21 18:28:53,891 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:28:53,903 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:28:53,903 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-09-21 18:28:53,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-21 18:28:53,905 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-21 18:28:53,905 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-09-21 18:28:53,905 INFO L87 Difference]: Start difference. First operand 570 states and 643 transitions. Second operand 18 states. [2018-09-21 18:28:55,253 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-09-21 18:28:55,652 WARN L178 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-09-21 18:28:55,877 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 21 [2018-09-21 18:29:09,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:29:09,813 INFO L93 Difference]: Finished difference Result 576 states and 650 transitions. [2018-09-21 18:29:09,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-21 18:29:09,822 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 102 [2018-09-21 18:29:09,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:29:09,825 INFO L225 Difference]: With dead ends: 576 [2018-09-21 18:29:09,825 INFO L226 Difference]: Without dead ends: 574 [2018-09-21 18:29:09,826 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=147, Invalid=1113, Unknown=0, NotChecked=0, Total=1260 [2018-09-21 18:29:09,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-09-21 18:29:09,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 570. [2018-09-21 18:29:09,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-09-21 18:29:09,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 642 transitions. [2018-09-21 18:29:09,851 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 642 transitions. Word has length 102 [2018-09-21 18:29:09,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:29:09,854 INFO L480 AbstractCegarLoop]: Abstraction has 570 states and 642 transitions. [2018-09-21 18:29:09,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-21 18:29:09,855 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 642 transitions. [2018-09-21 18:29:09,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-21 18:29:09,857 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:29:09,858 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:29:09,858 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:29:09,858 INFO L82 PathProgramCache]: Analyzing trace with hash -236531653, now seen corresponding path program 1 times [2018-09-21 18:29:09,859 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:29:09,859 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-09-21 18:29:09,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:29:10,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:29:10,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:29:10,147 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-21 18:29:10,148 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:29:10,163 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:29:10,163 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-21 18:29:10,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-21 18:29:10,164 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-21 18:29:10,164 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-21 18:29:10,164 INFO L87 Difference]: Start difference. First operand 570 states and 642 transitions. Second operand 7 states. [2018-09-21 18:29:17,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:29:17,539 INFO L93 Difference]: Finished difference Result 575 states and 648 transitions. [2018-09-21 18:29:17,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-21 18:29:17,540 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-09-21 18:29:17,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:29:17,543 INFO L225 Difference]: With dead ends: 575 [2018-09-21 18:29:17,544 INFO L226 Difference]: Without dead ends: 569 [2018-09-21 18:29:17,544 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-09-21 18:29:17,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2018-09-21 18:29:17,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2018-09-21 18:29:17,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2018-09-21 18:29:17,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 639 transitions. [2018-09-21 18:29:17,563 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 639 transitions. Word has length 102 [2018-09-21 18:29:17,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:29:17,564 INFO L480 AbstractCegarLoop]: Abstraction has 569 states and 639 transitions. [2018-09-21 18:29:17,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-21 18:29:17,565 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 639 transitions. [2018-09-21 18:29:17,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-09-21 18:29:17,567 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:29:17,567 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:29:17,567 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:29:17,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1097942362, now seen corresponding path program 1 times [2018-09-21 18:29:17,568 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:29:17,568 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-09-21 18:29:17,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:29:17,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:29:17,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:29:17,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:29:17,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:29:17,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:29:17,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:29:17,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:29:17,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:29:17,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:29:17,917 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:29:17,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:29:17,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:29:17,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:29:17,930 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:29:18,060 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-21 18:29:18,061 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:29:18,076 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:29:18,076 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-21 18:29:18,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-21 18:29:18,077 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-21 18:29:18,077 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-21 18:29:18,077 INFO L87 Difference]: Start difference. First operand 569 states and 639 transitions. Second operand 9 states. [2018-09-21 18:29:18,922 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-09-21 18:29:19,181 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-09-21 18:29:22,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:29:22,957 INFO L93 Difference]: Finished difference Result 842 states and 947 transitions. [2018-09-21 18:29:22,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-21 18:29:22,959 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2018-09-21 18:29:22,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:29:22,963 INFO L225 Difference]: With dead ends: 842 [2018-09-21 18:29:22,963 INFO L226 Difference]: Without dead ends: 523 [2018-09-21 18:29:22,964 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-09-21 18:29:22,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2018-09-21 18:29:22,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2018-09-21 18:29:22,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2018-09-21 18:29:22,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 579 transitions. [2018-09-21 18:29:22,980 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 579 transitions. Word has length 104 [2018-09-21 18:29:22,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:29:22,981 INFO L480 AbstractCegarLoop]: Abstraction has 523 states and 579 transitions. [2018-09-21 18:29:22,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-21 18:29:22,981 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 579 transitions. [2018-09-21 18:29:22,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-09-21 18:29:22,984 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:29:22,984 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:29:22,984 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:29:22,985 INFO L82 PathProgramCache]: Analyzing trace with hash 528628771, now seen corresponding path program 1 times [2018-09-21 18:29:22,985 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:29:22,985 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-09-21 18:29:22,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:29:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:29:23,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:29:23,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:29:23,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:29:23,210 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:29:23,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:29:23,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:29:23,228 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:29:23,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:29:23,253 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:29:23,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:29:23,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:29:23,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:29:23,260 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:29:23,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:29:23,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:29:23,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:29:23,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:29:23,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:29:23,793 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:29:23,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:29:23,867 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:29:23,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:29:23,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:29:23,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:29:23,875 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:29:24,342 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-21 18:29:24,342 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:29:24,360 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:29:24,360 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-09-21 18:29:24,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-21 18:29:24,361 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-21 18:29:24,361 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-09-21 18:29:24,362 INFO L87 Difference]: Start difference. First operand 523 states and 579 transitions. Second operand 18 states. [2018-09-21 18:29:25,630 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-09-21 18:29:25,943 WARN L178 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-09-21 18:29:26,171 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 21 [2018-09-21 18:29:38,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:29:38,110 INFO L93 Difference]: Finished difference Result 689 states and 759 transitions. [2018-09-21 18:29:38,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-21 18:29:38,112 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 105 [2018-09-21 18:29:38,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:29:38,116 INFO L225 Difference]: With dead ends: 689 [2018-09-21 18:29:38,117 INFO L226 Difference]: Without dead ends: 681 [2018-09-21 18:29:38,118 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=147, Invalid=1113, Unknown=0, NotChecked=0, Total=1260 [2018-09-21 18:29:38,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2018-09-21 18:29:38,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 521. [2018-09-21 18:29:38,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2018-09-21 18:29:38,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 572 transitions. [2018-09-21 18:29:38,143 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 572 transitions. Word has length 105 [2018-09-21 18:29:38,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:29:38,144 INFO L480 AbstractCegarLoop]: Abstraction has 521 states and 572 transitions. [2018-09-21 18:29:38,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-21 18:29:38,144 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 572 transitions. [2018-09-21 18:29:38,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-09-21 18:29:38,145 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:29:38,146 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:29:38,146 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:29:38,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1613809251, now seen corresponding path program 1 times [2018-09-21 18:29:38,149 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:29:38,150 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-21 18:29:38,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-09-21 18:29:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:29:38,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:29:38,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:29:38,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:29:38,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:29:38,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:29:38,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:29:38,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:29:38,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:29:38,629 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:29:38,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:29:38,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:29:38,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:29:38,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:29:38,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:29:38,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:29:38,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:29:38,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:29:38,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:29:38,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:29:39,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:29:39,071 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:29:39,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:29:39,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:29:39,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:29:39,094 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:29:39,480 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-21 18:29:39,480 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:29:39,495 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:29:39,495 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-09-21 18:29:39,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-21 18:29:39,496 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-21 18:29:39,496 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-09-21 18:29:39,496 INFO L87 Difference]: Start difference. First operand 521 states and 572 transitions. Second operand 17 states. [2018-09-21 18:29:55,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:29:55,479 INFO L93 Difference]: Finished difference Result 723 states and 788 transitions. [2018-09-21 18:29:55,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-21 18:29:55,481 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 107 [2018-09-21 18:29:55,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:29:55,485 INFO L225 Difference]: With dead ends: 723 [2018-09-21 18:29:55,485 INFO L226 Difference]: Without dead ends: 723 [2018-09-21 18:29:55,486 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=135, Invalid=987, Unknown=0, NotChecked=0, Total=1122 [2018-09-21 18:29:55,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2018-09-21 18:29:55,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 545. [2018-09-21 18:29:55,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2018-09-21 18:29:55,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 604 transitions. [2018-09-21 18:29:55,513 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 604 transitions. Word has length 107 [2018-09-21 18:29:55,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:29:55,514 INFO L480 AbstractCegarLoop]: Abstraction has 545 states and 604 transitions. [2018-09-21 18:29:55,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-21 18:29:55,514 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 604 transitions. [2018-09-21 18:29:55,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-21 18:29:55,515 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:29:55,517 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:29:55,517 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:29:55,518 INFO L82 PathProgramCache]: Analyzing trace with hash 222587763, now seen corresponding path program 1 times [2018-09-21 18:29:55,518 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:29:55,518 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-09-21 18:29:55,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:29:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:29:55,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:29:55,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:29:55,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:29:55,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:29:55,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:29:55,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:29:55,956 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:29:55,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:29:55,980 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:29:55,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:29:55,984 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:29:55,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:29:55,989 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:29:56,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:29:56,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:29:56,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:29:56,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:29:56,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:29:56,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:29:56,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:29:56,413 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:29:56,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:29:56,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:29:56,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:29:56,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:29:56,741 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-21 18:29:56,741 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:29:56,760 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:29:56,760 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-09-21 18:29:56,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-21 18:29:56,762 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-21 18:29:56,762 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-09-21 18:29:56,762 INFO L87 Difference]: Start difference. First operand 545 states and 604 transitions. Second operand 17 states. [2018-09-21 18:30:10,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:30:10,816 INFO L93 Difference]: Finished difference Result 583 states and 645 transitions. [2018-09-21 18:30:10,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-21 18:30:10,817 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 108 [2018-09-21 18:30:10,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:30:10,822 INFO L225 Difference]: With dead ends: 583 [2018-09-21 18:30:10,822 INFO L226 Difference]: Without dead ends: 583 [2018-09-21 18:30:10,823 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=135, Invalid=987, Unknown=0, NotChecked=0, Total=1122 [2018-09-21 18:30:10,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2018-09-21 18:30:10,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 545. [2018-09-21 18:30:10,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2018-09-21 18:30:10,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 604 transitions. [2018-09-21 18:30:10,841 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 604 transitions. Word has length 108 [2018-09-21 18:30:10,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:30:10,843 INFO L480 AbstractCegarLoop]: Abstraction has 545 states and 604 transitions. [2018-09-21 18:30:10,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-21 18:30:10,843 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 604 transitions. [2018-09-21 18:30:10,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-21 18:30:10,845 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:30:10,845 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:30:10,845 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:30:10,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1154801965, now seen corresponding path program 1 times [2018-09-21 18:30:10,848 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:30:10,848 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-09-21 18:30:10,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:30:11,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:30:11,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:30:11,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:30:11,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:30:11,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:30:11,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:30:11,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:30:11,456 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:30:11,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:30:11,507 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:30:11,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:30:11,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:30:11,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:30:11,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:30:11,649 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-21 18:30:11,650 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:30:11,664 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:30:11,664 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-09-21 18:30:11,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-21 18:30:11,665 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-21 18:30:11,665 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-09-21 18:30:11,666 INFO L87 Difference]: Start difference. First operand 545 states and 604 transitions. Second operand 15 states. [2018-09-21 18:30:13,038 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-21 18:30:20,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:30:20,607 INFO L93 Difference]: Finished difference Result 570 states and 638 transitions. [2018-09-21 18:30:20,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-21 18:30:20,610 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2018-09-21 18:30:20,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:30:20,612 INFO L225 Difference]: With dead ends: 570 [2018-09-21 18:30:20,612 INFO L226 Difference]: Without dead ends: 570 [2018-09-21 18:30:20,613 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2018-09-21 18:30:20,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2018-09-21 18:30:20,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 563. [2018-09-21 18:30:20,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2018-09-21 18:30:20,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 627 transitions. [2018-09-21 18:30:20,631 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 627 transitions. Word has length 108 [2018-09-21 18:30:20,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:30:20,633 INFO L480 AbstractCegarLoop]: Abstraction has 563 states and 627 transitions. [2018-09-21 18:30:20,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-21 18:30:20,633 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 627 transitions. [2018-09-21 18:30:20,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-21 18:30:20,636 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:30:20,636 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:30:20,636 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:30:20,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1147042606, now seen corresponding path program 1 times [2018-09-21 18:30:20,637 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:30:20,637 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-09-21 18:30:20,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:30:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:30:20,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:30:20,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:30:20,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:30:20,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:30:20,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:30:20,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:30:20,955 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:30:20,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:30:20,990 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:30:20,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:30:21,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:30:21,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:30:21,037 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:30:21,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:30:21,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:30:21,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:30:21,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:30:21,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:30:21,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:30:21,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:30:21,490 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:30:21,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:30:21,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:30:21,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:30:21,500 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:30:21,659 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-21 18:30:21,659 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:30:21,676 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:30:21,676 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-09-21 18:30:21,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-21 18:30:21,677 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-21 18:30:21,677 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-09-21 18:30:21,677 INFO L87 Difference]: Start difference. First operand 563 states and 627 transitions. Second operand 16 states. [2018-09-21 18:30:33,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:30:33,559 INFO L93 Difference]: Finished difference Result 597 states and 664 transitions. [2018-09-21 18:30:33,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-21 18:30:33,562 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 108 [2018-09-21 18:30:33,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:30:33,565 INFO L225 Difference]: With dead ends: 597 [2018-09-21 18:30:33,566 INFO L226 Difference]: Without dead ends: 597 [2018-09-21 18:30:33,566 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=125, Invalid=867, Unknown=0, NotChecked=0, Total=992 [2018-09-21 18:30:33,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-09-21 18:30:33,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 555. [2018-09-21 18:30:33,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-09-21 18:30:33,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 617 transitions. [2018-09-21 18:30:33,584 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 617 transitions. Word has length 108 [2018-09-21 18:30:33,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:30:33,585 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 617 transitions. [2018-09-21 18:30:33,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-21 18:30:33,585 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 617 transitions. [2018-09-21 18:30:33,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-09-21 18:30:33,588 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:30:33,589 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:30:33,589 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:30:33,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1193267089, now seen corresponding path program 1 times [2018-09-21 18:30:33,590 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:30:33,590 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2018-09-21 18:30:33,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:30:33,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:30:33,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:30:34,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:30:34,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:30:34,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:30:34,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:30:34,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:30:34,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:30:34,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:30:34,311 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:30:34,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:30:34,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:30:34,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:30:34,323 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:30:34,559 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-21 18:30:34,560 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:30:34,574 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:30:34,574 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-09-21 18:30:34,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-21 18:30:34,575 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-21 18:30:34,575 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-09-21 18:30:34,575 INFO L87 Difference]: Start difference. First operand 555 states and 617 transitions. Second operand 16 states. [2018-09-21 18:30:45,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:30:45,947 INFO L93 Difference]: Finished difference Result 572 states and 640 transitions. [2018-09-21 18:30:45,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-21 18:30:45,950 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 109 [2018-09-21 18:30:45,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:30:45,952 INFO L225 Difference]: With dead ends: 572 [2018-09-21 18:30:45,953 INFO L226 Difference]: Without dead ends: 572 [2018-09-21 18:30:45,953 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2018-09-21 18:30:45,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2018-09-21 18:30:45,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 555. [2018-09-21 18:30:45,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-09-21 18:30:45,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 617 transitions. [2018-09-21 18:30:45,970 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 617 transitions. Word has length 109 [2018-09-21 18:30:45,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:30:45,970 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 617 transitions. [2018-09-21 18:30:45,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-21 18:30:45,971 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 617 transitions. [2018-09-21 18:30:45,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-21 18:30:45,974 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:30:45,974 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:30:45,975 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:30:45,975 INFO L82 PathProgramCache]: Analyzing trace with hash 512784806, now seen corresponding path program 1 times [2018-09-21 18:30:45,975 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:30:45,975 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-21 18:30:45,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2018-09-21 18:30:46,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:30:46,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:30:46,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:30:46,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:30:46,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:30:46,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:30:46,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:30:46,283 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:30:46,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:30:46,332 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:30:46,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:30:46,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:30:46,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:30:46,382 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:30:46,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:30:46,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:30:46,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:30:46,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:30:46,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:30:46,725 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:35 [2018-09-21 18:30:46,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 42 [2018-09-21 18:30:46,797 INFO L477 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 42 treesize of output 28 [2018-09-21 18:30:46,798 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:30:46,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:30:46,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:30:46,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:28 [2018-09-21 18:30:47,718 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-21 18:30:47,718 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:30:47,743 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:30:47,743 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-09-21 18:30:47,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-21 18:30:47,744 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-21 18:30:47,744 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-09-21 18:30:47,744 INFO L87 Difference]: Start difference. First operand 555 states and 617 transitions. Second operand 17 states. [2018-09-21 18:30:51,392 WARN L178 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2018-09-21 18:30:53,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:30:53,167 INFO L93 Difference]: Finished difference Result 587 states and 648 transitions. [2018-09-21 18:30:53,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-21 18:30:53,168 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 112 [2018-09-21 18:30:53,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:30:53,171 INFO L225 Difference]: With dead ends: 587 [2018-09-21 18:30:53,171 INFO L226 Difference]: Without dead ends: 569 [2018-09-21 18:30:53,172 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=135, Invalid=735, Unknown=0, NotChecked=0, Total=870 [2018-09-21 18:30:53,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2018-09-21 18:30:53,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 555. [2018-09-21 18:30:53,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-09-21 18:30:53,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 615 transitions. [2018-09-21 18:30:53,193 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 615 transitions. Word has length 112 [2018-09-21 18:30:53,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:30:53,195 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 615 transitions. [2018-09-21 18:30:53,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-21 18:30:53,195 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 615 transitions. [2018-09-21 18:30:53,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-09-21 18:30:53,198 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:30:53,198 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:30:53,198 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:30:53,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1712493745, now seen corresponding path program 1 times [2018-09-21 18:30:53,199 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:30:53,199 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2018-09-21 18:30:53,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:30:53,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:30:53,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:30:53,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:30:53,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:30:53,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:30:53,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:30:53,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:30:53,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:30:53,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:30:53,742 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:30:53,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:30:53,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:30:53,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:30:53,750 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:30:53,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:30:53,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:30:53,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:30:53,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:30:53,973 INFO L267 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. [2018-09-21 18:30:53,973 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 [2018-09-21 18:30:54,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:30:54,051 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 6 [2018-09-21 18:30:54,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:30:54,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:30:54,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:30:54,086 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:28 [2018-09-21 18:30:55,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:30:55,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:30:55,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:30:55,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:30:55,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:30:55,281 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:30:55,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:30:55,402 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:30:55,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:30:55,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:30:55,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:30:55,412 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:30:55,932 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-21 18:30:55,932 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:30:55,944 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:30:55,945 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2018-09-21 18:30:55,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-21 18:30:55,945 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-21 18:30:55,946 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=550, Unknown=0, NotChecked=0, Total=600 [2018-09-21 18:30:55,946 INFO L87 Difference]: Start difference. First operand 555 states and 615 transitions. Second operand 25 states. [2018-09-21 18:31:02,446 WARN L178 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2018-09-21 18:31:13,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:31:13,225 INFO L93 Difference]: Finished difference Result 595 states and 662 transitions. [2018-09-21 18:31:13,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-21 18:31:13,226 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 113 [2018-09-21 18:31:13,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:31:13,229 INFO L225 Difference]: With dead ends: 595 [2018-09-21 18:31:13,229 INFO L226 Difference]: Without dead ends: 595 [2018-09-21 18:31:13,230 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=188, Invalid=2068, Unknown=0, NotChecked=0, Total=2256 [2018-09-21 18:31:13,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2018-09-21 18:31:13,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 555. [2018-09-21 18:31:13,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-09-21 18:31:13,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 615 transitions. [2018-09-21 18:31:13,255 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 615 transitions. Word has length 113 [2018-09-21 18:31:13,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:31:13,257 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 615 transitions. [2018-09-21 18:31:13,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-21 18:31:13,257 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 615 transitions. [2018-09-21 18:31:13,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-09-21 18:31:13,263 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:31:13,263 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:31:13,263 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:31:13,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1243997904, now seen corresponding path program 1 times [2018-09-21 18:31:13,264 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:31:13,264 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-21 18:31:13,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2018-09-21 18:31:13,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:31:13,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:31:13,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:31:13,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:31:13,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:31:13,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:31:13,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:31:13,545 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:31:13,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:31:13,566 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:31:13,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:31:13,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:31:13,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:31:13,573 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:31:14,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:31:14,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:31:14,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:31:14,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:31:14,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:31:14,157 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:31:14,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:31:14,228 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:31:14,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:31:14,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:31:14,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:31:14,235 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:31:14,577 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-21 18:31:14,577 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:31:14,593 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:31:14,594 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-09-21 18:31:14,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-21 18:31:14,594 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-21 18:31:14,595 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-09-21 18:31:14,595 INFO L87 Difference]: Start difference. First operand 555 states and 615 transitions. Second operand 18 states. [2018-09-21 18:31:18,526 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-09-21 18:31:30,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:31:30,080 INFO L93 Difference]: Finished difference Result 589 states and 651 transitions. [2018-09-21 18:31:30,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-21 18:31:30,082 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 114 [2018-09-21 18:31:30,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:31:30,085 INFO L225 Difference]: With dead ends: 589 [2018-09-21 18:31:30,085 INFO L226 Difference]: Without dead ends: 587 [2018-09-21 18:31:30,086 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=166, Invalid=1316, Unknown=0, NotChecked=0, Total=1482 [2018-09-21 18:31:30,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-09-21 18:31:30,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 534. [2018-09-21 18:31:30,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2018-09-21 18:31:30,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 590 transitions. [2018-09-21 18:31:30,100 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 590 transitions. Word has length 114 [2018-09-21 18:31:30,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:31:30,100 INFO L480 AbstractCegarLoop]: Abstraction has 534 states and 590 transitions. [2018-09-21 18:31:30,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-21 18:31:30,100 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 590 transitions. [2018-09-21 18:31:30,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-09-21 18:31:30,105 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:31:30,105 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:31:30,105 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:31:30,106 INFO L82 PathProgramCache]: Analyzing trace with hash 958179074, now seen corresponding path program 1 times [2018-09-21 18:31:30,106 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:31:30,106 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2018-09-21 18:31:30,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:31:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:31:30,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:31:30,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:31:30,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:31:30,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:31:30,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:31:30,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:31:30,705 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:31:30,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:31:30,729 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:31:30,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:31:30,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:31:30,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:31:30,734 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:31:31,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:31:31,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:31:31,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:31:31,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:31:31,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:31:31,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:31:31,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:31:31,720 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:31:31,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:31:31,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:31:31,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:31:31,726 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:31:32,069 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-21 18:31:32,069 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:31:32,084 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:31:32,085 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-09-21 18:31:32,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-21 18:31:32,085 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-21 18:31:32,085 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-09-21 18:31:32,086 INFO L87 Difference]: Start difference. First operand 534 states and 590 transitions. Second operand 18 states. [2018-09-21 18:31:45,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:31:45,576 INFO L93 Difference]: Finished difference Result 716 states and 779 transitions. [2018-09-21 18:31:45,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-21 18:31:45,579 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 121 [2018-09-21 18:31:45,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:31:45,583 INFO L225 Difference]: With dead ends: 716 [2018-09-21 18:31:45,583 INFO L226 Difference]: Without dead ends: 716 [2018-09-21 18:31:45,584 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=131, Invalid=991, Unknown=0, NotChecked=0, Total=1122 [2018-09-21 18:31:45,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2018-09-21 18:31:45,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 554. [2018-09-21 18:31:45,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2018-09-21 18:31:45,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 613 transitions. [2018-09-21 18:31:45,597 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 613 transitions. Word has length 121 [2018-09-21 18:31:45,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:31:45,598 INFO L480 AbstractCegarLoop]: Abstraction has 554 states and 613 transitions. [2018-09-21 18:31:45,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-21 18:31:45,598 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 613 transitions. [2018-09-21 18:31:45,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-09-21 18:31:45,601 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:31:45,602 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:31:45,602 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:31:45,602 INFO L82 PathProgramCache]: Analyzing trace with hash 2036171686, now seen corresponding path program 1 times [2018-09-21 18:31:45,603 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:31:45,603 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2018-09-21 18:31:45,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:31:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:31:46,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:31:46,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:31:46,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:31:46,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:31:46,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:31:46,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:31:46,091 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:31:46,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:31:46,112 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:31:46,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:31:46,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:31:46,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:31:46,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:31:46,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:31:46,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:31:46,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:31:46,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:31:46,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:31:46,594 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:31:46,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:31:46,658 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:31:46,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:31:46,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:31:46,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:31:46,666 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:31:46,974 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-21 18:31:46,974 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:31:46,989 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:31:46,989 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-09-21 18:31:46,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-21 18:31:46,990 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-21 18:31:46,990 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2018-09-21 18:31:46,990 INFO L87 Difference]: Start difference. First operand 554 states and 613 transitions. Second operand 18 states. [2018-09-21 18:31:59,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:31:59,801 INFO L93 Difference]: Finished difference Result 594 states and 657 transitions. [2018-09-21 18:31:59,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-21 18:31:59,803 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 121 [2018-09-21 18:31:59,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:31:59,805 INFO L225 Difference]: With dead ends: 594 [2018-09-21 18:31:59,806 INFO L226 Difference]: Without dead ends: 594 [2018-09-21 18:31:59,806 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=141, Invalid=1049, Unknown=0, NotChecked=0, Total=1190 [2018-09-21 18:31:59,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2018-09-21 18:31:59,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 575. [2018-09-21 18:31:59,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2018-09-21 18:31:59,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 638 transitions. [2018-09-21 18:31:59,822 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 638 transitions. Word has length 121 [2018-09-21 18:31:59,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:31:59,823 INFO L480 AbstractCegarLoop]: Abstraction has 575 states and 638 transitions. [2018-09-21 18:31:59,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-21 18:31:59,824 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 638 transitions. [2018-09-21 18:31:59,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-09-21 18:31:59,827 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:31:59,827 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:31:59,828 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:31:59,828 INFO L82 PathProgramCache]: Analyzing trace with hash 658781958, now seen corresponding path program 1 times [2018-09-21 18:31:59,828 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:31:59,828 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2018-09-21 18:31:59,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:32:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:32:00,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:32:00,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:32:00,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:32:00,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:32:00,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:32:00,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:32:00,428 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:32:00,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:32:00,565 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:32:00,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:32:00,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:32:00,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:32:00,615 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:32:00,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:32:00,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:32:00,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:32:00,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:32:01,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:32:01,036 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:32:01,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2018-09-21 18:32:01,243 INFO L477 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 31 treesize of output 19 [2018-09-21 18:32:01,243 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:32:01,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:32:01,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:32:01,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:19 [2018-09-21 18:32:01,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:32:01,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:32:01,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:32:01,858 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:32:01,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:32:01,869 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:32:01,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:32:01,957 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:32:01,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:32:01,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:32:01,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:32:01,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:32:02,157 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-21 18:32:02,157 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:32:02,170 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:32:02,170 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-09-21 18:32:02,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-21 18:32:02,171 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-21 18:32:02,172 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-09-21 18:32:02,172 INFO L87 Difference]: Start difference. First operand 575 states and 638 transitions. Second operand 20 states. [2018-09-21 18:32:14,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:32:14,993 INFO L93 Difference]: Finished difference Result 608 states and 676 transitions. [2018-09-21 18:32:14,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-21 18:32:14,995 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 121 [2018-09-21 18:32:14,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:32:14,998 INFO L225 Difference]: With dead ends: 608 [2018-09-21 18:32:14,999 INFO L226 Difference]: Without dead ends: 608 [2018-09-21 18:32:14,999 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=139, Invalid=1193, Unknown=0, NotChecked=0, Total=1332 [2018-09-21 18:32:15,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-09-21 18:32:15,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 586. [2018-09-21 18:32:15,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2018-09-21 18:32:15,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 649 transitions. [2018-09-21 18:32:15,014 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 649 transitions. Word has length 121 [2018-09-21 18:32:15,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:32:15,015 INFO L480 AbstractCegarLoop]: Abstraction has 586 states and 649 transitions. [2018-09-21 18:32:15,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-21 18:32:15,015 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 649 transitions. [2018-09-21 18:32:15,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-21 18:32:15,018 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:32:15,019 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:32:15,019 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:32:15,019 INFO L82 PathProgramCache]: Analyzing trace with hash 942793699, now seen corresponding path program 1 times [2018-09-21 18:32:15,019 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:32:15,020 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2018-09-21 18:32:15,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:32:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:32:15,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:32:15,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:32:15,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:32:15,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:32:15,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:32:15,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:32:15,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:32:15,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:32:15,538 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:32:15,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:32:15,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:32:15,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:32:15,546 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:32:15,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:32:15,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:32:15,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:32:15,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:32:15,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:32:15,888 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:32:15,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:32:15,959 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:32:15,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:32:15,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:32:15,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:32:15,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:32:16,302 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-21 18:32:16,302 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:32:16,317 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:32:16,317 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-09-21 18:32:16,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-21 18:32:16,318 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-21 18:32:16,318 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-09-21 18:32:16,318 INFO L87 Difference]: Start difference. First operand 586 states and 649 transitions. Second operand 17 states. [2018-09-21 18:32:30,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:32:30,760 INFO L93 Difference]: Finished difference Result 736 states and 800 transitions. [2018-09-21 18:32:30,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-21 18:32:30,763 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 122 [2018-09-21 18:32:30,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:32:30,766 INFO L225 Difference]: With dead ends: 736 [2018-09-21 18:32:30,766 INFO L226 Difference]: Without dead ends: 733 [2018-09-21 18:32:30,767 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=148, Invalid=1112, Unknown=0, NotChecked=0, Total=1260 [2018-09-21 18:32:30,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-09-21 18:32:30,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 564. [2018-09-21 18:32:30,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2018-09-21 18:32:30,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 621 transitions. [2018-09-21 18:32:30,781 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 621 transitions. Word has length 122 [2018-09-21 18:32:30,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:32:30,781 INFO L480 AbstractCegarLoop]: Abstraction has 564 states and 621 transitions. [2018-09-21 18:32:30,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-21 18:32:30,781 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 621 transitions. [2018-09-21 18:32:30,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-09-21 18:32:30,783 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:32:30,783 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:32:30,783 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:32:30,783 INFO L82 PathProgramCache]: Analyzing trace with hash -903483253, now seen corresponding path program 1 times [2018-09-21 18:32:30,784 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:32:30,784 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2018-09-21 18:32:30,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:32:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:32:31,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:32:31,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:32:31,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:32:31,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:32:31,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:32:31,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:32:31,260 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:32:31,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:32:31,283 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:32:31,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:32:31,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:32:31,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:32:31,290 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:32:31,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:32:31,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:32:31,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:32:31,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:32:31,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:32:31,627 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:32:31,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:32:31,678 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:32:31,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:32:31,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:32:31,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:32:31,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:32:31,820 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-21 18:32:31,821 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:32:31,835 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:32:31,835 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-09-21 18:32:31,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-21 18:32:31,836 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-21 18:32:31,836 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-09-21 18:32:31,837 INFO L87 Difference]: Start difference. First operand 564 states and 621 transitions. Second operand 15 states. [2018-09-21 18:32:42,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:32:42,425 INFO L93 Difference]: Finished difference Result 610 states and 672 transitions. [2018-09-21 18:32:42,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-21 18:32:42,427 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 123 [2018-09-21 18:32:42,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:32:42,429 INFO L225 Difference]: With dead ends: 610 [2018-09-21 18:32:42,430 INFO L226 Difference]: Without dead ends: 610 [2018-09-21 18:32:42,430 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2018-09-21 18:32:42,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2018-09-21 18:32:42,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 565. [2018-09-21 18:32:42,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2018-09-21 18:32:42,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 622 transitions. [2018-09-21 18:32:42,440 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 622 transitions. Word has length 123 [2018-09-21 18:32:42,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:32:42,440 INFO L480 AbstractCegarLoop]: Abstraction has 565 states and 622 transitions. [2018-09-21 18:32:42,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-21 18:32:42,440 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 622 transitions. [2018-09-21 18:32:42,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-09-21 18:32:42,443 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:32:42,443 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:32:42,444 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:32:42,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1058091405, now seen corresponding path program 1 times [2018-09-21 18:32:42,444 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:32:42,444 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2018-09-21 18:32:42,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:32:42,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:32:42,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:32:42,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:32:42,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:32:42,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:32:42,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:32:42,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:32:42,817 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:32:42,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:32:42,848 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:32:42,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:32:42,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:32:42,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:32:42,854 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:32:43,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:32:43,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:32:43,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:32:43,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:32:43,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:32:43,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:32:43,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:32:43,395 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:32:43,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:32:43,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:32:43,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:32:43,402 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:32:43,581 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-21 18:32:43,581 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:32:43,595 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:32:43,595 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-09-21 18:32:43,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-21 18:32:43,596 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-21 18:32:43,596 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-09-21 18:32:43,596 INFO L87 Difference]: Start difference. First operand 565 states and 622 transitions. Second operand 16 states. [2018-09-21 18:32:54,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:32:54,142 INFO L93 Difference]: Finished difference Result 591 states and 650 transitions. [2018-09-21 18:32:54,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-21 18:32:54,147 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 123 [2018-09-21 18:32:54,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:32:54,150 INFO L225 Difference]: With dead ends: 591 [2018-09-21 18:32:54,150 INFO L226 Difference]: Without dead ends: 589 [2018-09-21 18:32:54,151 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=125, Invalid=867, Unknown=0, NotChecked=0, Total=992 [2018-09-21 18:32:54,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-09-21 18:32:54,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 540. [2018-09-21 18:32:54,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2018-09-21 18:32:54,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 593 transitions. [2018-09-21 18:32:54,160 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 593 transitions. Word has length 123 [2018-09-21 18:32:54,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:32:54,162 INFO L480 AbstractCegarLoop]: Abstraction has 540 states and 593 transitions. [2018-09-21 18:32:54,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-21 18:32:54,163 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 593 transitions. [2018-09-21 18:32:54,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-09-21 18:32:54,164 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:32:54,166 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:32:54,167 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:32:54,167 INFO L82 PathProgramCache]: Analyzing trace with hash 944295602, now seen corresponding path program 1 times [2018-09-21 18:32:54,167 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:32:54,167 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2018-09-21 18:32:54,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:32:54,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:32:54,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:32:54,611 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-21 18:32:54,611 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:32:54,626 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:32:54,627 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-21 18:32:54,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-21 18:32:54,627 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-21 18:32:54,627 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-21 18:32:54,628 INFO L87 Difference]: Start difference. First operand 540 states and 593 transitions. Second operand 3 states. [2018-09-21 18:32:55,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:32:55,120 INFO L93 Difference]: Finished difference Result 807 states and 885 transitions. [2018-09-21 18:32:55,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-21 18:32:55,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2018-09-21 18:32:55,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:32:55,125 INFO L225 Difference]: With dead ends: 807 [2018-09-21 18:32:55,125 INFO L226 Difference]: Without dead ends: 807 [2018-09-21 18:32:55,125 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-21 18:32:55,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2018-09-21 18:32:55,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 697. [2018-09-21 18:32:55,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2018-09-21 18:32:55,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 759 transitions. [2018-09-21 18:32:55,139 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 759 transitions. Word has length 139 [2018-09-21 18:32:55,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:32:55,139 INFO L480 AbstractCegarLoop]: Abstraction has 697 states and 759 transitions. [2018-09-21 18:32:55,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-21 18:32:55,140 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 759 transitions. [2018-09-21 18:32:55,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-09-21 18:32:55,144 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:32:55,145 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:32:55,145 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:32:55,147 INFO L82 PathProgramCache]: Analyzing trace with hash -595311189, now seen corresponding path program 1 times [2018-09-21 18:32:55,148 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:32:55,148 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2018-09-21 18:32:55,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:32:55,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:32:55,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:32:55,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:32:55,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:32:55,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:32:55,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:32:55,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:32:55,575 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-09-21 18:32:55,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:32:55,612 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:32:55,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:32:55,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:32:55,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:32:55,642 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:13 [2018-09-21 18:32:56,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:32:56,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:32:56,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:32:56,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:32:56,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:32:56,414 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:32:56,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:32:56,495 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:32:56,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:32:56,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:32:56,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:32:56,503 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:32:56,908 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-21 18:32:56,908 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:32:56,920 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:32:56,920 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-09-21 18:32:56,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-21 18:32:56,921 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-21 18:32:56,921 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2018-09-21 18:32:56,922 INFO L87 Difference]: Start difference. First operand 697 states and 759 transitions. Second operand 21 states. [2018-09-21 18:32:57,292 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-09-21 18:32:58,695 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-09-21 18:33:02,126 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 33 [2018-09-21 18:33:08,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:33:08,638 INFO L93 Difference]: Finished difference Result 718 states and 781 transitions. [2018-09-21 18:33:08,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-21 18:33:08,639 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 139 [2018-09-21 18:33:08,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:33:08,642 INFO L225 Difference]: With dead ends: 718 [2018-09-21 18:33:08,643 INFO L226 Difference]: Without dead ends: 718 [2018-09-21 18:33:08,643 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=136, Invalid=1124, Unknown=0, NotChecked=0, Total=1260 [2018-09-21 18:33:08,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2018-09-21 18:33:08,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 705. [2018-09-21 18:33:08,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2018-09-21 18:33:08,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 768 transitions. [2018-09-21 18:33:08,682 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 768 transitions. Word has length 139 [2018-09-21 18:33:08,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:33:08,683 INFO L480 AbstractCegarLoop]: Abstraction has 705 states and 768 transitions. [2018-09-21 18:33:08,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-21 18:33:08,683 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 768 transitions. [2018-09-21 18:33:08,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-09-21 18:33:08,685 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:33:08,686 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:33:08,686 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:33:08,688 INFO L82 PathProgramCache]: Analyzing trace with hash -24059956, now seen corresponding path program 1 times [2018-09-21 18:33:08,689 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:33:08,689 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 26 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-21 18:33:08,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 26 with mathsat -unsat_core_generation=3 [2018-09-21 18:33:08,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:33:09,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:33:09,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:33:09,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:33:09,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:33:09,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:09,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:09,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:33:09,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:33:09,066 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:33:09,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:33:09,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:09,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:09,073 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:33:09,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:33:09,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:33:09,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:33:09,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:09,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:09,549 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:33:09,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:33:09,620 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:33:09,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:33:09,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:09,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:09,628 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:33:10,090 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-09-21 18:33:10,091 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:33:10,105 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:33:10,105 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-09-21 18:33:10,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-21 18:33:10,106 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-21 18:33:10,106 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-09-21 18:33:10,106 INFO L87 Difference]: Start difference. First operand 705 states and 768 transitions. Second operand 19 states. [2018-09-21 18:33:11,661 WARN L178 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-09-21 18:33:12,088 WARN L178 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-09-21 18:33:12,331 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 21 [2018-09-21 18:33:17,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:33:17,385 INFO L93 Difference]: Finished difference Result 718 states and 778 transitions. [2018-09-21 18:33:17,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-21 18:33:17,392 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 139 [2018-09-21 18:33:17,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:33:17,396 INFO L225 Difference]: With dead ends: 718 [2018-09-21 18:33:17,396 INFO L226 Difference]: Without dead ends: 713 [2018-09-21 18:33:17,397 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=154, Invalid=1328, Unknown=0, NotChecked=0, Total=1482 [2018-09-21 18:33:17,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2018-09-21 18:33:17,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 697. [2018-09-21 18:33:17,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2018-09-21 18:33:17,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 757 transitions. [2018-09-21 18:33:17,413 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 757 transitions. Word has length 139 [2018-09-21 18:33:17,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:33:17,413 INFO L480 AbstractCegarLoop]: Abstraction has 697 states and 757 transitions. [2018-09-21 18:33:17,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-21 18:33:17,413 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 757 transitions. [2018-09-21 18:33:17,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-21 18:33:17,418 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:33:17,418 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:33:17,419 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:33:17,419 INFO L82 PathProgramCache]: Analyzing trace with hash -169615923, now seen corresponding path program 1 times [2018-09-21 18:33:17,419 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:33:17,419 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 27 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-21 18:33:17,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 27 with mathsat -unsat_core_generation=3 [2018-09-21 18:33:17,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:33:17,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:33:17,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:33:17,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:33:17,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:33:17,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:17,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:17,759 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:33:17,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:33:17,782 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:33:17,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:33:17,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:17,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:17,789 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:33:18,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:33:18,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:33:18,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:33:18,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:18,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:18,626 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:33:18,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:33:18,725 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:33:18,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:33:18,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:18,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:18,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:33:19,181 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-21 18:33:19,181 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:33:19,193 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:33:19,194 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-09-21 18:33:19,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-21 18:33:19,194 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-21 18:33:19,195 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-09-21 18:33:19,195 INFO L87 Difference]: Start difference. First operand 697 states and 757 transitions. Second operand 19 states. [2018-09-21 18:33:20,925 WARN L178 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2018-09-21 18:33:21,726 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2018-09-21 18:33:35,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:33:35,448 INFO L93 Difference]: Finished difference Result 750 states and 814 transitions. [2018-09-21 18:33:35,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-21 18:33:35,450 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 140 [2018-09-21 18:33:35,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:33:35,453 INFO L225 Difference]: With dead ends: 750 [2018-09-21 18:33:35,454 INFO L226 Difference]: Without dead ends: 750 [2018-09-21 18:33:35,454 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=161, Invalid=1171, Unknown=0, NotChecked=0, Total=1332 [2018-09-21 18:33:35,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2018-09-21 18:33:35,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 708. [2018-09-21 18:33:35,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2018-09-21 18:33:35,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 771 transitions. [2018-09-21 18:33:35,465 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 771 transitions. Word has length 140 [2018-09-21 18:33:35,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:33:35,465 INFO L480 AbstractCegarLoop]: Abstraction has 708 states and 771 transitions. [2018-09-21 18:33:35,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-21 18:33:35,466 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 771 transitions. [2018-09-21 18:33:35,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-09-21 18:33:35,471 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:33:35,471 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:33:35,471 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:33:35,472 INFO L82 PathProgramCache]: Analyzing trace with hash -723196136, now seen corresponding path program 1 times [2018-09-21 18:33:35,472 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:33:35,472 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 28 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with mathsat -unsat_core_generation=3 [2018-09-21 18:33:35,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:33:35,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:33:35,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:33:35,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:33:35,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:33:35,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:33:35,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:35,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:35,894 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:33:35,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:33:35,916 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:33:35,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:33:35,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:35,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:35,923 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:33:36,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:33:36,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:33:36,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:33:36,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:36,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:36,466 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:33:36,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:33:36,547 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:33:36,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:33:36,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:36,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:36,555 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:33:36,920 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-21 18:33:36,920 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:33:36,934 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:33:36,934 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-09-21 18:33:36,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-21 18:33:36,934 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-21 18:33:36,935 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2018-09-21 18:33:36,935 INFO L87 Difference]: Start difference. First operand 708 states and 771 transitions. Second operand 19 states. [2018-09-21 18:33:57,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:33:57,455 INFO L93 Difference]: Finished difference Result 832 states and 907 transitions. [2018-09-21 18:33:57,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-21 18:33:57,456 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 152 [2018-09-21 18:33:57,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:33:57,460 INFO L225 Difference]: With dead ends: 832 [2018-09-21 18:33:57,460 INFO L226 Difference]: Without dead ends: 821 [2018-09-21 18:33:57,461 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=156, Invalid=1176, Unknown=0, NotChecked=0, Total=1332 [2018-09-21 18:33:57,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2018-09-21 18:33:57,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 794. [2018-09-21 18:33:57,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2018-09-21 18:33:57,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 859 transitions. [2018-09-21 18:33:57,473 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 859 transitions. Word has length 152 [2018-09-21 18:33:57,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:33:57,473 INFO L480 AbstractCegarLoop]: Abstraction has 794 states and 859 transitions. [2018-09-21 18:33:57,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-21 18:33:57,474 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 859 transitions. [2018-09-21 18:33:57,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-21 18:33:57,475 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:33:57,478 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:33:57,479 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:33:57,479 INFO L82 PathProgramCache]: Analyzing trace with hash 221113355, now seen corresponding path program 1 times [2018-09-21 18:33:57,479 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:33:57,480 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 29 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with mathsat -unsat_core_generation=3 [2018-09-21 18:33:57,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:33:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:33:57,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:33:57,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:33:57,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:33:57,946 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:33:57,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:57,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:57,961 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:33:57,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:33:57,981 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:33:57,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:33:57,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:57,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:57,988 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:33:58,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:33:58,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:33:58,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:33:58,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:58,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:58,324 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:33:58,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:33:58,392 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:33:58,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:33:58,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:58,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:33:58,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:33:58,737 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-21 18:33:58,737 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:33:58,752 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:33:58,752 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-09-21 18:33:58,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-21 18:33:58,752 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-21 18:33:58,753 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-09-21 18:33:58,753 INFO L87 Difference]: Start difference. First operand 794 states and 859 transitions. Second operand 17 states. [2018-09-21 18:34:12,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:34:12,272 INFO L93 Difference]: Finished difference Result 957 states and 1025 transitions. [2018-09-21 18:34:12,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-21 18:34:12,274 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 140 [2018-09-21 18:34:12,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:34:12,277 INFO L225 Difference]: With dead ends: 957 [2018-09-21 18:34:12,277 INFO L226 Difference]: Without dead ends: 957 [2018-09-21 18:34:12,278 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=149, Invalid=1111, Unknown=0, NotChecked=0, Total=1260 [2018-09-21 18:34:12,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2018-09-21 18:34:12,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 794. [2018-09-21 18:34:12,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2018-09-21 18:34:12,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 858 transitions. [2018-09-21 18:34:12,290 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 858 transitions. Word has length 140 [2018-09-21 18:34:12,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:34:12,291 INFO L480 AbstractCegarLoop]: Abstraction has 794 states and 858 transitions. [2018-09-21 18:34:12,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-21 18:34:12,291 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 858 transitions. [2018-09-21 18:34:12,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-09-21 18:34:12,293 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:34:12,293 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 18:34:12,293 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:34:12,293 INFO L82 PathProgramCache]: Analyzing trace with hash 2124572282, now seen corresponding path program 1 times [2018-09-21 18:34:12,294 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:34:12,294 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 30 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with mathsat -unsat_core_generation=3 [2018-09-21 18:34:12,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:34:12,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:34:12,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:34:12,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:34:12,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:34:12,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:34:12,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:12,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:12,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:34:12,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:34:12,826 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:34:12,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:34:12,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:12,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:12,834 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:34:13,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-21 18:34:13,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-21 18:34:13,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:34:13,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:13,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:13,046 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-21 18:34:13,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-21 18:34:13,085 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-21 18:34:13,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:34:13,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:13,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:13,094 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-21 18:34:13,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-09-21 18:34:13,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-09-21 18:34:13,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:34:13,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:13,183 INFO L267 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. [2018-09-21 18:34:13,184 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-09-21 18:34:13,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-09-21 18:34:13,279 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-09-21 18:34:13,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:34:13,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:34:13,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-09-21 18:34:13,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:25 [2018-09-21 18:34:26,512 WARN L178 SmtUtils]: Spent 494.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-09-21 18:34:42,342 WARN L178 SmtUtils]: Spent 926.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-09-21 18:35:02,968 WARN L178 SmtUtils]: Spent 536.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-09-21 18:35:29,332 WARN L178 SmtUtils]: Spent 592.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-09-21 18:35:35,685 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-21 18:35:35,685 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:35:35,698 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:35:35,698 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-09-21 18:35:35,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-21 18:35:35,699 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-21 18:35:35,699 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=451, Unknown=12, NotChecked=0, Total=506 [2018-09-21 18:35:35,700 INFO L87 Difference]: Start difference. First operand 794 states and 858 transitions. Second operand 23 states. [2018-09-21 18:38:00,701 WARN L178 SmtUtils]: Spent 2.21 s on a formula simplification that was a NOOP. DAG size: 42 [2018-09-21 18:38:10,967 FATAL L265 ToolchainWalker]: 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:138) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:102) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.pop(ManagedScript.java:130) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:254) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:269) 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:690) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:603) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:313) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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: Stream closed at java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:433) at java.io.OutputStream.write(OutputStream.java:116) 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) ... 28 more [2018-09-21 18:38:10,979 INFO L168 Benchmark]: Toolchain (without parser) took 623562.27 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 229.1 MB). Free memory was 951.9 MB in the beginning and 918.0 MB in the end (delta: 33.9 MB). Peak memory consumption was 263.0 MB. Max. memory is 11.5 GB. [2018-09-21 18:38:10,979 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-09-21 18:38:10,979 INFO L168 Benchmark]: CACSL2BoogieTranslator took 801.06 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 919.6 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2018-09-21 18:38:10,980 INFO L168 Benchmark]: Boogie Preprocessor took 129.67 ms. Allocated memory is still 1.0 GB. Free memory was 919.6 MB in the beginning and 914.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-09-21 18:38:10,980 INFO L168 Benchmark]: RCFGBuilder took 29193.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 914.3 MB in the beginning and 997.2 MB in the end (delta: -82.9 MB). Peak memory consumption was 75.0 MB. Max. memory is 11.5 GB. [2018-09-21 18:38:10,980 INFO L168 Benchmark]: TraceAbstraction took 593431.97 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 86.5 MB). Free memory was 997.2 MB in the beginning and 918.0 MB in the end (delta: 79.2 MB). Peak memory consumption was 165.7 MB. Max. memory is 11.5 GB. [2018-09-21 18:38:10,986 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 801.06 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 919.6 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 129.67 ms. Allocated memory is still 1.0 GB. Free memory was 919.6 MB in the beginning and 914.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 29193.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 914.3 MB in the beginning and 997.2 MB in the end (delta: -82.9 MB). Peak memory consumption was 75.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 593431.97 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 86.5 MB). Free memory was 997.2 MB in the beginning and 918.0 MB in the end (delta: 79.2 MB). Peak memory consumption was 165.7 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...