/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/Ultimate.py --spec ../../../trunk/examples/svcomp/ReachSafety.prp --file ../../../trunk/examples/svcomp/float-newlib/double_req_bl_0871_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/double_req_bl_0871_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 fe2d748559a9999b6482961dcccbe11989db4f71 --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/double_req_bl_0871_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 fe2d748559a9999b6482961dcccbe11989db4f71 --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: AssertionError: var is still there: v_arrayElimCell_36 term size 36 --- Real Ultimate output --- This is Ultimate 0.1.23-5eb3fea [2018-09-21 17:55:55,289 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-21 17:55:55,291 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-21 17:55:55,304 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-21 17:55:55,304 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-21 17:55:55,306 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-21 17:55:55,307 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-21 17:55:55,310 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-21 17:55:55,312 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-21 17:55:55,313 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-21 17:55:55,314 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-21 17:55:55,314 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-21 17:55:55,315 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-21 17:55:55,317 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-21 17:55:55,318 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-21 17:55:55,319 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-21 17:55:55,320 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-21 17:55:55,322 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-21 17:55:55,325 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-21 17:55:55,327 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-21 17:55:55,328 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-21 17:55:55,330 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-21 17:55:55,333 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-21 17:55:55,333 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-21 17:55:55,333 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-21 17:55:55,335 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-21 17:55:55,336 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-21 17:55:55,337 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-21 17:55:55,338 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-21 17:55:55,340 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-21 17:55:55,340 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-21 17:55:55,341 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-21 17:55:55,341 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-21 17:55:55,342 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-21 17:55:55,343 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-21 17:55:55,344 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-21 17:55:55,345 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-21 17:55:55,370 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-21 17:55:55,370 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-21 17:55:55,371 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-21 17:55:55,371 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-21 17:55:55,373 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-21 17:55:55,373 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-21 17:55:55,373 INFO L133 SettingsManager]: * Use SBE=true [2018-09-21 17:55:55,373 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-21 17:55:55,374 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-21 17:55:55,374 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-21 17:55:55,374 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-21 17:55:55,375 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-21 17:55:55,375 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-21 17:55:55,375 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-21 17:55:55,375 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-21 17:55:55,376 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-21 17:55:55,376 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-21 17:55:55,376 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-21 17:55:55,377 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-21 17:55:55,378 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-21 17:55:55,378 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-21 17:55:55,378 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-21 17:55:55,378 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-21 17:55:55,379 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-21 17:55:55,379 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-21 17:55:55,379 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-21 17:55:55,379 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-21 17:55:55,380 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-21 17:55:55,380 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-21 17:55:55,380 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 -> fe2d748559a9999b6482961dcccbe11989db4f71 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 17:55:55,447 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-21 17:55:55,460 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-21 17:55:55,464 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-21 17:55:55,466 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-21 17:55:55,466 INFO L276 PluginConnector]: CDTParser initialized [2018-09-21 17:55:55,467 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_0871_true-unreach-call.c [2018-09-21 17:55:55,828 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/debfb74db/37c8aa3d724f4025b4d4042b129c9cc6/FLAG8c52ad11a [2018-09-21 17:55:56,074 INFO L277 CDTParser]: Found 1 translation units. [2018-09-21 17:55:56,074 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_0871_true-unreach-call.c [2018-09-21 17:55:56,090 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/debfb74db/37c8aa3d724f4025b4d4042b129c9cc6/FLAG8c52ad11a [2018-09-21 17:55:56,110 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/debfb74db/37c8aa3d724f4025b4d4042b129c9cc6 [2018-09-21 17:55:56,113 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-21 17:55:56,117 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-21 17:55:56,118 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-21 17:55:56,118 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-21 17:55:56,126 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-21 17:55:56,127 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 05:55:56" (1/1) ... [2018-09-21 17:55:56,130 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60d30799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 05:55:56, skipping insertion in model container [2018-09-21 17:55:56,130 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 05:55:56" (1/1) ... [2018-09-21 17:55:56,144 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-21 17:55:56,542 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$37(StandardFunctionHandler.java:260) 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 17:55:56,561 INFO L168 Benchmark]: Toolchain (without parser) took 446.49 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 935.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-09-21 17:55:56,566 INFO L168 Benchmark]: CDTParser took 0.25 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 17:55:56,567 INFO L168 Benchmark]: CACSL2BoogieTranslator took 441.42 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 935.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-09-21 17:55:56,571 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.25 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 441.42 ms. Allocated memory is still 1.0 GB. Free memory was 951.9 MB in the beginning and 935.7 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 17:55:58,834 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-21 17:55:58,836 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-21 17:55:58,859 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-21 17:55:58,859 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-21 17:55:58,860 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-21 17:55:58,865 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-21 17:55:58,868 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-21 17:55:58,871 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-21 17:55:58,877 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-21 17:55:58,880 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-21 17:55:58,881 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-21 17:55:58,882 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-21 17:55:58,885 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-21 17:55:58,891 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-21 17:55:58,894 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-21 17:55:58,895 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-21 17:55:58,896 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-21 17:55:58,904 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-21 17:55:58,908 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-21 17:55:58,909 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-21 17:55:58,911 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-21 17:55:58,915 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-21 17:55:58,918 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-21 17:55:58,918 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-21 17:55:58,919 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-21 17:55:58,920 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-21 17:55:58,921 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-21 17:55:58,922 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-21 17:55:58,923 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-21 17:55:58,923 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-21 17:55:58,924 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-21 17:55:58,924 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-21 17:55:58,924 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-21 17:55:58,925 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-21 17:55:58,926 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-21 17:55:58,926 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-21 17:55:58,942 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-21 17:55:58,942 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-21 17:55:58,943 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-21 17:55:58,943 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-21 17:55:58,944 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-21 17:55:58,944 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-21 17:55:58,944 INFO L133 SettingsManager]: * Use SBE=true [2018-09-21 17:55:58,945 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-21 17:55:58,945 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-21 17:55:58,945 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-21 17:55:58,945 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-21 17:55:58,945 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-21 17:55:58,945 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-21 17:55:58,946 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-21 17:55:58,946 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-21 17:55:58,946 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-21 17:55:58,946 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-21 17:55:58,946 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-21 17:55:58,946 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-21 17:55:58,947 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-21 17:55:58,947 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-21 17:55:58,947 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-21 17:55:58,947 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-21 17:55:58,947 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-21 17:55:58,948 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-21 17:55:58,948 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-21 17:55:58,948 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-21 17:55:58,948 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-21 17:55:58,948 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-21 17:55:58,948 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-21 17:55:58,949 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-21 17:55:58,949 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 -> fe2d748559a9999b6482961dcccbe11989db4f71 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 17:55:59,001 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-21 17:55:59,014 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-21 17:55:59,018 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-21 17:55:59,020 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-21 17:55:59,020 INFO L276 PluginConnector]: CDTParser initialized [2018-09-21 17:55:59,021 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_0871_true-unreach-call.c [2018-09-21 17:55:59,361 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e436d0a86/ecdf69058f464ab1a7fc72ef584e2946/FLAG3eb21103d [2018-09-21 17:55:59,618 INFO L277 CDTParser]: Found 1 translation units. [2018-09-21 17:55:59,619 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_0871_true-unreach-call.c [2018-09-21 17:55:59,636 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e436d0a86/ecdf69058f464ab1a7fc72ef584e2946/FLAG3eb21103d [2018-09-21 17:55:59,658 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e436d0a86/ecdf69058f464ab1a7fc72ef584e2946 [2018-09-21 17:55:59,662 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-21 17:55:59,665 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-21 17:55:59,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-21 17:55:59,666 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-21 17:55:59,673 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-21 17:55:59,674 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 05:55:59" (1/1) ... [2018-09-21 17:55:59,677 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b836825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 05:55:59, skipping insertion in model container [2018-09-21 17:55:59,677 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 05:55:59" (1/1) ... [2018-09-21 17:55:59,690 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-21 17:56:00,216 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-21 17:56:00,244 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-21 17:56:00,405 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-21 17:56:00,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 05:56:00 WrapperNode [2018-09-21 17:56:00,474 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-21 17:56:00,475 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-21 17:56:00,476 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-21 17:56:00,476 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-21 17:56:00,493 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 05:56:00" (1/1) ... [2018-09-21 17:56:00,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 05:56:00" (1/1) ... [2018-09-21 17:56:00,523 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 05:56:00" (1/1) ... [2018-09-21 17:56:00,524 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 05:56:00" (1/1) ... [2018-09-21 17:56:00,573 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 05:56:00" (1/1) ... [2018-09-21 17:56:00,703 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 05:56:00" (1/1) ... [2018-09-21 17:56:00,720 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 05:56:00" (1/1) ... [2018-09-21 17:56:00,740 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-21 17:56:00,741 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-21 17:56:00,741 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-21 17:56:00,741 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-21 17:56:00,747 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 05:56:00" (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 17:56:00,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-21 17:56:00,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-21 17:56:00,848 INFO L138 BoogieDeclarations]: Found implementation of procedure copysign_double [2018-09-21 17:56:00,848 INFO L138 BoogieDeclarations]: Found implementation of procedure scalbn_double [2018-09-21 17:56:00,848 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrt [2018-09-21 17:56:00,848 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_double [2018-09-21 17:56:00,849 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_pow [2018-09-21 17:56:00,849 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-21 17:56:00,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-21 17:56:00,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_double [2018-09-21 17:56:00,850 INFO L130 BoogieDeclarations]: Found specification of procedure copysign_double [2018-09-21 17:56:00,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-21 17:56:00,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-09-21 17:56:00,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-21 17:56:00,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-21 17:56:00,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-21 17:56:00,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-09-21 17:56:00,852 INFO L130 BoogieDeclarations]: Found specification of procedure scalbn_double [2018-09-21 17:56:00,852 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrt [2018-09-21 17:56:00,852 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_double [2018-09-21 17:56:00,853 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_pow [2018-09-21 17:56:00,854 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-21 17:56:00,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-21 17:56:00,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-21 17:56:00,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-21 17:56:00,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8 [2018-09-21 17:56:01,243 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:56:01,824 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:56:01,855 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:56:02,358 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:56:02,370 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:56:03,239 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:56:04,556 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:56:04,720 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:56:04,764 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:56:04,799 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:56:04,826 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:56:04,856 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:56:04,955 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:56:07,453 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:56:07,493 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:56:10,194 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:56:12,399 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:56:14,644 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:56:16,783 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:56:18,993 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:56:19,024 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:56:19,057 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:56:19,086 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:56:19,108 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:56:20,540 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:56:26,422 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:56:26,474 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:56:26,555 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:56:26,630 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:56:26,975 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:56:30,107 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:56:30,153 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:56:30,492 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:56:45,065 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:56:45,860 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:56:45,869 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:56:49,941 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:56:49,954 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:56:49,989 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:56:50,092 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:56:50,102 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:56:50,145 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-21 17:56:51,656 INFO L373 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-21 17:56:51,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 05:56:51 BoogieIcfgContainer [2018-09-21 17:56:51,657 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-21 17:56:51,658 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-21 17:56:51,658 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-21 17:56:51,662 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-21 17:56:51,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 05:55:59" (1/3) ... [2018-09-21 17:56:51,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b545dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 05:56:51, skipping insertion in model container [2018-09-21 17:56:51,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 05:56:00" (2/3) ... [2018-09-21 17:56:51,664 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b545dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 05:56:51, skipping insertion in model container [2018-09-21 17:56:51,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 05:56:51" (3/3) ... [2018-09-21 17:56:51,667 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0871_true-unreach-call.c [2018-09-21 17:56:51,678 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-21 17:56:51,688 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-21 17:56:51,736 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-21 17:56:51,737 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-21 17:56:51,737 INFO L382 AbstractCegarLoop]: Hoare is false [2018-09-21 17:56:51,737 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-21 17:56:51,737 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-21 17:56:51,737 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-21 17:56:51,738 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-21 17:56:51,738 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-21 17:56:51,738 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-21 17:56:51,771 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states. [2018-09-21 17:56:51,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-21 17:56:51,784 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 17:56:51,785 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-21 17:56:51,788 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 17:56:51,794 INFO L82 PathProgramCache]: Analyzing trace with hash 425131288, now seen corresponding path program 1 times [2018-09-21 17:56:51,800 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 17:56:51,800 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 17:56:51,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 17:56:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 17:56:52,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 17:56:52,037 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 17:56:52,037 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 17:56:52,052 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 17:56:52,052 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-21 17:56:52,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-21 17:56:52,069 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-21 17:56:52,069 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-21 17:56:52,072 INFO L87 Difference]: Start difference. First operand 494 states. Second operand 2 states. [2018-09-21 17:56:52,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 17:56:52,131 INFO L93 Difference]: Finished difference Result 494 states and 574 transitions. [2018-09-21 17:56:52,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-21 17:56:52,133 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-09-21 17:56:52,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 17:56:52,154 INFO L225 Difference]: With dead ends: 494 [2018-09-21 17:56:52,154 INFO L226 Difference]: Without dead ends: 490 [2018-09-21 17:56:52,156 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 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 17:56:52,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2018-09-21 17:56:52,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2018-09-21 17:56:52,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2018-09-21 17:56:52,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 570 transitions. [2018-09-21 17:56:52,243 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 570 transitions. Word has length 17 [2018-09-21 17:56:52,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 17:56:52,244 INFO L480 AbstractCegarLoop]: Abstraction has 490 states and 570 transitions. [2018-09-21 17:56:52,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-21 17:56:52,244 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 570 transitions. [2018-09-21 17:56:52,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-21 17:56:52,246 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 17:56:52,246 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] [2018-09-21 17:56:52,247 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 17:56:52,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1962425380, now seen corresponding path program 1 times [2018-09-21 17:56:52,248 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 17:56:52,249 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) [2018-09-21 17:56:52,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-21 17:56:52,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 17:56:52,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 17:56:52,658 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 17:56:52,658 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 17:56:52,673 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 17:56:52,674 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-21 17:56:52,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-21 17:56:52,676 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-21 17:56:52,676 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-09-21 17:56:52,676 INFO L87 Difference]: Start difference. First operand 490 states and 570 transitions. Second operand 6 states. [2018-09-21 17:57:32,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 17:57:32,968 INFO L93 Difference]: Finished difference Result 567 states and 658 transitions. [2018-09-21 17:57:33,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-21 17:57:33,065 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-09-21 17:57:33,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 17:57:33,074 INFO L225 Difference]: With dead ends: 567 [2018-09-21 17:57:33,074 INFO L226 Difference]: Without dead ends: 563 [2018-09-21 17:57:33,075 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-09-21 17:57:33,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2018-09-21 17:57:33,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 490. [2018-09-21 17:57:33,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2018-09-21 17:57:33,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 567 transitions. [2018-09-21 17:57:33,113 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 567 transitions. Word has length 43 [2018-09-21 17:57:33,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 17:57:33,114 INFO L480 AbstractCegarLoop]: Abstraction has 490 states and 567 transitions. [2018-09-21 17:57:33,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-21 17:57:33,114 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 567 transitions. [2018-09-21 17:57:33,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-21 17:57:33,116 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 17:57:33,116 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 17:57:33,117 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 17:57:33,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1580647785, now seen corresponding path program 1 times [2018-09-21 17:57:33,118 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 17:57:33,118 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 17:57:33,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 17:57:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 17:57:33,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 17:57:33,474 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 17:57:33,477 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 17:57:33,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 27 treesize of output 35 [2018-09-21 17:57:33,495 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 17:57:33,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-21 17:57:33,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 17:57:33,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 17:57:33,565 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 17:57:33,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-09-21 17:57:33,775 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 17:57:33,776 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 17:57:33,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 54 treesize of output 56 [2018-09-21 17:57:33,821 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 17:57:33,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-09-21 17:57:33,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 17:57:33,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 17:57:34,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-21 17:57:34,046 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:55 [2018-09-21 17:57:34,144 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 35 treesize of output 27 [2018-09-21 17:57:34,159 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 17:57:34,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2018-09-21 17:57:34,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 17:57:34,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 17:57:34,208 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 17:57:34,209 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-09-21 17:57:34,803 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 17:57:34,804 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 17:57:34,821 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 17:57:34,822 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-09-21 17:57:34,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-21 17:57:34,823 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-21 17:57:34,823 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-09-21 17:57:34,823 INFO L87 Difference]: Start difference. First operand 490 states and 567 transitions. Second operand 11 states. [2018-09-21 17:57:36,079 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-09-21 17:57:49,343 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-09-21 17:57:59,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 17:57:59,873 INFO L93 Difference]: Finished difference Result 591 states and 677 transitions. [2018-09-21 17:57:59,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-21 17:57:59,874 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2018-09-21 17:57:59,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 17:57:59,877 INFO L225 Difference]: With dead ends: 591 [2018-09-21 17:57:59,877 INFO L226 Difference]: Without dead ends: 385 [2018-09-21 17:57:59,878 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2018-09-21 17:57:59,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-09-21 17:57:59,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 383. [2018-09-21 17:57:59,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-09-21 17:57:59,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 442 transitions. [2018-09-21 17:57:59,892 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 442 transitions. Word has length 45 [2018-09-21 17:57:59,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 17:57:59,892 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 442 transitions. [2018-09-21 17:57:59,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-21 17:57:59,892 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 442 transitions. [2018-09-21 17:57:59,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-09-21 17:57:59,895 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 17:57:59,895 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, 1, 1, 1, 1] [2018-09-21 17:57:59,895 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 17:57:59,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1131981993, now seen corresponding path program 1 times [2018-09-21 17:57:59,897 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 17:57:59,897 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 17:57:59,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 17:58:00,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 17:58:00,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 17:58:03,619 WARN L797 $PredicateComparison]: unable to prove that (and (= c_~one_pow~0 ((_ to_fp 11 53) RNE 1.0)) (= |c___ieee754_pow_#res| (fp.div RNE c_~one_pow~0 |c___ieee754_pow_#in~x|))) is different from false [2018-09-21 17:58:03,669 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 17:58:03,669 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 17:58:03,699 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 17:58:03,700 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-21 17:58:03,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-21 17:58:03,700 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-21 17:58:03,700 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=30, Unknown=1, NotChecked=10, Total=56 [2018-09-21 17:58:03,702 INFO L87 Difference]: Start difference. First operand 383 states and 442 transitions. Second operand 8 states. [2018-09-21 17:58:20,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 17:58:20,994 INFO L93 Difference]: Finished difference Result 393 states and 454 transitions. [2018-09-21 17:58:21,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-21 17:58:21,976 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-09-21 17:58:21,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 17:58:21,979 INFO L225 Difference]: With dead ends: 393 [2018-09-21 17:58:21,979 INFO L226 Difference]: Without dead ends: 389 [2018-09-21 17:58:21,980 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=15, Invalid=30, Unknown=1, NotChecked=10, Total=56 [2018-09-21 17:58:21,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-09-21 17:58:21,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 383. [2018-09-21 17:58:21,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-09-21 17:58:21,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 441 transitions. [2018-09-21 17:58:21,992 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 441 transitions. Word has length 49 [2018-09-21 17:58:21,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 17:58:21,993 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 441 transitions. [2018-09-21 17:58:21,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-21 17:58:21,993 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 441 transitions. [2018-09-21 17:58:21,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-09-21 17:58:21,996 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 17:58:21,996 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, 1, 1, 1, 1] [2018-09-21 17:58:21,996 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 17:58:21,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1103352842, now seen corresponding path program 1 times [2018-09-21 17:58:21,997 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 17:58:21,998 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 17:58:22,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 17:58:22,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 17:58:22,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 17:58:22,368 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 17:58:22,368 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 17:58:22,380 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 17:58:22,380 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-21 17:58:22,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-21 17:58:22,381 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-21 17:58:22,381 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-21 17:58:22,381 INFO L87 Difference]: Start difference. First operand 383 states and 441 transitions. Second operand 7 states. [2018-09-21 17:58:36,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 17:58:36,447 INFO L93 Difference]: Finished difference Result 389 states and 446 transitions. [2018-09-21 17:58:36,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-21 17:58:36,449 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-09-21 17:58:36,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 17:58:36,453 INFO L225 Difference]: With dead ends: 389 [2018-09-21 17:58:36,453 INFO L226 Difference]: Without dead ends: 384 [2018-09-21 17:58:36,454 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-09-21 17:58:36,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-09-21 17:58:36,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 382. [2018-09-21 17:58:36,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-09-21 17:58:36,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 439 transitions. [2018-09-21 17:58:36,469 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 439 transitions. Word has length 49 [2018-09-21 17:58:36,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 17:58:36,469 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 439 transitions. [2018-09-21 17:58:36,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-21 17:58:36,470 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 439 transitions. [2018-09-21 17:58:36,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-09-21 17:58:36,472 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 17:58:36,473 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, 1, 1, 1, 1] [2018-09-21 17:58:36,473 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 17:58:36,474 INFO L82 PathProgramCache]: Analyzing trace with hash -846285129, now seen corresponding path program 1 times [2018-09-21 17:58:36,474 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 17:58:36,474 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 17:58:36,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 17:58:36,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 17:58:36,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 17:58:43,558 WARN L178 SmtUtils]: Spent 781.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2018-09-21 17:58:47,555 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 17:58:47,556 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 17:58:47,570 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 17:58:47,570 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-09-21 17:58:47,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-21 17:58:47,571 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-21 17:58:47,571 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=30, Unknown=1, NotChecked=0, Total=42 [2018-09-21 17:58:47,571 INFO L87 Difference]: Start difference. First operand 382 states and 439 transitions. Second operand 7 states. [2018-09-21 17:59:39,540 WARN L178 SmtUtils]: Spent 3.61 s on a formula simplification that was a NOOP. DAG size: 8 [2018-09-21 18:03:10,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:03:10,120 INFO L93 Difference]: Finished difference Result 386 states and 442 transitions. [2018-09-21 18:03:10,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-21 18:03:10,178 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-09-21 18:03:10,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:03:10,181 INFO L225 Difference]: With dead ends: 386 [2018-09-21 18:03:10,181 INFO L226 Difference]: Without dead ends: 382 [2018-09-21 18:03:10,181 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=23, Invalid=65, Unknown=2, NotChecked=0, Total=90 [2018-09-21 18:03:10,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-09-21 18:03:10,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-09-21 18:03:10,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-09-21 18:03:10,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 438 transitions. [2018-09-21 18:03:10,195 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 438 transitions. Word has length 49 [2018-09-21 18:03:10,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:03:10,195 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 438 transitions. [2018-09-21 18:03:10,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-21 18:03:10,196 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 438 transitions. [2018-09-21 18:03:10,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-21 18:03:10,200 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:03:10,200 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, 1, 1, 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:03:10,200 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:03:10,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1666872400, now seen corresponding path program 1 times [2018-09-21 18:03:10,201 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:03:10,201 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:03:10,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:03:10,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:03:10,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:03:10,998 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 14 treesize of output 11 [2018-09-21 18:03:11,008 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 11 treesize of output 10 [2018-09-21 18:03:11,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:03:11,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:03:11,061 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:03:11,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-21 18:03:11,155 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 20 treesize of output 16 [2018-09-21 18:03:11,162 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 16 treesize of output 4 [2018-09-21 18:03:11,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:03:11,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:03:11,185 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:03:11,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-21 18:03:11,576 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:03:11,576 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:03:11,600 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:03:11,600 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-21 18:03:11,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-21 18:03:11,604 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-21 18:03:11,605 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-21 18:03:11,605 INFO L87 Difference]: Start difference. First operand 382 states and 438 transitions. Second operand 10 states. [2018-09-21 18:03:12,808 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-21 18:03:24,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:03:24,096 INFO L93 Difference]: Finished difference Result 398 states and 455 transitions. [2018-09-21 18:03:24,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-21 18:03:24,098 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 71 [2018-09-21 18:03:24,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:03:24,102 INFO L225 Difference]: With dead ends: 398 [2018-09-21 18:03:24,102 INFO L226 Difference]: Without dead ends: 393 [2018-09-21 18:03:24,103 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-09-21 18:03:24,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-09-21 18:03:24,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 382. [2018-09-21 18:03:24,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-09-21 18:03:24,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 437 transitions. [2018-09-21 18:03:24,115 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 437 transitions. Word has length 71 [2018-09-21 18:03:24,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:03:24,116 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 437 transitions. [2018-09-21 18:03:24,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-21 18:03:24,116 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 437 transitions. [2018-09-21 18:03:24,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-21 18:03:24,119 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:03:24,119 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, 1, 1, 1, 1, 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:03:24,119 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:03:24,120 INFO L82 PathProgramCache]: Analyzing trace with hash -83148140, now seen corresponding path program 1 times [2018-09-21 18:03:24,120 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:03:24,121 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:03:24,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:03:24,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:03:24,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:03:24,804 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 14 treesize of output 11 [2018-09-21 18:03:24,819 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 11 treesize of output 10 [2018-09-21 18:03:24,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:03:24,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:03:24,929 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:03:24,930 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-21 18:03:25,080 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 20 treesize of output 16 [2018-09-21 18:03:25,087 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 16 treesize of output 4 [2018-09-21 18:03:25,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:03:25,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:03:25,112 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:03:25,113 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-21 18:03:25,563 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:03:25,563 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:03:25,580 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:03:25,581 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-09-21 18:03:25,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-21 18:03:25,582 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-21 18:03:25,582 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-21 18:03:25,582 INFO L87 Difference]: Start difference. First operand 382 states and 437 transitions. Second operand 10 states. [2018-09-21 18:03:36,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:03:36,212 INFO L93 Difference]: Finished difference Result 447 states and 520 transitions. [2018-09-21 18:03:36,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-21 18:03:36,215 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2018-09-21 18:03:36,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:03:36,217 INFO L225 Difference]: With dead ends: 447 [2018-09-21 18:03:36,218 INFO L226 Difference]: Without dead ends: 384 [2018-09-21 18:03:36,218 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-09-21 18:03:36,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-09-21 18:03:36,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 380. [2018-09-21 18:03:36,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-09-21 18:03:36,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 431 transitions. [2018-09-21 18:03:36,233 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 431 transitions. Word has length 73 [2018-09-21 18:03:36,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:03:36,233 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 431 transitions. [2018-09-21 18:03:36,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-21 18:03:36,234 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 431 transitions. [2018-09-21 18:03:36,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-09-21 18:03:36,237 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:03:36,237 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:36,238 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:03:36,238 INFO L82 PathProgramCache]: Analyzing trace with hash -2105643434, now seen corresponding path program 1 times [2018-09-21 18:03:36,239 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:03:36,239 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) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-09-21 18:03:36,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:03:39,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:03:39,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:03:39,234 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 14 treesize of output 11 [2018-09-21 18:03:39,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 11 treesize of output 10 [2018-09-21 18:03:39,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:03:39,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:03:39,327 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:03:39,328 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-09-21 18:03:39,431 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 20 treesize of output 16 [2018-09-21 18:03:39,455 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 16 treesize of output 4 [2018-09-21 18:03:39,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:03:39,477 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:03:39,592 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:03:39,592 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:22 [2018-09-21 18:03:39,914 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 14 treesize of output 11 [2018-09-21 18:03:39,936 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 11 treesize of output 10 [2018-09-21 18:03:39,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:03:40,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:03:40,235 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:03:40,235 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-09-21 18:03:40,428 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 20 treesize of output 16 [2018-09-21 18:03:40,460 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 16 treesize of output 4 [2018-09-21 18:03:40,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:03:40,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:03:40,590 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:03:40,591 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:22 [2018-09-21 18:03:41,055 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:03:41,071 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:03:41,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 27 treesize of output 35 [2018-09-21 18:03:41,124 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:03:41,228 INFO L303 Elim1Store]: Index analysis took 151 ms [2018-09-21 18:03:41,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-21 18:03:41,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:03:41,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:03:41,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-21 18:03:41,372 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:46 [2018-09-21 18:03:41,564 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 35 treesize of output 28 [2018-09-21 18:03:41,582 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:03:41,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-09-21 18:03:41,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:03:41,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:03:41,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-21 18:03:41,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:44 [2018-09-21 18:03:41,968 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 66 treesize of output 50 [2018-09-21 18:03:41,986 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:03:41,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 34 [2018-09-21 18:03:42,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:03:42,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:03:42,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-21 18:03:42,086 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:89, output treesize:51 [2018-09-21 18:03:46,421 WARN L797 $PredicateComparison]: unable to prove that (and (= c_~one_pow~0 ((_ to_fp 11 53) RNE 1.0)) (exists ((|v_q#valueAsBitvector_49| (_ BitVec 64)) (|v_q#valueAsBitvector_48| (_ BitVec 64))) (and (= (fp.div RNE c_~one_pow~0 (let ((.cse0 (concat (bvand ((_ extract 63 32) |v_q#valueAsBitvector_48|) (_ bv2147483647 32)) ((_ extract 31 0) |v_q#valueAsBitvector_49|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0)))) c___ieee754_pow_~z~1) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_48|) ((_ extract 62 52) |v_q#valueAsBitvector_48|) ((_ extract 51 0) |v_q#valueAsBitvector_48|)) |c___ieee754_pow_#in~x|) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_49|) ((_ extract 62 52) |v_q#valueAsBitvector_49|) ((_ extract 51 0) |v_q#valueAsBitvector_49|)) |c___ieee754_pow_#in~x|)))) is different from false [2018-09-21 18:03:48,901 WARN L797 $PredicateComparison]: unable to prove that (and (= c_~one_pow~0 ((_ to_fp 11 53) RNE 1.0)) (exists ((|v_q#valueAsBitvector_49| (_ BitVec 64)) (|v_q#valueAsBitvector_48| (_ BitVec 64))) (and (= (fp.div RNE c_~one_pow~0 (let ((.cse0 (concat (bvand ((_ extract 63 32) |v_q#valueAsBitvector_48|) (_ bv2147483647 32)) ((_ extract 31 0) |v_q#valueAsBitvector_49|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0)))) |c___ieee754_pow_#res|) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_48|) ((_ extract 62 52) |v_q#valueAsBitvector_48|) ((_ extract 51 0) |v_q#valueAsBitvector_48|)) |c___ieee754_pow_#in~x|) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_49|) ((_ extract 62 52) |v_q#valueAsBitvector_49|) ((_ extract 51 0) |v_q#valueAsBitvector_49|)) |c___ieee754_pow_#in~x|)))) is different from false [2018-09-21 18:03:51,395 WARN L797 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_49| (_ BitVec 64)) (|v_q#valueAsBitvector_48| (_ BitVec 64))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (and (= |c_main_#t~ret78| (fp.div RNE .cse0 (let ((.cse1 (concat (bvand ((_ extract 63 32) |v_q#valueAsBitvector_48|) (_ bv2147483647 32)) ((_ extract 31 0) |v_q#valueAsBitvector_49|)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_48|) ((_ extract 62 52) |v_q#valueAsBitvector_48|) ((_ extract 51 0) |v_q#valueAsBitvector_48|)) .cse0) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_49|) ((_ extract 62 52) |v_q#valueAsBitvector_49|) ((_ extract 51 0) |v_q#valueAsBitvector_49|)) .cse0)))) is different from false [2018-09-21 18:03:53,784 WARN L819 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_49| (_ BitVec 64)) (|v_q#valueAsBitvector_48| (_ BitVec 64))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (and (= |c_main_#t~ret78| (fp.div RNE .cse0 (let ((.cse1 (concat (bvand ((_ extract 63 32) |v_q#valueAsBitvector_48|) (_ bv2147483647 32)) ((_ extract 31 0) |v_q#valueAsBitvector_49|)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_48|) ((_ extract 62 52) |v_q#valueAsBitvector_48|) ((_ extract 51 0) |v_q#valueAsBitvector_48|)) .cse0) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_49|) ((_ extract 62 52) |v_q#valueAsBitvector_49|) ((_ extract 51 0) |v_q#valueAsBitvector_49|)) .cse0)))) is different from true [2018-09-21 18:03:56,217 WARN L797 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_49| (_ BitVec 64)) (|v_q#valueAsBitvector_48| (_ BitVec 64))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_48|) ((_ extract 62 52) |v_q#valueAsBitvector_48|) ((_ extract 51 0) |v_q#valueAsBitvector_48|)) .cse0) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_49|) ((_ extract 62 52) |v_q#valueAsBitvector_49|) ((_ extract 51 0) |v_q#valueAsBitvector_49|)) .cse0) (= (fp.div RNE .cse0 (let ((.cse1 (concat (bvand ((_ extract 63 32) |v_q#valueAsBitvector_48|) (_ bv2147483647 32)) ((_ extract 31 0) |v_q#valueAsBitvector_49|)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1)))) c_main_~res~0)))) is different from false [2018-09-21 18:03:58,590 WARN L819 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_49| (_ BitVec 64)) (|v_q#valueAsBitvector_48| (_ BitVec 64))) (let ((.cse0 ((_ to_fp 11 53) RNE 1.0))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_48|) ((_ extract 62 52) |v_q#valueAsBitvector_48|) ((_ extract 51 0) |v_q#valueAsBitvector_48|)) .cse0) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_49|) ((_ extract 62 52) |v_q#valueAsBitvector_49|) ((_ extract 51 0) |v_q#valueAsBitvector_49|)) .cse0) (= (fp.div RNE .cse0 (let ((.cse1 (concat (bvand ((_ extract 63 32) |v_q#valueAsBitvector_48|) (_ bv2147483647 32)) ((_ extract 31 0) |v_q#valueAsBitvector_49|)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1)))) c_main_~res~0)))) is different from true [2018-09-21 18:04:03,038 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:04:03,039 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:04:03,064 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:04:03,065 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-09-21 18:04:03,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-21 18:04:03,066 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-21 18:04:03,068 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=288, Unknown=6, NotChecked=148, Total=506 [2018-09-21 18:04:03,068 INFO L87 Difference]: Start difference. First operand 380 states and 431 transitions. Second operand 23 states. [2018-09-21 18:04:37,641 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-09-21 18:04:40,287 WARN L178 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-09-21 18:04:40,846 WARN L178 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-09-21 18:04:42,177 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2018-09-21 18:04:42,829 WARN L178 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-09-21 18:04:43,526 WARN L178 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-09-21 18:04:44,100 WARN L178 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-09-21 18:04:45,334 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-09-21 18:04:46,601 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-09-21 18:05:42,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:05:42,891 INFO L93 Difference]: Finished difference Result 396 states and 449 transitions. [2018-09-21 18:05:42,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-21 18:05:42,893 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 79 [2018-09-21 18:05:42,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:05:42,897 INFO L225 Difference]: With dead ends: 396 [2018-09-21 18:05:42,897 INFO L226 Difference]: Without dead ends: 391 [2018-09-21 18:05:42,898 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=145, Invalid=857, Unknown=6, NotChecked=252, Total=1260 [2018-09-21 18:05:42,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-09-21 18:05:42,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 381. [2018-09-21 18:05:42,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-09-21 18:05:42,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 432 transitions. [2018-09-21 18:05:42,914 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 432 transitions. Word has length 79 [2018-09-21 18:05:42,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:05:42,915 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 432 transitions. [2018-09-21 18:05:42,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-21 18:05:42,915 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 432 transitions. [2018-09-21 18:05:42,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-09-21 18:05:42,916 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:05:42,916 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:42,919 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:05:42,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1379977236, now seen corresponding path program 1 times [2018-09-21 18:05:42,920 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:05:42,920 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:05:42,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:05:43,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:05:43,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:05:43,412 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 14 treesize of output 11 [2018-09-21 18:05:43,421 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 11 treesize of output 10 [2018-09-21 18:05:43,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:05:43,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:05:43,490 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:05:43,491 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-09-21 18:05:43,583 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 20 treesize of output 16 [2018-09-21 18:05:43,594 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 16 treesize of output 4 [2018-09-21 18:05:43,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:05:43,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:05:43,653 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:05:43,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:17 [2018-09-21 18:05:43,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 14 treesize of output 11 [2018-09-21 18:05:43,798 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 11 treesize of output 10 [2018-09-21 18:05:43,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:05:43,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:05:43,958 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:05:43,958 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-09-21 18:05:44,049 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 20 treesize of output 16 [2018-09-21 18:05:44,067 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 16 treesize of output 4 [2018-09-21 18:05:44,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:05:44,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:05:44,385 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:05:44,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:17 [2018-09-21 18:05:44,608 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:05:44,609 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:05:44,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 27 treesize of output 35 [2018-09-21 18:05:44,627 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:05:44,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-21 18:05:44,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:05:44,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:05:44,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-21 18:05:44,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:41 [2018-09-21 18:05:44,947 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 35 treesize of output 28 [2018-09-21 18:05:44,962 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:05:44,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-09-21 18:05:44,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:05:45,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:05:45,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-21 18:05:45,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:39 [2018-09-21 18:05:45,263 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 66 treesize of output 50 [2018-09-21 18:05:45,282 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:05:45,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 34 [2018-09-21 18:05:45,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:05:45,312 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:05:45,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-21 18:05:45,354 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:84, output treesize:46 [2018-09-21 18:05:47,876 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:05:47,877 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:05:47,893 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:05:47,893 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-09-21 18:05:47,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-21 18:05:47,894 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-21 18:05:47,894 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2018-09-21 18:05:47,895 INFO L87 Difference]: Start difference. First operand 381 states and 432 transitions. Second operand 21 states. [2018-09-21 18:05:48,677 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-09-21 18:05:51,202 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-21 18:05:52,804 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2018-09-21 18:05:55,817 WARN L178 SmtUtils]: Spent 438.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-09-21 18:05:56,862 WARN L178 SmtUtils]: Spent 342.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-09-21 18:05:59,303 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-09-21 18:06:45,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:06:45,230 INFO L93 Difference]: Finished difference Result 392 states and 444 transitions. [2018-09-21 18:06:45,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-21 18:06:45,232 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 79 [2018-09-21 18:06:45,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:06:45,234 INFO L225 Difference]: With dead ends: 392 [2018-09-21 18:06:45,234 INFO L226 Difference]: Without dead ends: 387 [2018-09-21 18:06:45,235 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=128, Invalid=1204, Unknown=0, NotChecked=0, Total=1332 [2018-09-21 18:06:45,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-09-21 18:06:45,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2018-09-21 18:06:45,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-09-21 18:06:45,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 434 transitions. [2018-09-21 18:06:45,249 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 434 transitions. Word has length 79 [2018-09-21 18:06:45,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:06:45,251 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 434 transitions. [2018-09-21 18:06:45,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-21 18:06:45,251 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 434 transitions. [2018-09-21 18:06:45,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-21 18:06:45,255 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:06:45,255 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:45,255 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:06:45,256 INFO L82 PathProgramCache]: Analyzing trace with hash -647934951, now seen corresponding path program 1 times [2018-09-21 18:06:45,256 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:06:45,256 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:06:45,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:06:47,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:06:47,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:06:47,666 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 14 treesize of output 11 [2018-09-21 18:06:47,673 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 11 treesize of output 10 [2018-09-21 18:06:47,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:06:47,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:06:47,697 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:06:47,698 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-21 18:06:47,740 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 20 treesize of output 16 [2018-09-21 18:06:47,746 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 16 treesize of output 4 [2018-09-21 18:06:47,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:06:47,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:06:47,763 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:06:47,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-21 18:06:47,990 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:06:47,990 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:06:48,030 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:06:48,030 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-21 18:06:48,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-21 18:06:48,031 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-21 18:06:48,031 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-21 18:06:48,032 INFO L87 Difference]: Start difference. First operand 383 states and 434 transitions. Second operand 8 states. [2018-09-21 18:06:48,632 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-21 18:06:51,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:06:51,962 INFO L93 Difference]: Finished difference Result 514 states and 584 transitions. [2018-09-21 18:06:51,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-21 18:06:51,963 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 80 [2018-09-21 18:06:51,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:06:51,966 INFO L225 Difference]: With dead ends: 514 [2018-09-21 18:06:51,966 INFO L226 Difference]: Without dead ends: 369 [2018-09-21 18:06:51,967 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-09-21 18:06:51,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-09-21 18:06:51,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2018-09-21 18:06:51,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-09-21 18:06:51,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 406 transitions. [2018-09-21 18:06:51,977 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 406 transitions. Word has length 80 [2018-09-21 18:06:51,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:06:51,978 INFO L480 AbstractCegarLoop]: Abstraction has 369 states and 406 transitions. [2018-09-21 18:06:51,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-21 18:06:51,978 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 406 transitions. [2018-09-21 18:06:51,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-09-21 18:06:51,979 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:06:51,979 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:51,980 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:06:51,980 INFO L82 PathProgramCache]: Analyzing trace with hash -599484888, now seen corresponding path program 1 times [2018-09-21 18:06:51,983 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:06:51,983 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:06:51,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:06:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:06:52,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:06:52,313 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:06:52,314 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:06:52,331 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:06:52,331 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-21 18:06:52,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-21 18:06:52,332 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-21 18:06:52,332 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-21 18:06:52,333 INFO L87 Difference]: Start difference. First operand 369 states and 406 transitions. Second operand 3 states. [2018-09-21 18:06:52,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:06:52,453 INFO L93 Difference]: Finished difference Result 373 states and 411 transitions. [2018-09-21 18:06:52,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-21 18:06:52,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-09-21 18:06:52,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:06:52,460 INFO L225 Difference]: With dead ends: 373 [2018-09-21 18:06:52,461 INFO L226 Difference]: Without dead ends: 373 [2018-09-21 18:06:52,461 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 97 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:06:52,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-09-21 18:06:52,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 371. [2018-09-21 18:06:52,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-09-21 18:06:52,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 408 transitions. [2018-09-21 18:06:52,473 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 408 transitions. Word has length 99 [2018-09-21 18:06:52,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:06:52,474 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 408 transitions. [2018-09-21 18:06:52,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-21 18:06:52,474 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 408 transitions. [2018-09-21 18:06:52,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-09-21 18:06:52,478 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:06:52,478 INFO L376 BasicCegarLoop]: trace histogram [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] [2018-09-21 18:06:52,479 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:06:52,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1608147090, now seen corresponding path program 1 times [2018-09-21 18:06:52,481 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:06:52,482 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) [2018-09-21 18:06:52,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2018-09-21 18:06:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:06:52,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:06:53,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:06:53,063 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-21 18:06:53,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-21 18:06:53,609 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-21 18:06:53,610 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-09-21 18:06:53,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-21 18:06:53,610 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-21 18:06:53,611 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-09-21 18:06:53,611 INFO L87 Difference]: Start difference. First operand 371 states and 408 transitions. Second operand 6 states. [2018-09-21 18:06:53,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:06:53,792 INFO L93 Difference]: Finished difference Result 383 states and 423 transitions. [2018-09-21 18:06:53,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-21 18:06:53,795 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2018-09-21 18:06:53,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:06:53,798 INFO L225 Difference]: With dead ends: 383 [2018-09-21 18:06:53,798 INFO L226 Difference]: Without dead ends: 383 [2018-09-21 18:06:53,799 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-09-21 18:06:53,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-09-21 18:06:53,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2018-09-21 18:06:53,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-09-21 18:06:53,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 423 transitions. [2018-09-21 18:06:53,812 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 423 transitions. Word has length 103 [2018-09-21 18:06:53,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:06:53,812 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 423 transitions. [2018-09-21 18:06:53,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-21 18:06:53,812 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 423 transitions. [2018-09-21 18:06:53,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-09-21 18:06:53,816 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:06:53,816 INFO L376 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:53,817 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:06:53,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1454759472, now seen corresponding path program 2 times [2018-09-21 18:06:53,817 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:06:53,819 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) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2018-09-21 18:06:53,830 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-09-21 18:06:54,134 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-09-21 18:06:54,134 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-21 18:06:54,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:06:54,207 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-09-21 18:06:54,207 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:06:54,222 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:06:54,222 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-21 18:06:54,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-21 18:06:54,223 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-21 18:06:54,223 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-21 18:06:54,224 INFO L87 Difference]: Start difference. First operand 383 states and 423 transitions. Second operand 4 states. [2018-09-21 18:06:54,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:06:54,373 INFO L93 Difference]: Finished difference Result 391 states and 434 transitions. [2018-09-21 18:06:54,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-21 18:06:54,375 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2018-09-21 18:06:54,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:06:54,378 INFO L225 Difference]: With dead ends: 391 [2018-09-21 18:06:54,379 INFO L226 Difference]: Without dead ends: 391 [2018-09-21 18:06:54,379 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-21 18:06:54,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-09-21 18:06:54,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 385. [2018-09-21 18:06:54,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-09-21 18:06:54,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 425 transitions. [2018-09-21 18:06:54,398 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 425 transitions. Word has length 115 [2018-09-21 18:06:54,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:06:54,398 INFO L480 AbstractCegarLoop]: Abstraction has 385 states and 425 transitions. [2018-09-21 18:06:54,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-21 18:06:54,398 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 425 transitions. [2018-09-21 18:06:54,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-09-21 18:06:54,400 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:06:54,400 INFO L376 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 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] [2018-09-21 18:06:54,403 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:06:54,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1038345048, now seen corresponding path program 1 times [2018-09-21 18:06:54,404 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:06:54,405 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) [2018-09-21 18:06:54,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2018-09-21 18:06:54,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:06:54,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:06:54,841 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 14 treesize of output 11 [2018-09-21 18:06:54,860 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 11 treesize of output 10 [2018-09-21 18:06:54,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:06:54,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:06:54,900 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:06:54,900 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-21 18:06:54,982 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 20 treesize of output 16 [2018-09-21 18:06:54,992 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 16 treesize of output 4 [2018-09-21 18:06:54,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:06:55,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:06:55,016 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:06:55,016 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-21 18:06:55,613 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-09-21 18:06:55,943 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-09-21 18:06:56,306 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-09-21 18:06:56,926 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-21 18:06:56,926 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-21 18:06:58,940 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-21 18:06:58,956 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-21 18:06:58,957 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 20 [2018-09-21 18:06:58,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-21 18:06:58,960 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-21 18:06:58,960 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-09-21 18:06:58,961 INFO L87 Difference]: Start difference. First operand 385 states and 425 transitions. Second operand 20 states. [2018-09-21 18:07:04,703 WARN L178 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-09-21 18:07:06,300 WARN L178 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2018-09-21 18:07:06,877 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-09-21 18:07:08,016 WARN L178 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-09-21 18:07:09,295 WARN L178 SmtUtils]: Spent 355.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-09-21 18:07:13,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:07:13,570 INFO L93 Difference]: Finished difference Result 414 states and 457 transitions. [2018-09-21 18:07:13,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-21 18:07:13,573 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 119 [2018-09-21 18:07:13,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:07:13,576 INFO L225 Difference]: With dead ends: 414 [2018-09-21 18:07:13,576 INFO L226 Difference]: Without dead ends: 414 [2018-09-21 18:07:13,577 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 218 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=184, Invalid=1298, Unknown=0, NotChecked=0, Total=1482 [2018-09-21 18:07:13,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-09-21 18:07:13,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 399. [2018-09-21 18:07:13,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-09-21 18:07:13,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 441 transitions. [2018-09-21 18:07:13,586 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 441 transitions. Word has length 119 [2018-09-21 18:07:13,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:07:13,587 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 441 transitions. [2018-09-21 18:07:13,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-21 18:07:13,587 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 441 transitions. [2018-09-21 18:07:13,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-09-21 18:07:13,591 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:07:13,591 INFO L376 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 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] [2018-09-21 18:07:13,591 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:07:13,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1207234406, now seen corresponding path program 1 times [2018-09-21 18:07:13,592 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:07:13,592 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) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2018-09-21 18:07:13,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:07:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:07:13,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:07:14,055 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 14 treesize of output 11 [2018-09-21 18:07:14,072 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 11 treesize of output 10 [2018-09-21 18:07:14,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:07:14,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:07:14,109 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:07:14,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-21 18:07:14,207 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 20 treesize of output 16 [2018-09-21 18:07:14,226 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 16 treesize of output 4 [2018-09-21 18:07:14,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:07:14,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:07:14,332 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:07:14,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-21 18:07:16,821 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-21 18:07:16,821 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-21 18:07:17,308 WARN L178 SmtUtils]: Spent 483.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2018-09-21 18:07:17,532 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-09-21 18:07:17,684 WARN L178 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-09-21 18:07:18,186 WARN L178 SmtUtils]: Spent 499.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-09-21 18:07:18,681 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-21 18:07:18,682 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-21 18:07:18,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-21 18:07:18,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:07:18,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:07:19,264 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-21 18:07:19,264 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-21 18:07:19,813 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-21 18:07:19,836 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-09-21 18:07:19,836 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7, 7] total 27 [2018-09-21 18:07:19,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-21 18:07:19,837 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-21 18:07:19,837 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2018-09-21 18:07:19,838 INFO L87 Difference]: Start difference. First operand 399 states and 441 transitions. Second operand 27 states. [2018-09-21 18:07:24,674 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-09-21 18:07:26,319 WARN L178 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-09-21 18:07:49,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:07:49,948 INFO L93 Difference]: Finished difference Result 504 states and 571 transitions. [2018-09-21 18:07:49,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-21 18:07:49,950 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 119 [2018-09-21 18:07:49,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:07:49,952 INFO L225 Difference]: With dead ends: 504 [2018-09-21 18:07:49,953 INFO L226 Difference]: Without dead ends: 435 [2018-09-21 18:07:49,956 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=503, Invalid=3036, Unknown=1, NotChecked=0, Total=3540 [2018-09-21 18:07:49,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-09-21 18:07:49,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 431. [2018-09-21 18:07:49,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-09-21 18:07:49,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 479 transitions. [2018-09-21 18:07:49,976 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 479 transitions. Word has length 119 [2018-09-21 18:07:49,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:07:49,978 INFO L480 AbstractCegarLoop]: Abstraction has 431 states and 479 transitions. [2018-09-21 18:07:49,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-21 18:07:49,979 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 479 transitions. [2018-09-21 18:07:49,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-09-21 18:07:49,982 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:07:49,983 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:49,984 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:07:49,984 INFO L82 PathProgramCache]: Analyzing trace with hash -469756354, now seen corresponding path program 1 times [2018-09-21 18:07:49,985 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:07:49,985 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) [2018-09-21 18:07:50,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2018-09-21 18:07:55,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:07:56,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:07:56,222 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:07:56,223 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:07:56,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 27 treesize of output 35 [2018-09-21 18:07:56,236 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:07:56,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-21 18:07:56,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:07:56,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:07:56,328 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:07:56,328 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-09-21 18:07:56,389 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:07:56,390 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:07:56,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 45 treesize of output 49 [2018-09-21 18:07:56,405 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:07:56,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2018-09-21 18:07:56,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:07:56,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:07:56,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-21 18:07:56,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:46 [2018-09-21 18:07:56,601 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 26 treesize of output 20 [2018-09-21 18:07:56,612 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:07:56,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-09-21 18:07:56,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:07:56,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:07:56,688 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:07:56,688 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:14 [2018-09-21 18:07:57,032 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:07:57,032 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:07:57,116 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:07:57,117 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-21 18:07:57,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-21 18:07:57,119 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-21 18:07:57,120 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-21 18:07:57,121 INFO L87 Difference]: Start difference. First operand 431 states and 479 transitions. Second operand 8 states. [2018-09-21 18:08:00,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:08:00,245 INFO L93 Difference]: Finished difference Result 547 states and 605 transitions. [2018-09-21 18:08:00,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-21 18:08:00,246 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 125 [2018-09-21 18:08:00,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:08:00,249 INFO L225 Difference]: With dead ends: 547 [2018-09-21 18:08:00,250 INFO L226 Difference]: Without dead ends: 431 [2018-09-21 18:08:00,250 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-09-21 18:08:00,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-09-21 18:08:00,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2018-09-21 18:08:00,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-09-21 18:08:00,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 478 transitions. [2018-09-21 18:08:00,265 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 478 transitions. Word has length 125 [2018-09-21 18:08:00,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:08:00,267 INFO L480 AbstractCegarLoop]: Abstraction has 431 states and 478 transitions. [2018-09-21 18:08:00,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-21 18:08:00,267 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 478 transitions. [2018-09-21 18:08:00,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-09-21 18:08:00,272 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:08:00,273 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:00,273 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:08:00,275 INFO L82 PathProgramCache]: Analyzing trace with hash -737366029, now seen corresponding path program 1 times [2018-09-21 18:08:00,279 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:08:00,279 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) [2018-09-21 18:08:00,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2018-09-21 18:08:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-21 18:08:04,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:08:04,952 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 14 treesize of output 11 [2018-09-21 18:08:04,960 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 11 treesize of output 10 [2018-09-21 18:08:04,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:08:04,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:08:04,996 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:08:04,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:20 [2018-09-21 18:08:05,060 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 20 treesize of output 16 [2018-09-21 18:08:05,067 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 16 treesize of output 4 [2018-09-21 18:08:05,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:08:05,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:08:05,091 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:08:05,092 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:14 [2018-09-21 18:08:05,478 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:08:05,479 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-21 18:08:05,555 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-21 18:08:05,555 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-21 18:08:05,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-21 18:08:05,556 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-21 18:08:05,556 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-21 18:08:05,557 INFO L87 Difference]: Start difference. First operand 431 states and 478 transitions. Second operand 9 states. [2018-09-21 18:08:06,243 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-21 18:08:12,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-21 18:08:12,264 INFO L93 Difference]: Finished difference Result 433 states and 479 transitions. [2018-09-21 18:08:12,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-21 18:08:12,267 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 126 [2018-09-21 18:08:12,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-21 18:08:12,271 INFO L225 Difference]: With dead ends: 433 [2018-09-21 18:08:12,271 INFO L226 Difference]: Without dead ends: 182 [2018-09-21 18:08:12,271 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-09-21 18:08:12,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-09-21 18:08:12,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-09-21 18:08:12,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-09-21 18:08:12,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 207 transitions. [2018-09-21 18:08:12,279 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 207 transitions. Word has length 126 [2018-09-21 18:08:12,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-21 18:08:12,279 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 207 transitions. [2018-09-21 18:08:12,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-21 18:08:12,279 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 207 transitions. [2018-09-21 18:08:12,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-09-21 18:08:12,285 INFO L368 BasicCegarLoop]: Found error trace [2018-09-21 18:08:12,285 INFO L376 BasicCegarLoop]: trace histogram [11, 10, 10, 8, 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] [2018-09-21 18:08:12,285 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-21 18:08:12,286 INFO L82 PathProgramCache]: Analyzing trace with hash 909720224, now seen corresponding path program 2 times [2018-09-21 18:08:12,286 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-21 18:08:12,286 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:08:12,297 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-09-21 18:08:12,791 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-21 18:08:12,792 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-21 18:08:12,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-21 18:08:13,121 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:08:13,130 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:08:13,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 27 treesize of output 35 [2018-09-21 18:08:13,177 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:08:13,278 INFO L303 Elim1Store]: Index analysis took 142 ms [2018-09-21 18:08:13,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2018-09-21 18:08:13,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:08:13,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:08:13,485 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:08:13,485 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2018-09-21 18:08:14,075 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:08:14,089 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:08:14,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 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 54 treesize of output 56 [2018-09-21 18:08:14,144 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:08:14,204 INFO L303 Elim1Store]: Index analysis took 107 ms [2018-09-21 18:08:14,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-09-21 18:08:14,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:08:14,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:08:14,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-09-21 18:08:14,321 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:55 [2018-09-21 18:08:14,416 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 35 treesize of output 27 [2018-09-21 18:08:14,424 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:08:14,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2018-09-21 18:08:14,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-21 18:08:14,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-21 18:08:14,471 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:08:14,471 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-09-21 18:08:17,266 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 122 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-09-21 18:08:17,266 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-21 18:08:19,229 WARN L178 SmtUtils]: Spent 1.96 s on a formula simplification that was a NOOP. DAG size: 114 [2018-09-21 18:08:19,497 WARN L178 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-09-21 18:08:19,747 WARN L178 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-09-21 18:08:20,007 WARN L178 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-09-21 18:08:20,891 WARN L178 SmtUtils]: Spent 878.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-09-21 18:08:21,134 WARN L178 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-09-21 18:08:21,299 WARN L178 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-09-21 18:08:21,493 WARN L178 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-09-21 18:08:21,521 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:08:21,531 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:08:21,540 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:08:21,550 INFO L700 Elim1Store]: detected not equals via solver [2018-09-21 18:08:21,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 98 [2018-09-21 18:08:21,577 INFO L682 Elim1Store]: detected equality via solver [2018-09-21 18:08:21,861 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2018-09-21 18:08:21,863 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimCell_36 term size 36 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:383) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:430) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) 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) [2018-09-21 18:08:21,877 INFO L168 Benchmark]: Toolchain (without parser) took 742214.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 953.2 MB in the beginning and 986.6 MB in the end (delta: -33.4 MB). Peak memory consumption was 134.9 MB. Max. memory is 11.5 GB. [2018-09-21 18:08:21,878 INFO L168 Benchmark]: CDTParser took 0.19 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:08:21,879 INFO L168 Benchmark]: CACSL2BoogieTranslator took 808.95 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 921.0 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:08:21,879 INFO L168 Benchmark]: Boogie Preprocessor took 265.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 921.0 MB in the beginning and 1.1 GB in the end (delta: -213.6 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2018-09-21 18:08:21,879 INFO L168 Benchmark]: RCFGBuilder took 50915.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 126.0 MB). Peak memory consumption was 126.0 MB. Max. memory is 11.5 GB. [2018-09-21 18:08:21,879 INFO L168 Benchmark]: TraceAbstraction took 690215.18 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24.6 MB). Free memory was 1.0 GB in the beginning and 986.6 MB in the end (delta: 22.0 MB). Peak memory consumption was 46.7 MB. Max. memory is 11.5 GB. [2018-09-21 18:08:21,887 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.19 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 808.95 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 921.0 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 265.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 921.0 MB in the beginning and 1.1 GB in the end (delta: -213.6 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 50915.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 126.0 MB). Peak memory consumption was 126.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 690215.18 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24.6 MB). Free memory was 1.0 GB in the beginning and 986.6 MB in the end (delta: 22.0 MB). Peak memory consumption was 46.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_36 term size 36 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimCell_36 term size 36: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...